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

86172258344 · Jun 202019922001200920172026
48 results for exponential scaling

The paper studies scaling limits of hedging prices in financial models.

problem Scaling limits of exponential utility indifference prices in financial models.
method Formulated dual problem as stochastic control, solved HJB equation for upper bound, used duality result for lower bound.
result Represented scaling limit in terms of specific relative entropy and constructed asymptotic optimal hedging strategies.

Study scaling limits for option pricing in trinomial models.

problem Analyzing exponential hedging in trinomial models converging to Black-Scholes.
method Purely probabilistic approach using duality, martingale, and weak-convergence techniques.
result Derives a scaling limit for exponential certainty-equivalent prices in trinomial models.

Market activity scales near a constant of 0.632 in intrinsic time.

problem Understanding the stability of market scaling laws.
method Modeling market directional changes as a memoryless exponential hazard process and identifying the intrinsic time scaling constant.
result The intrinsic time scaling constant is 11/e=0.6321 - 1/e = 0.632.

We derive scaling laws for optimizing neural networks in hardware.

problem Optimizing the large parameter space of neural networks in hardware.
method Analytical derivation of scaling laws for Coordinate Descent optimization.
result Convergence is exponential and scales linearly with the number of neurons.

A-NeSI scales approximate inference for probabilistic neurosymbolic learning.

problem Combining neural networks with symbolic reasoning for scalable inference.
method A-NeSI: a new framework for PNL using neural networks for approximate inference.
result A-NeSI achieves scalable approximate inference without semantic changes.

Study reveals a universal formula for knotting in random equilateral polygons.

problem Probability of knotting in equilateral random polygons.
method Extensive Monte Carlo simulations with improved algorithms and knot invariants.
result A universal scaling formula for knotting probability with number of edges, involving exponential and power law factors.

Quantum systems with scrambling improve temporal information processing, but scaling requires exponential overhead.

problem Scalability and memory retention of quantum reservoirs in temporal information processing.
method Examined a quantum reservoir processing framework with scrambling reservoirs modeled by high-order unitary designs, analyzed in noiseless and noisy settings.
result Memory retention improves exponentially with reservoir size but worsens with reservoir iterations, requiring exponential shot overhead for scaling.

New insights into natural exponential families improve regret bounds for bandit problems.

problem Improving regret bounds for bandit problems with subexponential tails.
method Proving self-concordance for natural exponential families and applying to bandits.
result Optimistic algorithms for generalized linear bandits have second-order regret bounds that are free of an exponential dependence on problem parameters.

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.

New voting strategies show committee-based consensus can scale efficiently.

problem Ensuring honest committees in committee-based consensus protocols.
method Empirical analysis of simpler voting strategies and their convergence to optimality.
result Simpler voting strategies converge to optimality exponentially quickly, ensuring robustness and efficiency.

The distribution of intertrade durations, defined as the waiting times between two consecutive transactions, is investigated based upon the limit order book data of 23 liquid Chinese stocks listed on the Shenzhen Stock Exchange in the whole year 2003. A scaling pattern is observed in the distributions of intertrade dur…

2008-04-22abs ↗pdf ↗

Paper studies convergence of Mean-Field GDA dynamics for MNE of continuous games.

problem Finding mixed Nash equilibria in continuous games.
method Two-scale Mean-Field Gradient Descent Ascent dynamics.
result Two-scale Mean-Field GDA converges exponentially to MNE without convexity assumptions.

Learning to control linear systems is statistically hard, especially for underactuated systems.

problem Statistical difficulty of learning to control linear systems, especially underactuated ones.
method Utilized minimax lower bounds and structural assumptions to prove learning complexity can be exponential.
result Learning complexity can be at most exponential with the controllability index of the system.

Global stability proved for Navier-Stokes equations on hyperbolic space.

problem Stability of the Navier-Stokes equations on hyperbolic space.
method Proved global stability with exponential decay rate for small initial data.
result Exponential decay rate of $μλ_\Def^{(3)}$ for Navier-Stokes equations on hyperbolic space.

