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

231463694925 · Jun 202019922001200920172026
48 results for quadratic problem

Paper addresses quadratic feasibility problems and their sample complexity.

problem Recovering complex vectors from quadratic measurements.
method Analyzes conditions for identifiability and explores optimization landscape.
result Gradient algorithms can converge to globally optimal solutions with high probability.

The paper classifies biharmonic quadratic maps between spheres, proving their energy density properties.

problem Classifying non-harmonic biharmonic quadratic forms between spheres.
method Proving non-harmonic biharmonic quadratic forms have constant energy density and classifying them.
result Non-harmonic biharmonic quadratic forms have constant energy density (m+1)/2(m+1)/2.

Paper proposes a QUBO formulation that reduces binary variables in Bayesian network learning.

problem Reducing the number of binary variables in QUBO formulations for Bayesian network learning.
method Proposes a new QUBO formulation that minimizes binary variables.
result Significantly reduces the number of binary variables required for Bayesian network structure learning.

The paper solves a utility-based hedging problem with quadratic costs.

problem Optimal trading strategy for hedging European contingent claims with quadratic transaction costs.
method Duality theory applied to exponential utility maximization problem.
result Explicit computation of optimal trading strategy for quadratic payoffs.

The paper studies optimal transport in linear quadratic systems and derives interpolation inequalities.

problem Optimal transport problem in Linear Quadratic optimal control systems.
method Well-posedness of the Monge problem, regularity of optimal transport map, displacement interpolation of measures.
result Derivation of general interpolation inequalities for entropy functionals.

Market maker optimizes SPX and VIX spread using quadratic rough Heston model.

problem Maximizing profit from SPX and VIX spread while managing inventory risk.
method Uses quadratic rough Heston model to optimize multi-asset market making problem, approximating high-dimensional optimization.
result Asymptotic closed-form solution for optimization problem.

Paper develops methods for non-quadratic loss low-rank matrix recovery.

problem Recovery of low-rank matrices with non-quadratic losses.
method Projected gradient method with a regularity projection oracle.
result Projected gradient method converges globally and linearly.

A new algorithm for solving constrained convex optimization problems efficiently.

problem Constrained convex optimization problems requiring high accuracy solutions.
method Second-Order Conditional Gradient Sliding (SOCGS) algorithm, using projection-free methods to solve quadratic subproblems inexactly.
result Converges quadratically in primal gap after a finite number of linearly convergent iterations.

Paper presents an ADMM-based approach to efficiently integrate quadratic programming layers into neural networks.

problem Integrating quadratic programs into neural networks for optimization.
method An ADMM-based network layer architecture for solving quadratic programs efficiently.
result The ADMM layer is approximately an order of magnitude faster than existing methods for medium scaled problems.

Investment strategy optimization from discrete to continuous models.

problem Optimizing investment strategies and stopping times in both continuous and discrete settings.
method Characterized value functions via quadratic reflected BSDEs for continuous case, discretized BSDEs for discrete case, and derived uniform convergence rates.
result Uniform convergence and rate from discrete to continuous quadratic reflected BSDEs.

We introduce O-systems (Definition \ref{DO}) of orthogonal transformations of Rm{\Bbb R}^{m}, and establish 111-1 correspondences both between equivalence classes of Clifford systems and that of O-systems, and between O-systems and orthogonal multiplications of the form $μ:{\Bbb R}^{n} \times {\Bbb R}^{m} \longrightarr…

1995-11-03abs ↗pdf ↗

To determine the Lie groups that admit a flat (eventually complete) left invariant semi-Riemannian metric is an open and difficult problem. The main aim of this paper is the study of the flatness of left invariant semi Riemannian metrics on quadratic Lie groups i.e. Lie groups endowed with a bi-invariant semi Riemannia…

2011-03-07abs ↗pdf ↗

New method solves constrained stochastic optimization problems efficiently.

problem Online statistical inference of constrained stochastic nonlinear optimization problems.
method Stochastic Sequential Quadratic Programming (StoSQP) with iterative sketching solver.
result The rescaled primal-dual sequence converges to a mean-zero Gaussian distribution.

