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

Trend · papers per month

118235353470 · Jun 202019922001200920172026
48 results for object types

BFPM improves machine learning accuracy by considering object types and memberships flexibly.

problem Inaccurate learning due to missing important parameters.
method BFPM relaxes fuzzy and possibilistic constraints, allowing arbitrary object memberships and movement analysis.
result BFPM enhances object movement analysis and provides flexible search space.

We study periodic monopoles satisfying some mild conditions, called of GCK type. Particularly, we give a classification of periodic monopoles of GCK type in terms of difference modules with parabolic structure, which is a kind of Kobayashi-Hitchin correspondence between differential geometric objects and algebraic obje…

2017-12-25abs ↗pdf ↗

The paper shows objective derivatives are covariant derivatives on Riemannian metrics.

problem The definition and interpretation of objective derivatives in continuum mechanics.
method Demonstrates that objective derivatives correspond to covariant derivatives on the manifold of Riemannian metrics.
result Objective derivatives are unified as covariant derivatives on the manifold of Riemannian metrics.

New approach infers object type from physical data and functional requirements.

problem Classical design theory treats object type as a given, but this paper argues it should be inferred.
method C-DMBD, a constrained extension of Dynamic Markov Blanket Detection algorithm, models product surface as a Markov blanket.
result Requirement-steered inference is computationally tractable and models different object types with different parameterizations.

Proposes class-agnostic object detection to handle all objects without class labels.

problem Difficulty and cost in creating annotated datasets limit conventional object detection models to specific object types.
method Proposes class-agnostic object detection as a new problem and proposes training and evaluation protocols. Uses adversarial learning to exclude class-specific information.
result Adversarial learning improves class-agnostic detection efficacy.

In this paper, the notion of strongly typed language will be borrowed from the field of computer programming to introduce a calculational framework for linear algebra and tensor calculus for the purpose of detecting errors resulting from inherent misuse of objects and for finding natural formulations of various objects…

2012-12-11abs ↗pdf ↗

This paper is based on a previous publication [29]. Our work extends exception mining and outlier detection to the case of object-relational data. Object-relational data represent a complex heterogeneous network [12], which comprises objects of different types, links among these objects, also of different types, and at…

2018-07-01abs ↗pdf ↗

This paper studies finite type invariants for welded string links and ribbon tubes, showing characterizations and algebraic structures.

problem Finite type invariants for ribbon knotted surfaces and their relation to welded string links.
method Developed a theory of finite type invariants for welded string links up to wkw_k-equivalence, studied algebraic structures, and showed characterizations.
result Characterizes the information contained by finite type invariants in low degrees for welded string links.

We classify all fusion categories for a given set of fusion rules with three simple object types. If a conjecture of Ostrik is true, our classification completes the classification of fusion categories with three simple object types. To facilitate the discussion we describe a convenient, concrete and useful variation o…

2007-04-02abs ↗pdf ↗

Modern graph or network datasets often contain rich structure that goes beyond simple pairwise connections between nodes. This calls for complex representations that can capture, for instance, edges of different types as well as so-called "higher-order interactions" that involve more than two nodes at a time. However, …

2019-10-22abs ↗pdf ↗

The paper explores Finsler-type objects and their variational problems on spacetimes.

problem Generalizing Einstein equations to the Finsler setting.
method Study of the ladder of Finsler-type objects and their variational problems.
result Application of the ladder structure to variational proposals for Finsler spacetimes.

We leverage automatic differentiation (AD) and probabilistic programming to develop an end-to-end optimization algorithm for batch triangulation of a large number of unknown objects. Given noisy detections extracted from noisily geo-located street level imagery without depth information, we jointly estimate the number …

2018-11-21abs ↗pdf ↗

We present a multi-objective Bayesian optimisation algorithm that allows the user to express preference-order constraints on the objectives of the type "objective A is more important than objective B". These preferences are defined based on the stability of the obtained solutions with respect to preferred objective fun…

2019-02-12abs ↗pdf ↗

New invariant fully describes finite type invariants of knots in homology 3-spheres.

problem Constructing a universal finite type invariant for knots in homology 3-spheres.
method Refined construction of a new invariant that is strictly stronger and universal.
result New invariant fully describes the graded space of finite type invariants of knots in homology 3-spheres.

TOQ-Nets learn to recognize complex temporal events with varying objects and sequences.

problem Recognizing complex relational-temporal events with varying numbers of objects and sequence lengths.
method Neuro-symbolic networks with reasoning layers for finite-domain quantification over objects and time.
result TOQ-Nets can generalize to scenarios with more objects than training data and temporal warpings.

We consider the problem of learning object arrangements in a 3D scene. The key idea here is to learn how objects relate to human poses based on their affordances, ease of use and reachability. In contrast to modeling object-object relationships, modeling human-object relationships scales linearly in the number of objec…

2012-06-27abs ↗pdf ↗

The study learns neural update rules by remembering past experiences.

problem Developing efficient online learning rules for neural networks.
method Representing neurons with vectors, using meta-neural networks for updates, and training for remembering past experiences.
result The approach reveals insights into learning rules and could be used for complex tasks like episodic memory.

Jacobi/Poisson algebras are algebraic counterparts of Jacobi/Poisson manifolds. We introduce representations of a Jacobi algebra AA and Frobenius Jacobi algebras as symmetric objects in the category. A characterization theorem for Frobenius Jacobi algebras is given in terms of integrals on Jacobi algebras. For a vecto…

2014-06-13abs ↗pdf ↗

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 ↗

A new objective function using Jensen-Shannon divergence improves generative learning from multiple data types.

problem Learning from multiple data types efficiently and accurately.
method Proposes a novel objective function using Jensen-Shannon divergence to approximate multimodal posteriors directly.
result The mmJSD objective optimizes an ELBO and improves generative learning tasks.

We classify the torsion pairs in a tube category and show that they are in bijection with maximal rigid objects in the extension of the tube category containing the Pruefer and adic modules. We show that the annulus geometric model for the tube category can be extended to the larger category and interpret torsion pairs…

2011-12-28abs ↗pdf ↗

Study optimality conditions for interval-valued optimization problems on Riemannian manifolds.

problem Optimizing interval-valued functions on Riemannian manifolds under a total order relation.
method Generalized Hukuhara directional differentiability to derive KKT-type optimality conditions.
result Derives optimality conditions for interval-valued optimization problems on Riemannian manifolds.

The paper clusters hypergraphs to find diverse and experienced groups based on past experiences.

problem Finding diverse and experienced groups with respect to past experiences.
method Regularized edge-based hypergraph clustering objective with a 2-approximation algorithm.
result Demonstrates an efficient 2-approximation algorithm for clustering hypergraphs.

In X-ray binary star systems consisting of a compact object that accretes material from an orbiting secondary star, there is no straightforward means to decide if the compact object is a black hole or a neutron star. To assist this classification, we develop a Bayesian statistical model that makes use of the fact that …

2015-07-13abs ↗pdf ↗

Generalized Roter type manifold is a generalization of conformally flat manifold as well as Roter type manifold, which gives rise the form of the curvature tensor in terms of algebraic combinations of the fundamental metric tensor and Ricci tensors upto level 2. The object of the present paper is to investigate the cha…

2014-11-04abs ↗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 ↗

Algorithm identifies Pareto optimal designs efficiently for noisy, multi-objective functions.

problem Optimizing multi-objective functions with noisy data and large design spaces.
method Adaptive discretization and tree-based approach to identify Pareto optimal designs.
result Algorithm identifies Pareto optimal designs with fewer evaluations than exhaustive search.