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

Trend · papers per month

85171256341 · Jun 202019922001200920172026
48 results for integral quadratic constraints

Unified analysis of first-order methods for smooth games using IQCs.

problem Certify convergence rates of first-order methods for smooth and strongly-monotone games.
method Adapted integral quadratic constraints (IQCs) to study first-order methods and derive tight upper bounds of convergence rates.
result First global convergence rate for the negative momentum method with O(κ1.5)\mathcal{O}(κ^{1.5}) iteration complexity.

Improved stability analysis of neural network systems using Zames-Falb multipliers.

problem Analyzing stability of linear systems with neural network nonlinearities.
method Using integral quadratic constraints, sector-bounded and slope-restricted structure, and acausal Zames-Falb multipliers.
result Flexible and versatile framework for stability analysis with improved computational efficiency.

Alt-GDA outperforms Sim-GDA in minimax games with near-optimal local convergence.

problem Minimax optimization convergence rate comparison
method Alternating Gradient Descent-Ascent (Alt-GDA) vs. Simultaneous Gradient Descent-Ascent (Sim-GDA)
result Alt-GDA achieves near-optimal local convergence rate for strongly convex-strongly concave problems, while Sim-GDA converges slower.

Eigen-decomposition simplifies quadratic programming with equality constraints.

problem Optimizing solutions under linear equality constraints in quadratic programming.
method Eigenvalue decomposition of the quadratic term matrix to project optimal solutions.
result Established a linear mapping between EQP formulations with and without diagonalized QQ.

Marden and Strebel established the Heights Theorem for integrable holomorphic quadratic differentials on parabolic Riemann surfaces. We extends the validity of the Heights Theorem to all surfaces whose fundamental group is of the first kind. In fact, we establish a more general result: the {\it horizontal} map which as…

2019-12-26abs ↗pdf ↗

Volume of unit balls defined by quadratic differentials is not proper and has integrable volume.

problem Characterizing the behavior of volume functions associated with quadratic differentials.
method Analyzing the Thurston volume of unit balls in measured lamination spaces.
result The volume function is not proper and is pp-integrable for any 0<p<10<p<1.

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 characterizes infinite Riemann surfaces and their foliations using quadratic differentials.

problem Characterizing infinite Riemann surfaces and their foliations using quadratic differentials.
method Extending Hubbard-Masur theorem to infinite surfaces and analyzing Jenkins-Strebel differentials.
result Density of Jenkins-Strebel differentials and extension of Kerckhoff's formula for Teichmüller metric.

The framework of Integral Quadratic Constraints (IQC) reduces the computation of upper bounds on the convergence rate of several optimization algorithms to a semi-definite program (SDP). In the case of over-relaxed Alternating Direction Method of Multipliers (ADMM), an explicit and closed form solution to this SDP was …

2017-03-10abs ↗pdf ↗

A framework integrates machine learning with robust control for safer, more reliable systems.

problem Combining machine learning with robust control for systems with stringent safety and reliability requirements.
method Integrates Gaussian Process Regression and state-of-the-art robust controller synthesis within a framework that provides rigorous guarantees.
result Demonstrated improved performance with more data while maintaining rigorous guarantees.

Paper solves optimal portfolio deleveraging with cross asset impacts.

problem Maximize equity while meeting debt/equity requirement with cross asset price impacts.
method Developed successive convex optimization (SCO) and an effective global algorithm integrating SCO, convex relaxation, and branch-and-bound.
result Proposed algorithms find global optimal solutions efficiently.

Using Vovk's outer measure, which corresponds to a minimal superhedging price, the existence of quadratic variation is shown for "typical price paths" in the space of càdlàg functions possessing a mild restriction on the jumps directed downwards. In particular, this result includes the existence of quadratic variation …

2016-09-08abs ↗pdf ↗

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.

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.

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 determine the equilibria of a rigid loop in the plane, subject to the constraints of fixed length and fixed enclosed area. Rigidity is characterized by an energy functional quadratic in the curvature of the loop. We find that the area constraint gives rise to equilibria with remarkable geometrical properties: not on…

2001-03-12abs ↗pdf ↗

We study the constrained linear quadratic regulator with unknown dynamics, addressing the tension between safety and exploration in data-driven control techniques. We present a framework which allows for system identification through persistent excitation, while maintaining safety by guaranteeing the satisfaction of st…

2018-09-26abs ↗pdf ↗

Thurston's boundary to the universal Teichmüller space T(D)T(\mathbb{D}) is the space PMLbdd(D)PML_{bdd}(\mathbb{D}) of projective bounded measured laminations of D\mathbb{D}. A geodesic ray in T(D)T(\mathbb{D}) is of Teichmüller type if it shrinks vertical foliation of an integrable holomorphic quadratic differential. In a prio…

2015-05-28abs ↗pdf ↗

A scalable framework optimizes multi-asset portfolios with constraints.

problem Optimizing multi-asset portfolios with inequality constraints.
method Integrates neural policies with Pontryagin's Maximum Principle, enforcing feasibility via log-barrier regularization.
result Recover KKT-optimal policies in high-dimensional problems without violating constraints.

We study computational and statistical consequences of problem geometry in stochastic and online optimization. By focusing on constraint set and gradient geometry, we characterize the problem families for which stochastic- and adaptive-gradient methods are (minimax) optimal and, conversely, when nonlinear updates -- su…

2019-09-23abs ↗pdf ↗

New method solves optimization problems with stochastic objectives and constraints.

problem Optimization problems with stochastic objectives and deterministic constraints.
method Trust-region interior-point stochastic sequential quadratic programming (TR-IP-SSQP) method.
result Global almost-sure convergence to first-order stationary points under standard assumptions.

New algorithm tackles stochastic optimization with inequality constraints.

problem Stochastic optimization with inequality constraints in various applications.
method Active-set stochastic sequential quadratic programming (StoSQP) with a differentiable exact augmented Lagrangian.
result Global convergence for any initialization, KKT residuals converge to zero almost surely.

The paper proves signatures of non-geometric rough paths can approximate functionals uniformly.

problem Approximating functionals of non-geometric rough paths.
method Extending rough paths with time and quadratic variation terms, proving uniform approximation.
result Linear functionals of extended signatures uniformly approximate continuous functionals.

A new algorithm solves constrained optimization problems with stochastic gradients.

problem Nonlinear equality constrained optimization with rank-deficient Jacobians.
method Step decomposition strategy combining normal and tangential steps.
result Convergence guarantees in rank-deficient Jacobian cases.

We prove that the Steinberg module of the special linear group of a quadratic imaginary number ring which is not Euclidean is not generated by integral apartments. Assuming the generalized Riemann hypothesis, this shows that the Steinberg module of a number ring is generated by integral apartments if and only if the ri…

2018-10-17abs ↗pdf ↗