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

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for structured problems

Symmetric CNNs improve sequential recommendation and protein structure prediction.

problem Improving prediction accuracy in sequential recommendation and protein structure inference.
method Developed a CNN architecture that preserves symmetry in convolutional layers, using parameterized convolutional kernels.
result Symmetric structured CNNs achieve better performance with fewer parameters.

Paper formalizes a reinforcement learning model for complex information structures.

problem Complex interdependence in sequential decision-making problems.
method Formalizes a novel reinforcement learning model with explicit information structure representation.
result Upper bound on sample complexity of learning general sequential decision-making problems.

Graph-to-Tree Neural Networks improve structured input-output translation in tasks like semantic parsing and math word problems.

problem Improving performance on tasks like semantic parsing and math word problem solving.
method Graph-to-Tree Neural Networks, consisting of a graph encoder and a hierarchical tree decoder.
result Graph2Tree model outperforms or matches state-of-the-art models on neural semantic parsing and math word problem tasks.

New algorithm learns any part of a Bayesian network structure efficiently.

problem Learning specific parts of a Bayesian network structure is computationally inefficient.
method APS-L, a new algorithm that divides V-structures into collider and non-collider types and recursively finds them in Markov blankets.
result The APSL algorithm efficiently and accurately learns any part of a Bayesian network structure.

We construct a canonical frame for an arbitrary Gl(2)-structure thus solving the equivalence problem for Gl(2)-structures. Our treatment includes also a problem of contact equivalence of ordinary differential equations and applies to certain classes of vector distributions. Additionally we characterise Gl(2)-structures…

2010-12-03abs ↗pdf ↗

Solves geometric problems using fully nonlinear equations and Morse theory.

problem Geometric problems, specifically Loewner-Nirenberg and Yamabe problems.
method Investigates structure of fully nonlinear equations and applies Morse theory techniques.
result Constructs admissible metrics under weak conditions and demonstrates topological obstructions.

Unified framework for high-dimensional bandit problems with low-dimensional structures.

problem Stochastic high-dimensional bandit problems with low-dimensional structures.
method Proposed a simple unified algorithm and a general analysis framework for the regret upper bound.
result Unified algorithm achieves comparable regret bounds in various high-dimensional bandit problems.

We present updates to the problems on Hirzebruch's 1954 problem list focussing on open problems, and on those where substantial progress has been made in recent years. We discuss some purely topological problems, as well as geometric problems about (almost) complex structures, both algebraic and non-algebraic, about co…

2013-05-20abs ↗pdf ↗

We provide a unified treatment of a broad class of noisy structure recovery problems, known as structured normal means problems. In this setting, the goal is to identify, from a finite collection of Gaussian distributions with different means, the distribution that produced some observed data. Recent work has studied s…

2015-06-25abs ↗pdf ↗

The paper explores projective structures on curves and their applications in conformal geometry.

problem Finding qualitative information about solutions of Hill equations.
method Detailed description of projective structures and their isomorphism classes, correcting previous inaccuracies.
result The Yamabe problem for curves has no general solutions in a conformal/Möbius ambient space.

Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. While sometimes the underlying task relationship structure is known, often the structure needs to be estimated from data at hand. In this paper, we present a novel family of models for MTL, applicable…

2014-09-01abs ↗pdf ↗

Among closed G2-structures there are two very distinguished classes: Laplacian solitons and Extremally Ricci-pinched G2-structures. We study the existence problem and explore possible interplays between these concepts in the context of left-invariant G2-structures on solvable Lie groups. Also, some Ricci pinching prope…

2018-10-18abs ↗pdf ↗

We solve the local equivalence problem for sub-Riemannian structures on (2n + 1)-dimensional manifolds. We show that two sub-Riemannian structures are locally equivalent if and only if? their corresponding canonical linear connections are equivalent. When n = 1, these connections coincide with the generalized Tanaka-We…

2011-07-19abs ↗pdf ↗

Researchers found the longest arcs for specific sub-Lorentzian structures.

problem Finding the longest arcs for sub-Lorentzian structures.
method Optimal control problem with unbounded control set and concave cost functional. Sufficient conditions for existence of longest arcs proposed.
result Existence of the longest arcs for left-invariant three-dimensional contact sub-Lorentzian structures proved.

