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

Trend · papers per month

75149224298 · Jun 202019922001200920172026
48 results for quadratic matrix equation

Solutions to a quadratic matrix equation are linked to strongly regular graphs and multiplicative characters.

problem Solving a specific quadratic matrix equation in Riemannian geometry.
method Constructing nonzero solutions using group rings and multiplicative characters of finite fields.
result Solutions relate to strongly regular graphs and multiplicative characters of finite fields.

Model liquidity premia using a risk-sharing economy with quadratic costs.

problem Understanding the cross-section of liquidity premia earned by assets with different trading costs.
method Developed a risk-sharing economy model with quadratic transaction costs, leading to matrix-valued Riccati equations for equilibrium.
result Calibrated model to time series data, revealing liquidity premia across assets with varying trading costs.

Study on SGD dynamics and scaling laws for training quadratic neural networks in high dimensions.

problem Optimizing and understanding the training dynamics of quadratic neural networks in high-dimensional settings.
method Sharp analysis of SGD dynamics, combining matrix Riccati differential equations and matrix monotonicity arguments.
result Derivation of scaling laws for prediction risk, highlighting power-law dependencies on optimization time, sample size, and model width.

Solves steering problem with continuous time, Hilbert-Schmidt cost, and matrix ODEs.

problem Fixed horizon linear quadratic covariance steering in continuous time with a specific terminal cost.
method Formulates necessary conditions as a coupled matrix ODE two-point boundary value problem, designs a matricial recursive algorithm, and proves convergence.
result Proposes and proves the convergence of a matricial recursive algorithm for solving the steering problem.

We establish an explicit expression for the conditional Laplace transform of the integrated Volterra Wishart process in terms of a certain resolvent of the covariance function. The core ingredient is the derivation of the conditional Laplace transform of general Gaussian processes in terms of Fredholm's determinant and…

2019-11-18abs ↗pdf ↗

This paper optimizes portfolio selection for multivariate affine and quadratic Volterra models with rough volatilities.

problem Optimizing portfolio selection for multivariate models with rough volatilities and stochastic correlations.
method Investigates continuous-time Markowitz mean-variance problem for multivariate affine and quadratic Volterra models using Riccati backward stochastic differential equations (BSDEs).
result Derives explicit solutions for BSDEs in affine Volterra models and new analytic formulae for quadratic models.

QMME balances cost and speed in convex optimization.

problem Slow convergence of first-order methods and high cost of second-order methods.
method Minimizing quadratic majorants with fixed curvature at each iteration.
result QMME framework achieves sequential convergence under standard assumptions.

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 ↗

Sharp asymptotics reveal how network width controls learnability in quadratic neural networks.

problem Understanding learnability in overparameterized quadratic neural networks.
method Mapping ERM to convex matrix sensing with nuclear norm penalization.
result Characterization of global minima and precise generalization thresholds.

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.

We consider an illiquid financial market where a risk averse investor has to liquidate a portfolio within a finite time horizon [0,T] and can trade continuously at a traditional exchange (the "primary venue") and in a dark pool. At the primary venue, trading yields a linear price impact. In the dark pool, no price impa…

2012-01-30abs ↗pdf ↗

We give the first algorithm for Matrix Completion whose running time and sample complexity is polynomial in the rank of the unknown target matrix, linear in the dimension of the matrix, and logarithmic in the condition number of the matrix. To the best of our knowledge, all previous algorithms either incurred a quadrat…

2014-07-15abs ↗pdf ↗

The paper proves constant rank theorems for special Lagrangian equations.

problem Understanding saddle solutions and Liouville type results for special Lagrangian equations.
method Argument based on saddle solutions and Liouville type results for the special Lagrangian equation.
result Obtained constant rank theorems for saddle solutions to the special Lagrangian equation and the quadratic Hessian equation.

We consider a generalization of low-rank matrix completion to the case where the data belongs to an algebraic variety, i.e. each data point is a solution to a system of polynomial equations. In this case the original matrix is possibly high-rank, but it becomes low-rank after mapping each column to a higher dimensional…

2017-03-28abs ↗pdf ↗

Developed a theory of local convexity for second order differential equations on Lie algebroids.

