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

91182273364 · Jun 202019922001200920172026
48 results for continuous formulation

Continuous formulation of machine learning models and algorithms.

problem Generalization error and implicit regularization in machine learning.
method Continuous formulation in calculus of variations and differential-integral equations, with new models and algorithms.
result Conventional models and algorithms can be recovered as particular discretizations.

Formulates superhedging under costs and uncertainty for continuous assets.

problem Superhedging with transaction costs and model uncertainty for continuous processes.
method New topological framework for continuous asset prices with parametric model uncertainty.
result Formulates a superhedging theorem in the presence of transaction costs and model uncertainty.

We show that a trader, who starts with no initial wealth and is not allowed to borrow money or short sell assets, is theoretically able to attain positive wealth by continuous trading, provided that she has perfect foresight of future asset prices, given by a continuous semimartingale. Such an arbitrage strategy can be…

2016-04-26abs ↗pdf ↗

New method improves robust low-rank matrix completion for computer vision.

problem Robust low-rank matrix completion for partially observed data.
method Formulated as a nonsmooth Riemannian optimization problem over Grassmann manifold, solved with an alternating manifold proximal gradient continuation method.
result Demonstrated advantages over existing approaches in background extraction from surveillance videos.

This work takes up the challenges of utility maximization problem when the market is indivisible and the transaction costs are included. First there is a so-called solvency region given by the minimum margin requirement in the problem formulation. Then the associated utility maximization is formulated as an optimal swi…

2010-03-15abs ↗pdf ↗

The paper develops RL methods for optimal switching between multiple states.

problem Optimal switching between multiple states in continuous time.
method Entropy-regularized exploration, HJB equations, policy improvement, value function convergence.
result The RL algorithm converges to optimal policies as temperature parameter vanishes.

The paper analyzes continuous optimization for DAG structure learning and its limitations.

problem The performance of continuous structure learning approaches is not consistent after data standardization.
method Analysis of continuous optimization for DAG structure learning, focusing on equal and non-equal noise variances.
result Continuous structure learning approaches may not perform well after data standardization, especially with non-equal noise variances.

Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how to compare graphs. This problem is often formulated as a graph matching problem where one seeks a mapping between vertices of two graphs whic…

2010-04-28abs ↗pdf ↗

Continuous time framework for discrete data denoising models.

problem Efficient training and sampling for discrete data denoising models.
method Formulated as Continuous Time Markov Chains (CTMCs), efficient training using continuous time ELBO, high-dimensional CTMC simulation, novel theoretical error bound.
result Continuous time treatment enables novel theoretical error bound between generated and true data distributions.

This paper formulates a model of utility for a continuous time framework that captures the decision-maker's concern with ambiguity about both the drift and volatility of the driving process. At a technical level, the analysis requires a significant departure from existing continuous time modeling because it cannot be d…

2011-03-08abs ↗pdf ↗

In many applications that involve processing high-dimensional data, it is important to identify a small set of entities that account for a significant fraction of detections. Rather than formalize this as a clustering problem, in which all detections must be grouped into hard or soft categories, we formalize it as an i…

2018-05-08abs ↗pdf ↗

New conic quadratic formulations improve outlier detection in regression models.

problem Detecting outliers in regression models with corrupted data.
method Deriving stronger second-order conic relaxations without big-M constraints.
result Proposed formulations are significantly faster than existing methods.

Paper develops compact formulations for optimization problems with rank-one convex functions and indicator variables.

problem Optimization problems involving rank-one convex functions with support constraints.
method Perspective reformulation techniques to exploit conic structure and establish convex hull results.
result Systematic perspective formulations for convex hull descriptions of sets with nonlinear separable or non-separable objective functions and combinatorial constraints.

We propose a novel score-based approach to learning a directed acyclic graph (DAG) from observational data. We adapt a recently proposed continuous constrained optimization formulation to allow for nonlinear relationships between variables using neural networks. This extension allows to model complex interactions while…

2019-06-05abs ↗pdf ↗

Framework for safely updating machine learning models.

problem Continuous updates to machine learning models can lead to unintended consequences.
method Formalizes the problem as computing the largest locally invariant domain (LID), uses tractable primal-dual formulation.
result Matches or exceeds heuristic baselines for avoiding forgetting while providing formal safety guarantees.

The paper interprets policy-gradient algorithms using continuation theory.

problem Optimizing nonconvex functions in reinforcement learning.
method Formulates policy optimization as optimization by continuation, interprets policy-gradient algorithms as implicitly optimizing deterministic policies.
result Exploration in policy-gradient algorithms is seen as computing a continuation of the return of the policy.

This paper introduces a new reward shaping method for average-reward reinforcement learning.

problem Speeding up convergence to an optimal policy in average-reward reinforcement learning tasks.
method Developed a temporal logic-based approach to automatically generate reward shaping functions.
result The optimal policy can be recovered using the proposed reward shaping framework.

Paper robustifies reinforcement learning with risk-averse methods.

problem Making predictions robust to changes in system dynamics or rewards.
method Approximates Robust Reinforcement Learning using ΦΦ-divergence and Risk-Averse formulation.
result Classical Reinforcement Learning can be robustified using standard deviation penalization.

In this paper we continue our analysis of a formulation of electrodynamics fully covariant under the full Poincaré group. Transformations under the four different components of the group force on us the introduction of particles, either in the identification by Feynman or in the identification of Dirac.

2007-08-27abs ↗pdf ↗

The paper proves the law of one price in a continuous-time setting without friction.

problem Identifying conditions under which the law of one price holds in a continuous-time setting without frictions.
method Formulating a new mechanism for LOP failure and proving a novel variant of the uniform boundedness principle.
result Establishes the equivalence of the economic concept of LOP with the probabilistic property of the existence of a local $\scr{E}$-martingale state price density.

We provide a model-free pricing-hedging duality in continuous time. For a frictionless market consisting of dd risky assets with continuous price trajectories, we show that the purely analytic problem of finding the minimal superhedging price of a path dependent European option has the same value as the purely probabi…

2017-05-08abs ↗pdf ↗