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

162324485647 · Jun 202019922001200920172026
48 results for distributional critic

Paper tackles overestimation bias in continuous control, improving performance by 25%.

problem Overestimation bias in off-policy learning.
method Truncated Quantile Critics (TQC) combines distributional representation, truncation, and ensembling of critics.
result TQC outperforms state-of-the-art methods by 25% on the Humanoid environment.

We provide evidence that cumulative distributions of absolute normalized returns for the 100100 American companies with the highest market capitalization, uncover a critical behavior for different time scales ΔtΔt. Such cumulative distributions, in accordance with a variety of complex --and financial-- systems, can be m…

2017-02-20abs ↗pdf ↗

Study shows flash crashes in finance are self-organized criticality events.

problem Understanding and predicting anomalous price events in high-frequency finance.
method Investigated volume distributions during flash crashes and linked them to self-organized criticality.
result Volume distributions during flash crashes indicate a diverging second moment, suggesting self-organized criticality.

New method selects critical DER scenarios for distribution grid investment planning.

problem Determining critical DER adoption scenarios for risk assessment in distribution grids.
method Bayesian Optimization framework using Gaussian Process surrogates and Pareto-critical acquisition function.
result Statistical guarantee and significant speed-up over exhaustive search in selecting critical DER scenarios.

The z-transform technique is used to investigate the model for distribution of high-tax payers, which is proposed by two of the authors (K. Y and S. M) and others. Our analysis shows an asymptotic power-law of this model with the exponent -5/2 when a total ``mass'' has a certain critical value. Below the critical value…

2005-10-26abs ↗pdf ↗

Neural networks trained with actor-critic algorithms converge to ODEs under weak convergence analysis.

problem Challenges in convergence analysis due to changing data distributions in online learning.
method Geometric ergodicity of data samples, Poisson equation, weak convergence techniques.
result Actor and critic networks converge to solutions of ODEs with random initial conditions.

Learning the distribution of natural images is one of the hardest and most important problems in machine learning. The problem remains open, because the enormous complexity of the structures in natural images spans all length scales. We break down the complexity of the problem and show that the hierarchy of structures …

2015-10-27abs ↗pdf ↗

This work aims to create a large-scale model for critical care time series data.

problem Lack of large-scale datasets and distribution shifts in critical care time series data.
method Harmonized dataset creation and transfer learning research.
result Established a foundation for large-scale multi-variate time series models in critical care.

We study a simplification of GAN training: the problem of transporting particles from a source to a target distribution. Starting from the Sobolev GAN critic, part of the gradient regularized GAN family, we show a strong relation with Optimal Transport (OT). Specifically with the less popular dynamic formulation of OT …

2018-05-30abs ↗pdf ↗

This paper studies the critical dynamics of random surfaces, focusing on area and genus evolution.

problem Understanding the time evolution of random surfaces and their genus.
method Analyzes the dynamics of area and genus using Cox-Ingersoll-Ross process and critical phenomena.
result The genus of surfaces evolves into two phases: planar surfaces and foamy surfaces.

The increasing quantity of PV generation connected to distribution networks is creating challenges in maintaining and controlling voltages in those distribution networks. Determining the maximum hosting capacity for new PV installations based on the historical data is an essential task for distribution networks. Analyz…

2018-11-08abs ↗pdf ↗

IDAC improves reinforcement learning efficiency by modeling implicit distributions.

problem Improving sample efficiency in reinforcement learning algorithms.
method IDAC uses two DGNs for a distributional critic and a semi-implicit actor to model implicit policy distributions.
result IDAC outperforms state-of-the-art algorithms on OpenAI Gym environments.

We analyze critical points of the Sliced Wasserstein Distance for optimization stability.

problem Understanding the behavior of optimization algorithms for models trained with the Sliced Wasserstein Distance.
method Explicit perturbations and critical point analysis of the SW objective.
result Stable critical points of SW cannot concentrate on segments, providing optimization stability.

In traditional reinforcement learning, an agent maximizes the reward collected during its interaction with the environment by approximating the optimal policy through the estimation of value functions. Typically, given a state s and action a, the corresponding value is the expected discounted sum of rewards. The optima…

2018-06-10abs ↗pdf ↗

The aim here is to study the concept of pairing multifractality between time series possessing non-Gaussian distributions. The increasing number of rare events creates "criticality". We show how the pairing between two series is affected by rare events, which we call "coupled criticality". A method is proposed for stud…

2015-10-11abs ↗pdf ↗

Critical learning periods found in deep linear networks too.

problem Understanding why critical learning periods emerge in both biological and artificial networks.
method Focused on deep linear network models, analyzed depth and data distribution, and examined multi-task learning.
result Critical periods depend on model depth and data distribution structure, and pre-training can affect transfer performance.

A simple model economy with locally interacting producers and consumers is introduced. When driven by extremal dynamics, the model self-organizes {\em not} to an attractor state, but to an asymptote, on which the economy has a constant rate of deflation, is critical, and exhibits avalanches of activity with power-law d…

2000-05-19abs ↗pdf ↗

Actor-critic algorithms converge to an ODE as data samples change dynamically.