We introduce a stochastic model to explain a double power-law distribution which exhibits two different Paretian behaviors in the upper and the lower tail and widely exists in social and economic systems. The model incorporates fitness consideration and noise fluctuation. We find that if the number of variables (e.g. t…

2011-03-10abs ↗pdf ↗

Solves large-scale metric constrained problems using Project and Forget algorithm.

problem Finding consistent metric representations for large dissimilarity datasets.
method Active set algorithm with Bregman projections, converges to global optimal solution.
result Algorithm efficiently solves metric constrained problems with exponentially many constraints.

This work shows how approximate reward models can significantly improve inference-time scaling.

problem Improving the efficiency of inference for large language models.
method Identifying the Bellman error of approximate reward models and using Sequential Monte Carlo (SMC) for inference.
result Approximate reward models can reduce computational complexity from exponential to polynomial in TT.

We provide a direct proof of Cramér's theorem for geodesic random walks in a complete Riemannian manifold (M,g)(M,g). We show how to exploit the vector space structure of the tangent spaces to study large deviation properties of geodesic random walks in MM. Furthermore, we reveal the geometric obstructions one runs into …

2018-11-23abs ↗pdf ↗

A government has to finance a risk for its population. It shares the charges among the population with a fixed scale based on economic criteria. Various organisms have to collect and to redistribute fairly the subsidies. Under these conditions, when the size of the organisms is varied, the distribution's laws of the cr…

2014-01-13abs ↗pdf ↗

Langevin Dynamics speeds up mixing time with manifold hypothesis and multi-scale approach.

problem Langevin Dynamics struggles in high dimensions and nonconvex landscapes.
method Utilizes manifold hypothesis to reduce mixing time and employs multi-scale approach to improve image generation quality.
result Mixing time depends on intrinsic dimension rather than ambient dimension, significantly reducing computational complexity.

The paper explores risk-minimization for exponential additive models, providing mathematical expressions and numerical examples.

problem Risk-minimization in incomplete markets for exponential additive models.
method Derive explicit mathematical expressions for local risk-minimization strategies in exponential additive models.
result Provide necessary conditions for deriving expressions and confirm integrability conditions for specific models.

Introduces a new stationary GE-process for gold price analysis.

problem Analyzing gold price data with a flexible stationary process.
method Developed a new stationary GE-process with three parameters. Analyzed synthetic and real gold price data.
result Maximum likelihood estimators can be obtained for the unknown parameters.

Modeling financial returns as conditionally independent random variables explains power-law tails.

problem Understanding the distribution of financial returns and their relation to volatility.
method Assuming returns are conditionally independent given volatility, which varies randomly over time.
result Returns distribution can be described by the sum of conditionally independent random variables, showing scaling and power-law tails.

We consider strictly stationary heavy tailed time series whose finite-dimensional exponent measures are concentrated on axes, and hence their extremal properties cannot be tackled using classical multivariate regular variation that is suitable for time series with extremal dependence. We recover relevant information ab…

2013-07-05abs ↗pdf ↗

Study utility indifference pricing in a Bachelier model with small linear price impact.

problem Utility indifference pricing in a model with linear price impact.
method Analyzes the Bachelier model with exponential utility indifference prices for vanilla European options.
result Computes the scaling limit of utility indifference prices for a vanishing price impact inversely proportional to risk aversion.

ELU algorithm improves on EM for over-specified Gaussian mixtures.

problem Slow convergence of EM in over-specified Gaussian mixtures.
method Developed ELU algorithm for two-component mixtures, combining exponential location update and gradient descent.
result ELU converges to final statistical radius after logarithmic iterations, resolving open question.

New method uses hyperbolic space for faster phylogenetic tree inference.

problem Inefficient Euclidean-based phylogenetic inference in high dimensions.
method Developed novel hyperbolic extensions of sequential search algorithms and variational inference methods.
result Improved speed, scalability and performance in phylogenetic inference.

NO approximates non-Markovian BSDEs with polynomial scaling in 1/ε.

problem Complexity of NO approximations for structured families of BSDEs.
method Identifying structured families of non-Markovian BSDEs, informing NO's inductive bias.
result Polynomial scaling in 1/ε for NO approximations of BSDE solution operators.

Learning ReLU networks to high uniform accuracy requires exponentially many samples.

problem Achieving high uniform accuracy on ReLU networks for security-critical applications.
method Quantified the number of training samples needed for any algorithm to guarantee uniform accuracy.
result The minimal number of training samples scales exponentially with network depth and input dimension.

Time series analysis is used to understand and predict dynamic processes, including evolving demands in business, weather, markets, and biological rhythms. Exponential smoothing is used in all these domains to obtain simple interpretable models of time series and to forecast future values. Despite its popularity, expon…

2017-06-09abs ↗pdf ↗

This work provides a scaling rule for model EMA optimization across batch sizes.

problem Training dynamics and performance differences across batch sizes when using model EMA.
method Developed a scaling rule for model EMA optimization, demonstrating its validity across various architectures and data modalities.
result Enabled SSL methods like BYOL to train at larger batch sizes without performance degradation.

New algorithm reduces online logistic regression regret without exponential constant.

problem Improper learning in online logistic regression with logarithmic regret.
method Regularized empirical risk minimization with surrogate losses.
result Regret scaling as O(B log(Bn)) with low computational complexity.