A thesis submitted for the degree of Doctor of Philosophy of The Australian National University. In this work we introduce several new optimisation methods for problems in machine learning. Our algorithms broadly fall into two categories: optimisation of finite sums and of graph structured objectives. The finite sum pr…

2015-10-09abs ↗pdf ↗

Symmetric TSP is structurally equivalent to a constrained Group Steiner Tree Problem.

problem Finding the shortest tour in a symmetric TSP.
method Structural equivalence between symmetric TSP and constrained Group Steiner Tree Problem.
result Maximizing net weight in the cGSTP is equivalent to minimizing the TSP tour length.

We study the problem of structured prediction under test-time budget constraints. We propose a novel approach applicable to a wide range of structured prediction problems in computer vision and natural language processing. Our approach seeks to adaptively generate computationally costly features during test-time in ord…

2016-02-28abs ↗pdf ↗

Tackles network structure inference from time series data using GNN.

problem Inferring network structure from incomplete or no information.
method Gumbel Graph Network (GGN) model for network reconstruction and completion.
result GGN can reconstruct up to 100% network structure and infer missing parts with up to 90% accuracy.

We reduce the embedding problem for hypo SU(2) and SU(3)-structures to the embedding problem for hypo G2-structures into parallel Spin(7)-manifolds. The latter will be described in terms of gauge deformations. This description involves the intrinsic torsion of the initial G2-structure and allows us to prove that the ev…

2009-09-30abs ↗pdf ↗

Efficiently computes robust option prices using multi-marginal martingale transport.

problem Computing robust option prices under martingale constraints.
method Extending state space, sequential martingale structure, entropic regularisation.
result Fast computation of optimal solutions for large problems.

This paper is a continuation of Part I where the general setup was developed. Here we discuss the general equivalence problem for geometric structures and provide criteria for the equivalence, local and global, of transitive structures. Cartan's Flag Systems illustrate the theory as a major example and, finally, some a…

2014-12-29abs ↗pdf ↗

This is a personal view of some problems on minimal surfaces, Ricci flow, polyhedral geometric structures, Haken 4-manifolds, contact structures and Heegaard splittings, singular incompressible surfaces after the Hamilton-Perelman revolution.

2009-03-31abs ↗pdf ↗

Unified framework for structure learning via conditional independence testing.

problem Optimal structure learning and conditional independence testing.
method Established a fundamental connection and reduction between structure learning and conditional independence testing.
result Optimal rates for structure learning are determined by conditional independence testing rates.

Given an n~\widetilde n-dimensional manifold M~\widetilde M equipped with a G~\widetilde G-structure π~:P~M~\widetildeπ:\widetilde P\rightarrow \widetilde M, there is a naturally induced GG-structure π:PMπ: P\rightarrow M on any submanifold MM~M\subset\widetilde M that satisfies appropriate regularity conditions. We study gen…

2013-06-28abs ↗pdf ↗

Structured prediction provides a general framework to deal with supervised problems where the outputs have semantically rich structure. While classical approaches consider finite, albeit potentially huge, output spaces, in this paper we discuss how structured prediction can be extended to a continuous scenario. Specifi…

2018-06-26abs ↗pdf ↗

On asymptotically complex hyperbolic (ACH) Einstein manifolds, we consider a certain variational problem for almost complex structures compatible with the metric, for which the linearized Euler-Lagrange equation at Kähler-Einstein structures is given by the Dolbeault Laplacian acting on (0,1)(0,1)-forms with values in the…

2018-12-23abs ↗pdf ↗

A successful approach to structured learning is to write the learning objective as a joint function of linear parameters and inference messages, and iterate between updates to each. This paper observes that if the inference problem is "smoothed" through the addition of entropy terms, for fixed messages, the learning ob…

2014-07-03abs ↗pdf ↗

The article resolves complex structures in transport twistor spaces, proving a Newlander-Nirenberg theorem.

problem Degenerate complex structures in transport twistor spaces.
method Holomorphic blow-down structure maps to resolve degeneracy and gain insight into complex geometry.
result Global and local β-maps for various metrics, proving a Newlander-Nirenberg theorem for degenerate complex structures.