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

Trend · papers per month

4178351,2521,669 · Jun 202019922001200920172026
48 results for Asymmetric Numeral Systems (ANS)

This paper simplifies ANS for statisticians, making it easier to use.

problem Statisticians struggle to understand ANS and its versatility.
method Present ANS from a latent variable model perspective and guide step-by-step implementation.
result Made ANS more accessible for statisticians through a Python implementation and library.

Method extracts governing laws from non-Gaussian stochastic systems data.

problem Modeling complex dynamics with non-Gaussian Lévy noise.
method Data-driven method to extract stochastic dynamical systems from noisy data.
result Established a theoretical framework and numerical algorithm to compute Lévy jump measure, drift, and diffusion.

This paper introduces forward-looking measures of the network connectedness of fears in the financial system, arising due to the good and bad beliefs of market participants about uncertainty that spreads unequally across a network of banks. We argue that this asymmetric network structure extracted from call and put tra…

2018-10-29abs ↗pdf ↗

Innovative extensions to option pricing models using asymmetric Brownian motion and random walk approaches.

problem Capturing empirical phenomena like return skewness, heavy tails, and volatility asymmetry in option pricing models.
method Developing the Geometric Asymmetric Brownian Motion (GABM) within the Bachelier--Black--Scholes--Merton framework.
result Deriving closed-form option pricing formulas and a discrete-time binomial tree algorithm that converges to the GABM limit.

Algorithm stabilizes queues in asymmetric systems with unknown service rates.

problem Stabilizing queues in multi-class multi-server systems with unknown service rates.
method Proposes UCB and Thompson Sampling algorithms to stabilize queues while learning service rates.
result Achieves system stability with an average queue length bound of \(O(\min\{N,K\}/ε)\) for large time horizon \(T\).

Extends return extrapolation to nonlinear, asymmetric functions under stochastic volatility.

problem Behavioral anomalies in portfolio choice under stochastic volatility.
method Smooth, nonlinear, asymmetric extrapolation function; CRRA investor; Heston stochastic volatility; Hamilton-Jacobi-Bellman equation; Numerical solutions (finite-difference ADI, deep learning-driven iterative).
result Saturation acts as an endogenous correction mechanism, reducing welfare loss.

Gradient descent recovers principal components of overparametrized asymmetric matrices without explicit regularization.

problem Asymmetric matrix factorization under overparametrization with minimal rank assumptions.
method Vanilla gradient descent with small random initialization and proper early stopping.
result Gradient descent produces the best low-rank approximation without explicit regularization.

We extend return extrapolation to incorporate asymmetry and saturation, finding that asymmetric nonlinear extrapolation leads to lower welfare loss.

problem Optimal portfolio choice under stochastic volatility
method Smooth, nonlinear extrapolation function with sentiment and variance hedging
result Lower welfare loss with asymmetric nonlinear extrapolation

New HMC method uses asymmetrical momentum distributions and improves performance.

problem Rigorous convergence guarantees for HMC with Gaussian momentum distributions.
method New convergence analysis for HMC with general asymmetrical momentum distributions, proposing AD-HMC.
result AD-HMC exhibits geometric convergence in Wasserstein distance under certain conditions.

Dynamic Vocabulary Pruning stabilizes LLM training by removing low-probability tokens.

problem Training Large Language Models (LLMs) with Reinforcement Learning (RL) causes numerical divergence between inference and training.
method Dynamic Vocabulary Pruning (DVP) constrains the RL objective to a safe vocabulary that excludes low-probability tokens.
result DVP stabilizes training by reducing systematic bias introduced by the extreme tail of the token distribution.

New guarantees for asymmetric sketching in compressive learning.

problem Statistical guarantees for compressive learning with asymmetric feature maps.
method Proves existing guarantees carry over to asymmetric scheme with LPD property, applies to quantized sketches.
result Existing statistical guarantees for compressive learning extend to asymmetric schemes with controlled error.

We study systems of Brownian particles on the real line, which interact by splitting the local times of collisions among themselves in an asymmetric manner. We prove the strong existence and uniqueness of such processes and identify them with the collections of ordered processes in a Brownian particle system, in which …