problem Challenging to mathematically analyze due to non-i.i.d. data samples.
method Proved convergence to an ODE using time rescaling and geometric ergodicity.
result Convergence to the ODE limit and its properties proven.

A framework identifies worst-case decision points in safety-critical scenarios, improving risk assessment by 10 hours.

problem Identifying worst-case outcomes in safety-critical decision-making under uncertainty.
method Explicitly estimating distributions of expected return to identify dead-ends, tuning based on risk tolerance.
result Significantly improves risk assessment, providing indications 10 hours earlier and increasing detection by 20%.

We consider a (2q+1)(2q+1)-dimensional smooth manifold MM equipped with a (q+1)(q+1)-dimensional, a priori non-integrable, distribution D{\cal D} and a qq-vector field T=T1Tq{\bf T}=T_1\wedge\ldots\wedge T_q, where {Ti}\{T_i\} are linearly independent vector fields transverse to~D{\cal D}. Using a qq-form ωω such that ${\cal …

2019-09-29abs ↗pdf ↗

Stock markets are complex systems exhibiting collective phenomena and particular features such as synchronization, fluctuations distributed as power-laws, non-random structures and similarity to neural networks. Such specific properties suggest that markets operate at a very special point. Financial markets are believe…

2013-10-09abs ↗pdf ↗

The paper explores how topological methods can reveal insights into electric charge distributions on knots.

problem Understanding the qualitative behavior of electric potentials on knots.
method Geometric topology techniques applied to electrostatics.
result Proved a lower bound on the size of the critical set based on knot projections.

We have numerically simulated the ideal-gas models of trading markets, where each agent is identified with a gas molecule and each trading as an elastic or money-conserving two-body collision. Unlike in the ideal gas, we introduce (quenched) saving propensity of the agents, distributed widely between the agents ($0 \le…

2003-01-16abs ↗pdf ↗

The paper analyzes how SGD visits different regions of a non-convex problem's state space.

problem Understanding the long-run distribution of stochastic gradient descent in non-convex problems.
method Large deviations theory and randomly perturbed dynamical systems.
result The long-run distribution of SGD resembles the Boltzmann-Gibbs distribution with temperature equal to the step-size.

We examine the total mixed scalar curvature of a fixed distribution as a functional of a pseudo-Riemannian metric. We develop variational formulas for quantities of extrinsic geometry of the distribution to find the critical points of this action. Together with the arbitrary variations of the metric, we consider also v…

2016-09-29abs ↗pdf ↗

A new method improves actor-critic RL by integrating HMC, enhancing policy distribution and exploration.

problem Actor-critic RL yields suboptimal policies due to amortization gap and insufficient exploration.
method Integrating Hamiltonian Monte Carlo (HMC) into the actor-critic RL framework.
result Improves policy distribution and exploration, leading to better policy estimates and higher returns.

The paper introduces a novel method for training neural network Stein critics with staged L2L^2-regularization.

problem Learning to differentiate model distributions from observed data in high-dimensional settings.
method Developed a novel staging procedure for L2L^2 regularization over training time, leveraging the advantages of highly-regularized training at early times.
result Theoretical guarantees and empirical validation show that the method improves the approximation of the training dynamic by the kernel optimization, leading to faster convergence and better performance.

Critical volatility triggers log-normal to power-law transitions in interconnected systems.

problem Understanding the transition from log-normal to power-law distributions in interconnected systems.
method Analyzing an infinite option-on-option chain model, deriving a critical volatility threshold.
result A critical volatility threshold of approximately 250.66% for unconditional cases, dropping to 125.3% with selective survival.

A new framework for measuring uncertainty in machine learning models.

problem Uncertainty measures for second-order distributions in machine learning models have theoretical flaws.
method Formal criteria and a general framework based on the Wasserstein distance.
result The Wasserstein distance-based measure satisfies all proposed criteria for meaningful uncertainty measures.

The paper evaluates variational auto-encoders using model criticism methods.

problem Evaluating the quality of variational auto-encoders (VAEs).
method Statistical model criticism, focusing on reproducing statistics of unknown data generating processes.
result The proposed framework offers possibilities for model selection beyond intrinsic metrics.

The paper explores multidimensional critic output in GANs, improving convergence and diversity.

problem Underexplored in GANs literature, multidimensional critic output.
method Generalized Wasserstein GAN framework, SRVT block, maximal p-centrality discrepancy.
result High-dimensional critic output improves GAN performance in convergence and diversity.

Deep actor-critic learning optimizes power control in mobile networks.

problem Optimizing power control in large-scale wireless mobile networks.
method Multi-agent deep reinforcement learning with deep deterministic policy gradient.
result The algorithm maximizes a global utility function in a distributed manner.

DAC enhances exploration in reinforcement learning with entropy regularization.

problem Improving exploration efficiency in reinforcement learning.
method Sample-aware entropy regularization using replay buffer action distributions.
result DAC significantly outperforms existing algorithms in reinforcement learning tasks.

Parastatistic distribution of a total debt owed to a large number of creditors considered in relation to the duration of these debts. The process of debt calculation depends on the fractal dimension of economic system in which this process takes place. Two actual variants of these dimensions are investigated. Critical …

2016-01-28abs ↗pdf ↗