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.

169,181 papers · 148 categories

Trend · papers per month

8.8%17.7%26.5%35.4% · Mar 202619922001200920182026
48 results for dual framework

Proposes a new tensor completion method using dual framework and Riemannian optimization.

problem Low-rank tensor completion with sparse or non-sparse tensor combinations.
method Dual framework, latent trace norm, Riemannian optimization, trust region algorithm.
result Shows the optimal solution lies on a Cartesian product of Riemannian manifolds.

Unified framework for Arnold-type invariants via dual complexes and finite-difference structures.

problem Study of Arnold-type invariants of immersed curves and surfaces.
method Framework on dual complexes, locally normalized maps, finite-difference structures, and Shumakovitch-type identities.
result Unified evaluation of Arnold-type invariants St(1)St_{(1)} and St(2)St_{(2)} on dual skeleta.

This work studies the strong duality of non-convex matrix factorization problems: we show that under certain dual conditions, these problems and its dual have the same optimum. This has been well understood for convex optimization, but little was known for non-convex problems. We propose a novel analytical framework an…

2017-04-27abs ↗pdf ↗

We present a primal-dual algorithmic framework to obtain approximate solutions to a prototypical constrained convex optimization problem, and rigorously characterize how common structural assumptions affect the numerical efficiency. Our main analysis technique provides a fresh perspective on Nesterov's excessive gap te…

2014-06-20abs ↗pdf ↗

Unified geometric framework for quantum states using dual number algebras.

problem Representing quantum states in a geometrically unified way.
method Smooth embeddings into higher-order dual number algebras and algebraic flows.
result Established nilpotent dual algebras as a geometric landscape for quantum kinematics.

Geometric framework for inverse problems using foliations and dual connections.

problem Reconstruction problems in inverse problems.
method Vaisman foliations and Atiyah--Molino sequences to induce transverse foliations and dual connections.
result Unique, path-independent reconstruction with vanishing torsion and curvature duality.

A new method for non-negative matrix factorization using generalized dual divergence.

problem Non-negative matrix factorization for various noise structures.
method Theoretical framework based on generalized dual Kullback-Leibler divergence, with algorithms developed and proven convergence using Expectation-Maximization.
result Generalizes existing methods and provides an alternative for non-negative matrix factorizations.

Dual representations for robust risk measures and uncertainty sets.

problem Characterizing continuity of robust risk measures and their uncertainty sets.
method Develop dual representations for robust risk measures and uncertainty sets based on distinct geometric assumptions.
result Two dual frameworks for consolidated uncertainty sets are complementary, not interchangeable.

The classical duality theory of Kantorovich and Kellerer for the classical optimal transport is generalized to an abstract framework and a characterization of the dual elements is provided. This abstract generalization is set in a Banach lattice X\cal{X} with a order unit. The primal problem is given as the supremum o…

2016-10-10abs ↗pdf ↗

APDO optimizes CMDPs with off-policy dual updates for faster convergence.

problem Learning policies that maximize long-term reward while satisfying safety constraints.
method Accelerated Primal-Dual Optimization (APDO) incorporating off-policy dual updates.
result APDO achieves better sample efficiency and faster convergence than existing methods.

A new method for distributed optimization reduces communication rounds without minibatches.

problem Efficient training in distributed machine learning with different data distributions.
method A primal-dual method (GA-MSGD) applied to the Lagrangian of distributed optimization.
result Achieves linear convergence in communication rounds for strongly convex objectives.

DCCNNs reduce computational overhead and ambiguity in convolutional neural networks.

problem Reducing computational overhead and ambiguity in convolutional neural networks.
method Introducing a primal learning problem and constructing a dual convex training program, using Fenchel conjugates and Karush-Kuhn-Tucker conditions.
result Eliminates ambiguity and reduces computational overhead in constructing a large kernel matrix.

We introduce a proximal version of dual coordinate ascent method. We demonstrate how the derived algorithmic framework can be used for numerous regularized loss minimization problems, including 1\ell_1 regularization and structured output SVM. The convergence rates we obtain match, and sometimes improve, state-of-the-…