2012-09-30abs ↗pdf ↗

We analyze a simple asset transfer model in which the transfer amount is a fixed fraction ff of the giver's wealth. The model is analyzed in a new way by Laplace transforming the master equation, solving it analytically and numerically for the steady-state distribution, and exploring the solutions for various values o…

2010-04-29abs ↗pdf ↗

Complex systems are typically represented by large ensembles of observations. Correlation matrices provide an efficient formal framework to extract information from such multivariate ensembles and identify in a quantifiable way patterns of activity that are reproducible with statistically significant frequency compared…

2011-06-02abs ↗pdf ↗

A new privacy-preserving deep learning scheme for asymmetrically collaborative machine learning.

problem Privacy and efficiency in collaborative machine learning across different data owners.
method Decomposes neural network steps for privacy-preserving training; novel protocol for information leakage.
result Efficient training with stable performance and significant speedup.

Gaussian process framework learns interaction kernels in multi-species particle systems.

problem Learning interaction kernels in multi-species interacting particle systems from trajectory data.
method Nonparametric Bayesian approach with Gaussian processes.
result Established rigorous statistical guarantees for recoverability and optimality of interaction kernels.

Study of geometric analysis on asymmetric metric spaces, including heat flow and Sobolev spaces.

problem Analysis of geometric properties on asymmetric metric measure spaces.
method Introduction of upper gradients, qq-Laplacian, and qq-heat flow in asymmetric settings.
result Extension of concepts from symmetric to asymmetric metric measure spaces.

This work improves polynomial approximations for functions with asymmetric behavior.

problem Efficiently approximating functions with asymmetric behavior, especially those growing unbounded on one side.
method Introduces weighted deep polynomial approximants that combine learnable deep polynomials with one-sided weights.
result Weighted deep polynomial approximants outperform existing methods in approximating functions with asymmetric behavior.

This study examines asymmetric cross-correlations in cryptocurrency markets using fractal analysis.

problem Exploring asymmetric multifractal cross-correlations in cryptocurrency markets.
method Fractal analysis and MF-ADCCA method to investigate asymmetric volatility dynamics.
result Cross-correlations are stronger in downtrend markets than in uptrend markets for maturing BTC and ETH.

Theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.

problem Lack of precise theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.
method Adapting a finite-time convergence analysis to the asymmetric actor-critic setting with linear function approximators.
result A finite-time bound reveals that the asymmetric critic eliminates aliasing errors in the agent state.

We consider the problem of designing locality sensitive hashes (LSH) for inner product similarity, and of the power of asymmetric hashes in this context. Shrivastava and Li argue that there is no symmetric LSH for the problem and propose an asymmetric LSH based on different mappings for query and database points. Howev…

2014-10-21abs ↗pdf ↗

We present a large scale hyperbolic recommender system. We discuss why hyperbolic geometry is a more suitable underlying geometry for many recommendation systems and cover the fundamental milestones and insights that we have gained from its development. In doing so, we demonstrate the viability of hyperbolic geometry f…

2019-02-22abs ↗pdf ↗

The paper improves asymmetric causality tests by addressing inefficiencies and statistical significance issues.

problem Inefficiencies and statistical significance issues in asymmetric causality tests.
method Improved asymmetric causality tests via partial cumulative sums for positive and negative components, explicitly testing differences between causal parameters.
result Efficiently tested hypotheses on asymmetric causal interaction between financial markets.

Optimizes risk assessment tools using mixed-integer programming.

problem Challenges in healthcare risk assessment due to label scarcity and asymmetric misclassification costs.
method Jointly optimizes scoring weights and category thresholds via mixed-integer programming (MIP).
result Prevents label-scarce category collapse and achieves more accurate risk categorization.

We propose Deep Asymmetric Multitask Feature Learning (Deep-AMTFL) which can learn deep representations shared across multiple tasks while effectively preventing negative transfer that may happen in the feature sharing process. Specifically, we introduce an asymmetric autoencoder term that allows reliable predictors fo…

2017-08-01abs ↗pdf ↗