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,742 papers · 148 categories

Trend · papers per month

175349524698 · Jun 202019922001200920172026
48 results for space objects

SPACE models complex scenes by decomposing objects and backgrounds.

problem Scalability and unsupervised object-oriented scene representation learning.
method Generative latent variable model combining spatial-attention and scene-mixture approaches.
result SPACE achieves factorized object representations and decomposes complex scenes.

Paper develops a new objective for hierarchical clustering in Euclidean space.

problem Hierarchical clustering in Euclidean space with dissimilarity scores.
method Develops a new global objective and connects it to bisecting k-means.
result Optimal 2-means solution approximates the new objective, proving bisecting k-means optimizes a natural global objective.

Deep learning identifies space objects from uncorrelated observations.

problem Finding small groups of observations of the same space objects from a large set of uncorrelated data.
method Training a deep learning model on a large data set of uncorrelated observations to identify groups of observations likely of the same space objects.
result The model correctly identified 83.1% of observation pairs as belonging to the same space object.

We find a one-to-one correspondence between full extrinsic symmetric spaces in (possibly degenerate) inner product spaces and certain algebraic objects called (weak) extrinsic symmetric triples. In particular, this yields a description of arbitrary extrinsic symmetric spaces in pseudo-Euclidean spaces by corresponding …

2008-09-26abs ↗pdf ↗

The notion of expense in Bayesian optimisation generally refers to the uniformly expensive cost of function evaluations over the whole search space. However, in some scenarios, the cost of evaluation for black-box objective functions is non-uniform since different inputs from search space may incur different costs for …

2019-09-09abs ↗pdf ↗

A new Adamize method improves multi-objective recommender systems.

problem Improving recommendation systems with multiple conflicting objectives.
method Developed a multi-objective model-agnostic Adamize method that corrects and stabilizes gradients.
result Significant improvements in recommendation systems, measured by hypervolume, coverage, and spacing.

In this paper, we investigate the possibility of improving the performance of multi-objective optimization solution approaches using machine learning techniques. Specifically, we focus on multi-objective binary linear programs and employ one of the most effective and recently developed criterion space search algorithms…

2019-01-30abs ↗pdf ↗

This paper studies continuum-armed bandits under Besov smoothness conditions and derives minimax rates.

problem Optimizing an unknown function with limited evaluations.
method Studies continuum-armed bandits under Besov smoothness conditions and derives minimax rates.
result Minimax rates over Besov spaces are identical to those over the smallest Hölder space into which Besov spaces embed.

Learning robot objective functions from human input has become increasingly important, but state-of-the-art techniques assume that the human's desired objective lies within the robot's hypothesis space. When this is not true, even methods that keep track of uncertainty over the objective fail because they reason about …

2018-10-11abs ↗pdf ↗

Introduces R-SSM for modeling multi-object dynamics with GNNs and normalizing flows.

problem Complex interactions and evolutions in multi-object systems are hard to model.
method Relational state-space model (R-SSM) using graph neural networks (GNNs) and normalizing flows.
result Empirically validated on synthetic and real datasets.

A simple trick invoking objective B-fields is employed to refine the concept of characteristic classes for twisted bundles. Then the objective stability and objective Einstein metrics are introduced and a new Hitchin-Kobayashi correspondence is established between them. As an application the SO(3)-instanton moduli spac…

2009-07-28abs ↗pdf ↗

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.

ADS explains object differences by quantifying and removing underlying properties.

problem Explaining differences between two object images.
method Align-Deform-Subtract (ADS) framework that uses semantic alignments and iterative quantification/removal of differences.
result ADS provides disentangled error measures explaining object differences in terms of underlying properties.

Paper proposes redundancy-free features for zero-shot object recognition.

problem Redundant visual features degrade zero-shot object recognition.
method Project original features into a new, statistically independent space.
result RFF-GZSL achieves competitive results on benchmark datasets.

We propose a formulation of a Lorentzian quantum geometry based on the framework of causal fermion systems. After giving the general definition of causal fermion systems, we deduce space-time as a topological space with an underlying causal structure. Restricting attention to systems of spin dimension two, we derive th…

2011-07-11abs ↗pdf ↗

