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

78156233311 · Jun 202019922001200920172026
48 results for exponential quadratic Gaussian

The paper models asset pricing in a partially observed market using mean field game theory and exponential quadratic Gaussian framework.

problem Asset pricing in a market with partial observation and heterogeneous agents.
method Mean field game theory, exponential quadratic Gaussian framework, Kalman-Bucy filtering theory.
result Characterization of equilibrium risk premium through mean field BSDE and construction of unobservable risk premium process.

We explore a new method for discrete-time control problems using randomization and entropy.

problem Discrete-time linear-exponential quadratic Gaussian (LEQG) control problem.
method Introduce exploration through randomization and apply duality between free energy and relative entropy.
result Reduced LEQG problem to equivalent risk-neutral LQG control problem with entropy regularization.

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.

Exponential Lasso improves Lasso's robustness to outliers and heavy-tailed noise.

problem Lasso's sensitivity to outliers and heavy-tailed noise in high-dimensional statistics.
method Integrates an exponential-type loss function into the Lasso framework.
result Achieves strong statistical convergence rates robust to heavy-tailed contamination.

Investor optimizes investment timing with future knowledge, overcoming transaction costs.

problem Optimal investment timing with future peeking, constrained by transaction costs.
method Solves control problem with infinite-dimensional memory using Gaussian Volterra integral equations.
result Explicit solution to optimal investment problem in Bachelier setting.

In the setting of exponential investors and uncertainty governed by Brownian motions we first prove the existence of an incomplete equilibrium for a general class of models. We then introduce a tractable class of exponential-quadratic models and prove that the corresponding incomplete equilibrium is characterized by a …

2013-10-10abs ↗pdf ↗

We propose expected policy gradients (EPG), which unify stochastic policy gradients (SPG) and deterministic policy gradients (DPG) for reinforcement learning. Inspired by expected sarsa, EPG integrates (or sums) across actions when estimating the gradient, instead of relying only on the action in the sampled trajectory…

2018-01-10abs ↗pdf ↗

Develops asset pricing models with mean field game theory for heterogeneous agents.

problem Tackles equilibrium asset pricing in incomplete markets with heterogeneous agents.
method Uses mean field game theory and mean field backward stochastic differential equations (BSDEs).
result Derives equilibrium risk premium and shows market clearing in the large population limit.

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 ↗

Accelerated gradient method's stability deteriorates exponentially with steps.

problem Algorithmic stability of Nesterov's accelerated gradient method.
method Analysis of two notions of algorithmic stability for Nesterov's accelerated gradient method.
result Stability of Nesterov's accelerated method deteriorates exponentially with the number of gradient steps.

Gaussian equivalence fails for simple polynomial embeddings in quadratic scaling RF models.

problem Failure of Gaussian equivalence in polynomial feature embeddings under quadratic scaling.
method Introduced Conditional Gaussian Equivalent (CGE) model to capture non-Gaussian behavior.
result Correct asymptotics derived for training and test errors in CGE model.

New analysis improves SGD for robust and quantile regression with sub-quadratic convergence.

problem Improving SGD for robust and quantile regression with sub-quadratic convergence.
method Piecewise Lyapunov function for first-order differentiable functions.
result First geometrical convergence result for sub-quadratic SGD.

This paper develops sparse alternatives to continuous distributions, including new types of Gaussians and attention mechanisms.

problem Creating flexible continuous distributions with varying support for machine learning applications.
method Defining ΩΩ-regularized prediction maps and Fenchel-Young losses for arbitrary domains, and deriving new types of Gaussians and attention mechanisms.
result Sparse alternatives to continuous distributions, including deformed exponential families and ββ-Gaussians, are introduced.

We propose different schemes for option hedging when asset returns are modeled using a general class of GARCH models. More specifically, we implement local risk minimization and a minimum variance hedge approximation based on an extended Girsanov principle that generalizes Duan's (1995) delta hedge. Since the minimal m…

2012-09-26abs ↗pdf ↗

We present sharp tail asymptotics for the density and the distribution function of linear combinations of correlated log-normal random variables, that is, exponentials of components of a correlated Gaussian vector. The asymptotic behavior turns out to depend on the correlation between the components, and the explicit s…

2013-09-12abs ↗pdf ↗

Proves new concentration inequalities for sub-gaussian and sub-exponential variables.

problem Understanding functions of independent random variables better.
method Sub-gaussian and sub-exponential conditions, Rademacher complexities, Lipschitz function classes.
result Extension of Rademacher complexities to unbounded sub-exponential distributions.

