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

96192287383 · Jun 202019922001200920172026
48 results for linear quadratic

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.

We reconsider the problem of optimal trading in the presence of linear and quadratic costs, for arbitrary linear costs but in the limit where quadratic costs are small. Using matched asymptotic expansion techniques, we find that the trading speed vanishes inside a band that is narrower than in the absence of quadratic …

2015-11-23abs ↗pdf ↗

New results on financial equilibria in markets with general semimartingales.

problem Existence and uniqueness of mean-variance equilibria in semimartingale markets.
method Analysis of dynamic mean-variance hedging and fixed-point problems.
result First results allowing for general semimartingales and both discrete and continuous time.

Study shows certainty equivalent policy minimizes regret in continuous-time systems.

problem Minimizing regret in continuous-time stochastic linear-quadratic systems.
method Theoretical analysis of randomized certainty equivalent policy.
result Establishes square-root of time regret bounds and linear scaling with parameters.

In planar algebras, we show how to project certain simple "quadratic" tangles onto the linear space spanned by "linear" and "constant" tangles. We obtain some corollaries about the principal graphs and annular structure of subfactors.

2010-07-07abs ↗pdf ↗

We consider support recovery in the quadratic logistic regression setting - where the target depends on both p linear terms xix_i and up to p2p^2 quadratic terms xixjx_i x_j. Quadratic terms enable prediction/modeling of higher-order effects between features and the target, but when incorporated naively may involve solvi…

2017-03-08abs ↗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.

The paper extends a variance gamma model to quadratic functions, reducing arbitrage and computational costs.

problem Creating an arbitrage-free interpolation for option pricing models.
method Generalizing the local variance gamma model to a piecewise quadratic local variance function.
result The quadratic model results in an arbitrage-free interpolation of class C3, reducing knots and computational cost.

Policy gradient converges to globally optimal policy in nearly linear-quadratic systems.

problem Finding optimal policies in nonlinear control systems with partial information.
method Policy gradient algorithm designed for nearly linear-quadratic regulators with small Lipschitz nonlinear components.
result Policy gradient algorithm converges to globally optimal policy with linear rate.

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.

We study the performance of the certainty equivalent controller on Linear Quadratic (LQ) control problems with unknown transition dynamics. We show that for both the fully and partially observed settings, the sub-optimality gap between the cost incurred by playing the certainty equivalent controller on the true system …

2019-02-21abs ↗pdf ↗

A Finsler space is called Ricci-quadratic if its Ricci curvature Ric(x,y)Ric(x,y) is quadratic in yy. It is called a Berwald space if its Chern connection defines a linear connection directly on the underlying manifold MM. In this article, we prove that a homogeneous Randers space is Ricci-quadratic if and only if it is of…

2012-07-07abs ↗pdf ↗

We study the problem of regret minimization in partially observable linear quadratic control systems when the model dynamics are unknown a priori. We propose ExpCommit, an explore-then-commit algorithm that learns the model Markov parameters and then follows the principle of optimism in the face of uncertainty to desig…

2020-01-31abs ↗pdf ↗

Closed-form polynomial approximations replace MLPs in transformers, enabling new interpretability methods.

problem Replacing MLPs with polynomial approximations for transformer models.
method Theoretical derivation of closed-form least-squares approximations of MLPs and GLUs using polynomial functions.
result Polynomial approximations explain over 95% of MLP and GLU outputs' variance, enabling interpretability.

\infty-Harmonic maps are a generalization of \infty-harmonic functions. They can be viewed as the limiting cases of p-harmonic maps as p goes to infinity. In this paper, we give complete classifications of linear and quadratic \infty-harmonic maps from and into a sphere, quadratic \infty-harmonic maps between E…

2007-10-30abs ↗pdf ↗

Logarithmic regret achieved in continuous-time linear-quadratic reinforcement learning.

problem Optimizing control actions in unknown continuous-time systems over a finite time horizon.
method Least-squares algorithm based on continuous-time observations and controls, with perturbation analysis and parameter estimation error analysis.
result Logarithmic regret bound of order O((lnM)(lnlnM))O((\ln M)(\ln\ln M)).

LqgOpt learns optimal control in unknown LQG systems with minimal regret.

problem Adaptive control in partially observable linear quadratic Gaussian systems with unknown dynamics.
method Optimism in the face of uncertainty, predictor state evolution, closed-loop system identification, confidence bounds.
result Proves a regret upper bound of ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) for LQG systems.

Faster algorithms for structured SVMs reduce computation time.

problem Efficiently solving quadratic programming problems with specific structures.
method Designing nearly-linear time algorithms for quadratic programs with low-rank factorizations and few linear constraints.
result First nearly-linear time algorithms for solving quadratic programs with specific structures.

Geometrically describes the linear and quadratic forms for rational links.

problem Predicting generating functions for colored HOMFLY-PT polynomials of rational links.
method Direct geometric description of linear and quadratic forms in terms of configuration spaces.
result Direct geometric description of forms for rational links.

We consider a general time-inconsistent stochastic linear-quadratic differential game. The time-inconsistency arises from the presence of quadratic terms of the expected state as well as state-dependent term in the objective functionals. We define an equilibrium strategy, which is different from the classical one, and …

2016-07-03abs ↗pdf ↗

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 ↗

QLA improves Bayesian uncertainty estimation for DNNs without increasing computational cost.

problem Overconfident out-of-distribution predictions from DNNs.
method Proposes Quadratic Laplace Approximation (QLA) to improve Bayesian uncertainty quantification.
result QLA yields modest yet consistent uncertainty estimation improvements over Linearized Laplace Approximation (LLA) on five regression datasets.

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.

We consider the problem of high-dimensional classification between the two groups with unequal covariance matrices. Rather than estimating the full quadratic discriminant rule, we propose to perform simultaneous variable selection and linear dimension reduction on original data, with the subsequent application of quadr…

2017-11-13abs ↗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 ↗

Study policy gradient for large-agent mean-field control and game in continuous time.

problem Optimal policy learning for large number of agents in continuous-time mean-field systems.
method Policy gradient method applied to linear-quadratic mean-field control and game models.
result Policy gradient converges to optimal solution at a linear rate for both mean-field control and game.

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 ↗

New algorithms improve blind source separation for linear-quadratic mixtures.

problem Blind source separation of linear-quadratic mixtures under separability assumptions.
method Proposed two algorithms: SNPALQ and BF. SNPALQ generalizes SNPA for LQ model, BF post-processes SNPALQ.
result Proven robustness and computational tractability of SNPALQ in separating sources even with noise.

Researchers found a quadratic estimate for embedding higher-dimensional simplices into sphere-connected sums.

problem Estimating the number of handles required for embedding higher-dimensional simplices into sphere-connected sums.
method Combining geometric topology, combinatorics, and linear algebra.
result Presented a quadratic estimate gckn2g \ge c_k n^2 for embedding kk-faces of nn-simplex.

Quantum computing offers a quadratic speedup for estimating non-linear functionals.

problem Estimating non-linear functionals of probability distributions.
method Proposes a quantum-inside-quantum Monte Carlo algorithm for a broad class of non-linear estimation problems.
result Achieves a quadratic speedup for non-linear estimation problems, including nested conditional expectations and stochastic optimization.

Estimates parameters in max-linear Bayesian networks with noise.

problem Causal inference in extreme-value settings with noise parameters.
method Max-plus algebra and logarithm transformation, normal distribution estimation, EM algorithm and quadratic optimization.
result An estimator of a parameter for each edge in a DAG is normally distributed.