2012-11-12abs ↗pdf ↗

CADE learns dual node representations for better generalization.

problem Transductive graph embeddings cannot generalize to unseen nodes or across different graphs.
method CADE combines real-time neighborhoods with neighbor-attentioned representation, preserving known node memory.
result CADE outperforms state-of-the-art methods in generalization and context-awareness.

Optimal hedging framework with variational preferences under convex risk measures.

problem Optimal hedging with variational preferences under convex risk measures.
method Theoretical hedging optimization framework with dual representation of risk measures and utilities.
result Derivation of optimality and indifference pricing conditions.

DSPI connects natural policy gradient to policy iteration, proving global convergence.

problem Optimizing policies in reinforcement learning.
method DSPI framework, combining smoothed policy iteration and natural policy gradient.
result DSPI achieves geometric convergence and optimal complexity for policy optimization.

Multi-task learning aims to learn multiple tasks jointly by exploiting their relatedness to improve the generalization performance for each task. Traditionally, to perform multi-task learning, one needs to centralize data from all the tasks to a single machine. However, in many real-world applications, data of differen…

2016-12-13abs ↗pdf ↗

The paper explores reductions of self-dual conformal structure equations.

problem Integrating the general local form of self-dual conformal structure.
method Using Lax pair, hierarchy structure, and dressing scheme to discuss reductions.
result Constructs solutions for the SDCS equations and presents type B SDCS system.

The aim of this work is to study the foliations on the complex projective plane with flat \textsc{Legendre} transform (dual web). We establish some effective criteria for the flatness of the dual dd-web of a homogeneous foliation of degree dd and we describe some explicit examples. These results allow us to show that…

2016-07-04abs ↗pdf ↗

A new description, different by the classical theory of Hamiltonian Mechanics, in the general framework of generalized Lie algebroids is presented. In the particular case of Lie algebroids, new and important results are obtained. We present the \emph{dual mechanical systems} called by use, \emph{dual mechanical}$(ρ,η) …

2011-08-25abs ↗pdf ↗

Constructs differential models for twisted Spin^c-bordism and its dual, defining a new anomaly map.

problem Modeling and understanding twisted Spin^c-bordism and its dual.
method Geometric construction using bundle gerbes, gerbe modules, and eta-invariants.
result Definition of a twisted anomaly map from differential twisted K-theory to differential Anderson dual of twisted Spin^c-bordism.

Adapts IRL for dual-system agents, correcting goal inference errors.

problem Inferring goals from dual-system decision-making behaviors.
method Generalized dual-system framework, optimal plan computation, adapted IRL algorithm.
result Correct goal inference for dual-system agents improves overall utility.

We present a general framework for measuring the liquidity risk. The theoretical framework defines a class of risk measures that incorporate the liquidity risk into the standard risk measures. We consider a one-period risk measurement model. The liquidity risk is defined as the risk that a given security or a portfolio…

2014-12-21abs ↗pdf ↗

Classifies singularities of ruled and developable surfaces using geometric algebra.

problem Characterizing singularities of ruled and developable surfaces.
method Combining dual quaternion algebra and Singularity Theory.
result Local topological type of singular developable surfaces determined by dual torsion vanishing order.

Graph-based methods provide a powerful tool set for many non-parametric frameworks in Machine Learning. In general, the memory and computational complexity of these methods is quadratic in the number of examples in the data which makes them quickly infeasible for moderate to large scale datasets. A significant effort t…

2013-09-26abs ↗pdf ↗

The financial crisis showed the importance of measuring, allocating and regulating systemic risk. Recently, the systemic risk measures that can be decomposed into an aggregation function and a scalar measure of risk, received a lot of attention. In this framework, capital allocations are added after aggregation and can…

2016-07-12abs ↗pdf ↗

Extends Lie bialgebroids for string and M theories with new calculus framework.

problem Formalize calculus on algebroids for string and M theories.
method Reinterpret matched pairs of Leibniz algebroids, examine algebroid axioms, construct double on direct sum.
result Construct Drinfel'd double of Lie bialgebroids for general algebroids.