QENDy learns quadratic dynamics from nonlinear systems data.

problem Identifying governing equations of highly nonlinear dynamical systems.
method QENDy embeds nonlinear dynamics into a quadratic feature space, requiring trajectory data and preselected basis functions.
result QENDy accurately identifies quadratic dynamics and outperforms SINDy and deep learning methods.

To estimate the conditional probability functions based on the direct problem setting, V-matrix based method was proposed. We construct V-matrix based constrained quadratic programming problems for which the inequality constraints are inconsistent. In particular, we would like to present that the constrained quadratic …

2018-08-27abs ↗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.

The study examines portfolio optimization with quadratic transaction costs, complicating the optimization process.

problem Portfolio optimization with quadratic transaction costs is more challenging than with linear costs.
method Introduced numerical algorithms to solve the optimization problem with quadratic transaction costs.
result Quadratic transaction costs significantly impact the expected returns of optimized portfolios.

Algorithm reduces regret in partially observable systems by learning dynamics and using optimistic control.

problem Minimizing regret in partially observable linear quadratic control systems with unknown dynamics.
method ExpCommit algorithm that learns model parameters and uses optimism in uncertainty.
result End-to-end sublinear regret upper bound of O~(T2/3)\tilde{\mathcal{O}}(T^{2/3}) for ExpCommit.

This paper introduces a method to incorporate risk sensitivity in RL using quadratic variation penalties.

problem Risk-sensitive reinforcement learning under entropy regularization.
method Equivalent martingale property and quadratic variation penalty for value process.
result The proposed method improves finite-sample performance in linear-quadratic control problems.

In this paper, we analyze a real-valued reflected backward stochastic differential equation (RBSDE) with an unbounded obstacle and an unbounded terminal condition when its generator ff has quadratic growth in the zz-variable. In particular, we obtain existence, comparison, and stability results, and consider the opti…

2010-05-19abs ↗pdf ↗

Extends quadratic loss for SVM and deep learning to improve pattern correlation.

problem Improving generalization in supervised binary classification and regression tasks.
method Extends quadratic loss, restarts from problem (8) in [3], proposes new algorithms, uses multiple kernel learning.
result Comparable results with standard losses and parameterized quadratic loss.

New geometric Joyce structures on moduli spaces of quadratic differentials.

problem Constructing Joyce structures on moduli spaces of quadratic differentials.
method Isomonodromic deformations of second-order linear ODEs with rational potential.
result Construction of Joyce structures on moduli spaces of quadratic differentials.

Optimal contracts are found for agents with quadratic effort costs.

problem Finding optimal contracts in principal-agent problems with quadratic effort costs.
method Modeling the problem using Hamilton-Jacobi-Bellman (HJB) equations and proving the existence of classical solutions.
result Existence of optimal contracts for agents with quadratic effort costs is proven.

Method solves complex optimization problems with high probability bounds.

problem Nonlinear equality constrained stochastic optimization problems.
method Step-search sequential quadratic programming method.
result High-probability bound on iteration complexity for first-order stationarity.

Solves generalized twisted rabbit problems for higher degree polynomials.

problem When a quadratic polynomial is twisted by a cyclic subgroup, what polynomial is equivalent?
method Uses d2d^2-adic expansion instead of 4-adic for higher degree polynomials.
result Provides a solution that depends on the d2d^2-adic expansion of the power of the mapping class element.

We describe all pseudo-Riemannian metrics on closed surfaces whose geodesic flows admit nontrivial integrals quadratic in momenta. As an application, we solve the Beltrami problem on closed surfaces, prove the nonexistence of quadratically-superintegrable metrics of nonconstant curvature on closed surfaces, and prove t…

2010-02-20abs ↗pdf ↗

We consider the exploration-exploitation tradeoff in linear quadratic (LQ) control problems, where the state dynamics is linear and the cost function is quadratic in states and controls. We analyze the regret of Thompson sampling (TS) (a.k.a. posterior-sampling for reinforcement learning) in the frequentist setting, i.…

2017-03-27abs ↗pdf ↗