The paper rethinks the use of exponential averaging in machine learning optimization.

problem The inefficiency of using exponential averaging in optimization algorithms.
method The paper connects EA-CM algorithms to Wake of Quadratic regularized models and proposes new algorithms, KLD-WRM.
result The new algorithms outperform existing methods like K-FAC on MNIST.

Quantum UCB algorithm reduces reinforcement learning regret exponentially.

problem Episodic reinforcement learning with quantum state evolution.
method Upper Confidence Bound (UCB) quantum algorithm with quantum mean estimation.
result Exponential improvement in regret from $\Tilde{\mathcal{O}}(\sqrt{K})$ to $\Tilde{\mathcal{O}}(1)$.

Classifies surfaces in hyperbolic space with constant Gaussian curvature.

problem Classifying surfaces in hyperbolic space with specific curvature.
method Loop group method, spectral parameter deformation, holomorphic quadratic differentials.
result Weakly complete constant Gaussian curvature surfaces are in one-to-one correspondence with holomorphic quadratic differentials.

Revisits stochastic collocation with exponential splines for option pricing.

problem Improving the accuracy of option price interpolation using stochastic collocation.
method Uses exponential quadratic splines and optimizes abscissae or parameters of B-splines.
result Shows that fixing abscissae and optimizing parameters leads to better interpolation accuracy.

Unified analysis of Gaussian Process Thompson Sampling without discretization.

problem Sequential decision-making over continuous action spaces.
method Frequentist regret analysis based on fractional Gaussian process posteriors.
result Unified discretization-free regret bound for various kernel classes.

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.

New approach to portfolio optimization shows entropy regularization is ineffective.

problem Entropy regularization in mean-variance portfolio optimization under drift uncertainty.
method Combining Bayesian filtering and stochastic policy optimization.
result Entropy regularization does not accelerate learning about unknown drift.

Bayesian Markowitz portfolio problem shows entropy regularization is ineffective.

problem Entropy regularization in Bayesian Markowitz portfolio optimization.
method Combines continuous-time Bayesian filtering with stochastic policy optimization.
result Entropy regularization does not accelerate learning of unknown drift.

This paper aims at refined error analysis for binary classification using support vector machine (SVM) with Gaussian kernel and convex loss. Our first result shows that for some loss functions such as the truncated quadratic loss and quadratic loss, SVM with Gaussian kernel can reach the almost optimal learning rate, p…

2017-02-28abs ↗pdf ↗

Unified approach to stability conditions on surfaces with quadratic differentials.

problem Identifying spaces of stability conditions on triangulated categories.
method Perverse schober and their global sections, mixed-angulations, flips, finite-length hearts, tilts.
result Identification of moduli spaces of quadratic differentials with arbitrary singularity types.

Efficient method for learning continuous exponential families beyond Gaussian.

problem Learning continuous exponential families with unbounded support.
method Interaction Screening approach for scalable learning of continuous graphical models.
result Our estimator maintains similar accuracy and sample complexity scalings compared to alternative approaches, while improving run-time.

In this paper, we compute the subgroup distortion of all finitely generated subgroups of all finitely generated 3-manifold groups, and the subgroup distortion in this case can only be linear, quadratic, exponential and double exponential. It turns out that the subgroup distortion of a subgroup of a 3-manifold group is …

2019-04-28abs ↗pdf ↗

Choquet regularization improves exploration in RL.

problem Improving exploration in reinforcement learning.
method Introducing Choquet regularizers to measure and manage exploration, reformulating RL problems and deriving explicit solutions.
result Explicit optimal distributions and Choquet regularizers for various exploratory samplers.

In this paper, we study a class of Anticipated Backward Stochastic Differential Equations (ABSDE) with jumps. The solution of the ABSDE is a triple (Y,Z,ψ)(Y,Z,ψ) where YY is a semimartingale, and (Z,ψ)(Z,ψ) are the diffusion and jump coefficients. We allow the driver of the ABSDE to have linear growth on the uniform norm of …

2017-05-06abs ↗pdf ↗

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.

Let g ⁣:SNg \colon S \looparrowright N be a properly immersed π1π_1--injective surface in a non-geometric 33--manifold NN. We compute the distortion of π1(S)π_1(S) in π1(N)π_1(N) and show that how it is related to separability of π1(S)π_1(S) in π1(N)π_1(N). The only possibility of the distortion is linear, quadratic, exponential, an…

2018-05-03abs ↗pdf ↗