Bayesian optimisation framework considers only variable orderings to handle ill-conditioned objectives.

problem Bayesian optimisation fails with ill-conditioned or discontinuous objectives.
method Proposes a new framework that considers only the ordering of variables in input and output spaces, fitting a Gaussian process in a latent space.
result Proves optimal performance under the measure of regret for an optimistic strategy in the latent space.

We define a concept which we call multiplicity. First, multiplicity of a morphism is defined. Then the multiplicity of an object over another object is defined to be the minimum of the multiplicities of all morphisms from one to another. Based on this multiplicity, we define a pseudo distance on the class of objects. W…

2011-01-10abs ↗pdf ↗

Study KKT conditions for multi-objective optimization on Hadamard manifolds.

problem Optimizing multi-objective interval-valued functions on Hadamard manifolds.
method Developed KKT conditions for Pareto optimal solutions under different ordering and convexity notions.
result Results are more general than on Euclidean spaces.

A new method for faster multi-objective optimization by evaluating objectives separately.

problem Finding the Pareto front of trade-offs between multiple objectives efficiently.
method Knowledge Gradient with decoupled evaluations, accounting for different costs.
result The method significantly outperforms existing approaches in terms of evaluation cost.

Novel NAS method balances performance and hardware metrics efficiently.

problem Challenging multi-objective optimization in neural architecture search.
method Parameterizes joint architectural distribution via hypernetwork conditioned on hardware features and preferences.
result Zero-shot transferability to new devices with representative and diverse architectures.

A new method for optimizing hierarchical multi-objective problems.

problem Symmetry and neglect of objective hierarchy in existing multi-objective methods.
method Priority-Constrained Descent (PCD) framework exploiting hierarchical objective structures.
result Pareto dominance and better per-objective performance with secondary progress guarantees.

Proposes a novel algorithm for multi-objective reinforcement learning.

problem Challenges in setting numerical preferences for objectives in different units and scales.
method Learn action distributions for each objective and use supervised learning to fit a parametric policy.
result Demonstrates effectiveness on robotics tasks, allowing tracing out the space of nondominated solutions.

Proposes a method to learn both constraints and objective functions from data.

problem Data-driven inverse optimization for mixed-integer linear programs (MILPs).
method Two-stage approach: first learns constraints, then estimates objective-function weights conditioned on learned constraints.
result Proposes and validates a method for learning both objective functions and constraints from data.

Equivariant quantization is a new theory that highlights the role of symmetries in the relationship between classical and quantum dynamical systems. These symmetries are also one of the reasons for the recent interest in quantization of singular spaces, orbifolds, stratified spaces... In this work, we prove existence o…

2010-01-26abs ↗pdf ↗

We compare various different definitions of "the category of smooth objects". The definitions compared are due to Chen, Frölicher, Sikorski, Smith, and Souriau. The method of comparison is to construct functors between the categories that enable us to see how the categories relate to each other. This produces a diagram…

2008-02-15abs ↗pdf ↗

The central object of synthetic differential geometry is microlinear spaces. In our previous paper [Microlinearity in Frolicher spaces -beyond the regnant philosophy of manifolds-, International Journal of Pure and Applied Mathematics, 60 (2010), 15-24] we have emancipated microlinearity from within well-adapted models…

2010-02-22abs ↗pdf ↗

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 ↗

Generative models create indistinguishable adversarial objects for object detection.

problem Creating unrestricted adversarial examples for object detection.
method Search over latent space of GAN for adversarial objects.
result Generated adversarial objects are indistinguishable from non-adversarial objects and transferable.

We introduce a scalable approach for object pose estimation trained on simulated RGB views of multiple 3D models together. We learn an encoding of object views that does not only describe an implicit orientation of all objects seen during training, but can also relate views of untrained objects. Our single-encoder-mult…

2019-08-01abs ↗pdf ↗

Galatius, Madsen, Tillmann and Weiss have identified the homotopy type of the classifying space of the cobordism category with objects (d-1)-dimensional manifolds embedded in R^\infty. In this paper we apply the techniques of spaces of manifolds, as developed by the author and Galatius, to identify the homotopy type of…

2009-12-13abs ↗pdf ↗