problem Analyzing convexity in differential equations on Lie algebroids.
method Theory development for local convexity of SODEs on Lie algebroids.
result Extensive discussion of homogeneous quadratic SODEs on Lie algebroids.

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.

Any classical r-matrix on the Lie algebra of linear operators on a real vector space V gives rise to a quadratic Poisson structure on V which admits a deformation quantization stemming from the construction of V. Drinfel'd. We exhibit in this article an example of quadratic Poisson structure which does not arise this w…

2001-05-09abs ↗pdf ↗

New findings on kernel regression in the quadratic regime, improving understanding of machine learning models.

problem Understanding kernel ridge regression in the quadratic asymptotic regime.
method Extended study of kernel regression to the quadratic regime, establishing approximation bounds and spectral distributions.
result Broad class of inner-product kernels exhibit behavior similar to a quadratic kernel, with precise asymptotic training and test errors characterized.

In this note, we derive a Liouville theorem for the complex Monge-Ampère equation. Our result states that if the global solution uu of the complex Monge-Ampère equation with constant right-hand side differs from a quadratic polynomial solution by $o(\abs{x}^2)$ at infinity, then uu is a quadratic polynomial.

2013-03-11abs ↗pdf ↗

Solutions near infinity to special Lagrangian equations are asymptotic to quadratic polynomials with logarithmic terms.

problem Solving special Lagrangian equations near infinity with specific conditions.
method Modified Kelvin transforms to characterize remainders in asymptotic expansions.
result Remainders in asymptotic expansions are characterized by a single smooth function in even dimensions and Cn1,αC^{n-1,α} in odd dimensions.

New algorithms achieve logarithmic regret in learning linear quadratic control systems.

problem Learning in Linear Quadratic Control systems with unknown parameters.
method Efficient algorithms for two scenarios: unknown AA or BB with certain conditions.
result Regret scales logarithmically with the number of steps, not square root.

Study solves HJB equations for time-inconsistent control problems.

problem Time-inconsistent deterministic linear quadratic control problems.
method Characterized solutions using Riccati equations with integral terms, proving uniqueness.
result Uniqueness of solutions to equilibrium HJB equations proved.

Skeinformer accelerates self-attention for long sequences with linear complexity.

problem Efficiency of Transformer models in processing long sequences.
method Matrix sketching and column sampling to reduce quadratic complexity to linear.
result Skeinformer outperforms alternatives with smaller time/space footprint.

On a complete non-compact gradient shrinking Ricci soliton, we prove the analyticity in time for smooth solutions of the heat equation with quadratic exponential growth in the space variable. This growth condition is sharp. As an application, we give a necessary and sufficient condition on the solvability of the backwa…

2019-11-07abs ↗pdf ↗

Paper connects MoE and self-attention, proposing active-attention.

problem Improving efficiency and performance of self-attention mechanisms.
method Established connection between MoE and self-attention, analyzed quadratic gating functions, proposed active-attention mechanism.
result Active-attention outperforms standard self-attention in various tasks.

This paper considers the recovery of a rank rr positive semidefinite matrix XXTRn×nX X^T\in\mathbb{R}^{n\times n} from mm scalar measurements of the form yi:=aiTXXTaiy_i := a_i^T X X^T a_i (i.e., quadratic measurements of XX). Such problems arise in a variety of applications, including covariance sketching of high-dimensional data…

2015-06-25abs ↗pdf ↗

Study exact limits of matrix reconstruction from noisy projections.

problem Reconstructing matrices from linear projections with high-dimensional data.
method Asymptotic analysis, universality properties, and generalized linear models.
result Exact asymptotic equations for optimal learning performance.

Building on previous results on the quadratic helicity in magnetohydrodynamics (MHD) we investigate particular minimum helicity states. Those are eigenfunctions of the curl operator and are shown to constitute solutions of the quasi-stationary incompressible ideal MHD equations. We then show that these states have inde…

2018-06-19abs ↗pdf ↗

Given a space it is easy to obtain the system of geodesic equations on it. In this paper the inverse problem of reconstructing the space from the geodesic equations is addressed. A procedure is developed for obtaining the metric tensor from the Christoffel symbols. The procedure is extended for determining if a second …

2007-11-08abs ↗pdf ↗