Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

2356 · Jun 202019922001200920172026
48 results for object-based

OBSER framework infers sub-environments from objects, outperforming scene-based methods.

problem Zero-shot recognition of environments from object distributions.
method Bayesian framework using metric and self-supervised learning models to estimate object distributions in latent space.
result OBSER framework reliably performs inference in open-world and photorealistic environments, outperforming scene-based methods.

Object-based approaches for learning action-conditioned dynamics has demonstrated promise for generalization and interpretability. However, existing approaches suffer from structural limitations and optimization difficulties for common environments with multiple dynamic objects. In this paper, we present a novel self-s…

2019-04-16abs ↗pdf ↗

The paper introduces a new metric to quantify uncertainty's impact on multiple objectives.

problem Quantifying the impact of uncertainty on multiple objectives in complex systems.
method Proposes the mean multi-objective cost of uncertainty (multi-objective MOCU) to quantify uncertainty.
result Demonstrates the effectiveness of the multi-objective MOCU in real-world applications.

New algorithm B++&C improves hierarchical clustering on large deep embedding datasets.

problem Scaling up hierarchical clustering to massive datasets of deep embeddings.
method Proposes B++&C algorithm for practical hierarchical clustering, introduces B2SAT&C for theoretical approximation.
result Achieves 5%/20% improvement on MW/CKMM objectives compared to classic methods.

We propose a probabilistic generative model for unsupervised learning of structured, interpretable, object-based representations of visual scenes. We use amortized variational inference to train the generative model end-to-end. The learned representations of object location and appearance are fully disentangled, and ob…

2019-09-25abs ↗pdf ↗

Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial nn may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to the inverse braid monoids. Namely we prove an inclusion into a monoid of partial m…

2007-04-23abs ↗pdf ↗

As a contribution to interpretable machine learning research, we develop a novel optimization framework for learning accurate and sparse two-level Boolean rules. We consider rules in both conjunctive normal form (AND-of-ORs) and disjunctive normal form (OR-of-ANDs). A principled objective function is proposed to trade …

2016-06-18abs ↗pdf ↗

We propose a deep learning approach for discovering kernels tailored to identifying clusters over sample data. Our neural network produces sample embeddings that are motivated by--and are at least as expressive as--spectral clustering. Our training objective, based on the Hilbert Schmidt Information Criterion, can be o…

2019-08-09abs ↗pdf ↗

Deep learning solves complex stochastic control with jumps.

problem Solving high-dimensional stochastic control tasks with jumps.
method Model-based approach using two neural networks, iteratively trained with objectives derived from the Hamilton-Jacobi-Bellman equation.
result Demonstrates effectiveness in solving complex high-dimensional stochastic control tasks.

Likelihood from a generative model is a natural statistic for detecting out-of-distribution (OoD) samples. However, generative models have been shown to assign higher likelihood to OoD samples compared to ones from the training distribution, preventing simple threshold-based detection rules. We demonstrate that OoD det…

2019-10-21abs ↗pdf ↗

A method to prevent image representation collapse through data-dependent augmentation.

problem Representation collapse due to image augmentations that damage information.
method Formalizing a stochastic encoding process with a tug-of-war between corruption and preserved information, using infoMax objective.
result Learning a data-dependent distribution of augmentations to avoid representation collapse.

Study non-Weinstein Liouville geometry via hyperbolic dynamics, proving rigidity results.

problem Characterize non-Weinstein Liouville geometry with persistent transverse skeleton.
method Anosov 3-flows, Liouville Interpolation Systems, non-singular partially hyperbolic flows, hyperbolic dynamics.
result Mitsumatsu's examples characterize 4D non-Weinstein Liouville geometry with 3D persistent transverse skeleton.

We propose a novel autoencoding model called Pairwise Augmented GANs. We train a generator and an encoder jointly and in an adversarial manner. The generator network learns to sample realistic objects. In turn, the encoder network at the same time is trained to map the true data distribution to the prior in latent spac…

2018-10-11abs ↗pdf ↗

The task of clustering a set of objects based on multiple sources of data arises in several modern applications. We propose an integrative statistical model that permits a separate clustering of the objects for each data source. These separate clusterings adhere loosely to an overall consensus clustering, and hence the…

2013-02-28abs ↗pdf ↗

