Our world is full of identical objects (\emph{e.g.}, cans of coke, cars of same model). These duplicates, when seen together, provide additional and strong cues for us to effectively reason about 3D. Inspired by this observation, we introduce Structure from Duplicates (SfD), a novel inverse graphics framework that reconstructs geometry, material, and illumination from a single image containing multiple identical objects. SfD begins by identifying multiple instances of an object within an image, and then jointly estimates the 6DoF pose for all instances. An inverse graphics pipeline is subsequently employed to jointly reason about the shape, material of the object, and the environment light, while adhering to the shared geometry and material constraint across instances.Our primary contributions involve utilizing object duplicates as a robust prior for single-image inverse graphics and proposing an in-plane rotation-robust Structure from Motion (SfM) formulation for joint 6-DoF object pose estimation. By leveraging multi-view cues from a single image, SfD generates more realistic and detailed 3D reconstructions, significantly outperforming existing single image reconstruction models and multi-view reconstruction approaches with a similar or greater number of observations.

Greedy algorithms have long been a workhorse for learning graphical models, and more broadly for learning statistical models with sparse structure. In the context of learning directed acyclic graphs, greedy algorithms are popular despite their worst-case exponential runtime. In practice, however, they are very efficient. We provide new insight into this phenomenon by studying a general greedy score-based algorithm for learning DAGs. Unlike edge-greedy algorithms such as the popular GES and hill-climbing algorithms, our approach is vertex-greedy and requires at most a polynomial number of score evaluations. We then show how recent polynomial-time algorithms for learning DAG models are a special case of this algorithm, thereby illustrating how these order-based algorithms can be rigourously interpreted as score-based algorithms. This observation suggests new score functions and optimality conditions based on the duality between Bregman divergences and exponential families, which we explore in detail. Explicit sample and computational complexity bounds are derived. Finally, we provide extensive experiments suggesting that this algorithm indeed optimizes the score in a variety of settings.

In settings ranging from weather forecasts to political prognostications to financial projections, probability estimates of future binary outcomes often evolve over time. For example, the estimated likelihood of rain on a specific day changes by the hour as new information becomes available. Given a collection of such probability paths, we introduce a Bayesian framework -- which we call the Gaussian latent information martingale, or GLIM -- for modeling the structure of dynamic predictions over time. Suppose, for example, that the likelihood of rain in a week is 50%, and consider two hypothetical scenarios. In the first, one expects the forecast to be equally likely to become either 25% or 75% tomorrow; in the second, one expects the forecast to stay constant for the next several days.

Many networked systems such as electric networks, the brain, and social networks of opinion dynamics are known to obey conservation laws. Examples of this phenomenon include the Kirchoff laws in electric networks and opinion consensus in social networks. Conservation laws in networked systems are modeled as balance equations of the form $X = B^\ast Y$, where the sparsity pattern of $B^\ast \in \mathbb{R}^{p\times p}$ captures the connectivity of the network on $p$ nodes, and $Y, X \in \mathbb{R}^p$ are vectors of ''potentials'' and ''injected flows'' at the nodes respectively. The node potentials $Y$ cause flows across edges which aim to balance out the potential difference, and the flows $X$ injected at the nodes are extraneous to the network dynamics. In several practical systems, the network structure is often unknown and needs to be estimated from data to facilitate modeling, management, and control.

We consider the classical problem of finding the minimum feedback arc set on tournaments (MFAST). The problem is NP-hard in general and we study it for important classes of tournaments that arise naturally in the problem of learning to rank from pairwise comparisons. Specifically, we consider tournaments classes that arise out of parametric preference matrices that can lead to cyclic preference relations. We investigate their structural properties via forbidden sub tournament configurations. Towards this, we introduce \emph{Tournament Dimension} - a combinatorial parameter that characterizes the size of a forbidden configuration for rank $r$ tournament classes i.e., classes that arise out pairwise preference matrices which lead to rank $r$ skew-symmetric matrices under a suitable link function.

The initial motivation seems to be the work of Hoffman et al on the use of clustering to speedup stochastic methods for ERM. Their method was not proved to converge to the optimal due to the use of biased stochastic gradients. Also, that work seemed to work only for small clusters due to the approach chosen. This papers goes a long way to develop the basic idea into a satisfying theoretical framework which also gives rise to efficient implementations. This paper is truly a pleasure to read – a very fine example of academic exposition.

Viral phenomena have been around for almost as long as the internet has. You might remember the dress that took Tumblr by storm back in 2015 – was it blue and black or white and gold? But using ChatGPT, MailOnline tries to settle the debate, which has seen Twitter users go to great lengths to prove whether there are more doors or wheels in the world. MailOnline spoke to ChatGPT – but the answer may surprise you. The bot produced an autogenerated response, admitting defeat in its first sentence: 'It's difficult to provide an exact answer to this question, as it depends on a variety of factors and can change over time' Even OpenAI's proudest invention couldn't directly solve the query that has taken the internet by storm – and puzzled Twitter since last year. The bot produced an autogenerated response, admitting defeat in its first sentence: 'It's difficult to provide an exact answer to this question, as it depends on a variety of factors and can change over time'.

Modeling various aspects of language--syntax, semantics, pragmatics, and discourse, among others--by the use of constrained formal-computational systems, just adequate for such modeling, has proved to be an effective research strategy, leading to deep understanding of these aspects, with implications for both machine processing and human processing. This approach enables one to distinguish between the universal and stipulative constraints.

What are the powerful new ideas in knowledge based design? What important research issues require further investigation? Perhaps the key research problem in AIbased design for the 1980's is to develop better models of the design process. A comprehensive model of design should address the following aspects of the design process: the state of the design; the goal structure of the design process; design decisions; rationales for design decisions; control of the design process; and the role of learning in design This article presents some of the most important ideas emerging from current AI research on design, especially ideas for better models of design It is organized into sections dealing with each of the aspects of design listed above What is design? Why should we study it?

The First International Conference on Intelligent Systems for Molecular Biology (ISMB-93), held 6-9 July 1993 at the Lister Hill Center of the National Library of Medicine (NLM), attracted over 200 computer scientists and biologists from 13 countries. As organizers of the conference, we saw it as the culmination of a series of successful meetings and colloquia, including workshops by the American Association for Artificial Intelligence, that, taken as a whole, indicate that molecular biology is one of the most rapidly growing application areas of AI and warrants a dedicated conference. AAAI was a cosponsor of the meeting and published the proceedings (AAAI Press, Menlo Park CA, ISBN 0-929280-47-4, $45). Extensive additional support in the form of grants was provided by the National Institutes of Health (NIH), primarily through NLM but also through the Division of Computer Research and Technology, and by the Department of Energy Office of Health and Environmental Research (which, like NIH, is heavily involved in the Human Genome Project). Further support was provided by the Biomatrix Society, a group that has a predilection for AI approaches to biological data.