Text style transfer aims to modify the style of a sentence while keeping its content unchanged. Recent style transfer systems often fail to faithfully preserve the content after changing the style. This paper proposes a structured content preserving model that leverages linguistic information in the structured fine-gra…

2018-10-15abs ↗pdf ↗

Building on a specific formalization of analogical relationships of the form "A relates to B as C relates to D", we establish a connection between two important subfields of artificial intelligence, namely analogical reasoning and kernel-based machine learning. More specifically, we show that so-called analogical propo…

2019-01-07abs ↗pdf ↗

In this work, we study a new approach to optimizing the margin distribution realized by binary classifiers. The classical approach to this problem is simply maximization of the expected margin, while more recent proposals consider simultaneous variance control and proxy objectives based on robust location estimates, in…

2018-10-11abs ↗pdf ↗

Paper proposes an end-to-end learning method for state estimation in robotics.

problem Lack of annotated data for optimising dynamic and measurement models in particle filters.
method End-to-end learning objective based on maximising a pseudo-likelihood function.
result Improves state estimation when large portions of true states are unknown.

Proposes new loss functions for GANs to improve estimation accuracy and robustness.

problem Improving the training of GANs to achieve more accurate and robust models.
method Introduces Hellinger-type loss functions and analyzes their statistical properties.
result Demonstrates improved estimation accuracy and robustness of the proposed loss functions.

Ensuring that classifiers are non-discriminatory or fair with respect to a sensitive feature (e.g., race or gender) is a topical problem. Progress in this task requires fixing a definition of fairness, and there have been several proposals in this regard over the past few years. Several of these, however, assume either…

2019-01-24abs ↗pdf ↗

Self-supervised learning excels in topic modeling by being less model-specific.

problem How self-supervised learning discovers useful representations in topic models.
method Applying self-supervised learning objectives to topic model-generated data.
result Self-supervised learning objectives can recover useful posterior information for topic models, outperforming misspecified models.

A structured understanding of our world in terms of objects, relations, and hierarchies is an important component of human cognition. Learning such a structured world model from raw sensory data remains a challenge. As a step towards this goal, we introduce Contrastively-trained Structured World Models (C-SWMs). C-SWMs…

2019-11-27abs ↗pdf ↗

Forward-prediction models enhance physical reasoning, but only for specific tasks.

problem Improving physical reasoning in complex tasks involving many objects.
method Incorporated forward-prediction models into simple physical-reasoning agents and evaluated their performance on the PHYRE benchmark.
result Forward-prediction models improve physical-reasoning performance, especially on complex tasks, but generalization to new task templates is challenging.

An increasing array of biomedical and computer vision applications requires the predictive modeling of complex data, for example images and shapes. The main challenge when predicting such objects lies in the fact that they do not comply to the assumptions of Euclidean geometry. Rather, they occupy non-linear spaces, a.…

2017-01-29abs ↗pdf ↗

We speed up marginal inference by ignoring factors that do not significantly contribute to overall accuracy. In order to pick a suitable subset of factors to ignore, we propose three schemes: minimizing the number of model factors under a bound on the KL divergence between pruned and full models; minimizing the KL dive…

2012-03-15abs ↗pdf ↗

A central goal of unsupervised learning is to acquire representations from unlabeled data or experience that can be used for more effective learning of downstream tasks from modest amounts of labeled data. Many prior unsupervised learning works aim to do so by developing proxy objectives based on reconstruction, disent…

2018-10-04abs ↗pdf ↗

In Multi-Goal Reinforcement Learning, an agent learns to achieve multiple goals with a goal-conditioned policy. During learning, the agent first collects the trajectories into a replay buffer, and later these trajectories are selected randomly for replay. However, the achieved goals in the replay buffer are often biase…

2019-05-21abs ↗pdf ↗

Despite their impressive performance, deep neural networks exhibit striking failures on out-of-distribution inputs. One core idea of adversarial example research is to reveal neural network errors under such distribution shifts. We decompose these errors into two complementary sources: sensitivity and invariance. We sh…

2018-11-01abs ↗pdf ↗

This paper tackles fairness in PCA by balancing it with reconstruction error.

problem Fairness concerns in PCA due to different group representation errors.
method A multi-objective optimization approach to balance fairness and reconstruction error.
result Achieving fairness with minimal loss in reconstruction error.