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

137274410547 · Jun 202019922001200920172026
48 results for critical processes

Study on critical faces convergence in a Poisson point process.

problem Convergence of point processes associated with critical faces in a Čech filtration.
method Established convergence in M0\mathcal M_0-topology for critical faces above vanishing threshold.
result Obtained limit theorems for positive and negative critical faces.

The study examines Hawkes processes and their long-term behavior.

problem Understanding the long-term behavior of Hawkes processes.
method Proving functional limit theorems under various conditions on the dispersion of child events.
result Functional limit theorems hold for Hawkes processes with different levels of child event dispersion.

A new method uses higher-order Langevin dynamics with critical damping for better generative modeling.

problem Improving generative models using Langevin dynamics with auxiliary variables.
method Introducing higher-order Langevin dynamics with critical damping, providing closed-form solutions.
result Improved generative models with better performance as measured by FID metric.

Text analytics based on supervised machine learning classifiers has shown great promise in a multitude of domains, but has yet to be applied to Seismology. We test various standard models (Naive Bayes, k-Nearest Neighbors, Support Vector Machines, and Random Forests) on a seismological corpus of 100 articles related to…

2018-10-05abs ↗pdf ↗

First we provide a simple set of sufficient conditions for the weak convergence of scaled affine processes with state space R+×RdR_+ \times R^d. We specialize our result to one-dimensional continuous state branching processes with immigration. As an application, we study the asymptotic behavior of least squares estimators…

2012-10-05abs ↗pdf ↗

The paper studies Hawkes processes under mean-field limits and criticality conditions.

problem Analyzing nearly unstable Hawkes processes in a mean-field regime.
method Extending the method by Jaisson and Rosenbaum, establishing scaling limits and propagation of chaos.
result Scaling limits of Hawkes processes are stochastic Volterra diffusions of affine type, with three distinct limiting regimes.

SGPA calibrates transformer uncertainty for safety-critical tasks.

problem Uncertainty estimation in transformer models for safety-critical domains.
method Bayesian inference in transformer's output space using sparse Gaussian processes.
result SGPA-based Transformers improve in-distribution calibration and out-of-distribution robustness.

Improved sample complexity for actor-critic algorithms in MDPs.

problem Achieving optimal policies with limited data in reinforcement learning.
method Single-timescale actor-critic with STORM (STOchastic Recursive Momentum) and a sample buffer.
result Optimal sample complexity of O(ε2)O(ε^{-2}) for εε-optimal policies.

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 ↗

Model criticism tool evaluates text coherence and structure in generated long-form text.

problem Evaluate the high-level structure of generated text for coherence, coreference, and topicality.
method Apply model criticism in latent space to compare real and generated data distributions.
result Transformer-based models struggle with maintaining structural coherence and coreference.

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.

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 ↗

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.

Improved convergence for actor-critic algorithms in MDPs.

problem Global convergence analysis for actor-critic algorithms in MDPs.
method Introduced an analytical framework to handle complex recursions, established convergence to ε-close globally optimal policy with improved sample complexity.
result Converges to ε-close globally optimal policy with sample complexity of O(ε^(-3)) compared to O(ε^(-2)) for ε-close stationary policy.

Model criticism is usually carried out by assessing if replicated data generated under the fitted model looks similar to the observed data, see e.g. Gelman, Carlin, Stern, and Rubin [2004, p. 165]. This paper presents a method for latent variable models by pulling back the data into the space of latent variables, and c…

2017-11-13abs ↗pdf ↗

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.

In this study, we investigate the use of global information to speed up the learning process and increase the cumulative rewards of reinforcement learning (RL) in competition tasks. Within the actor-critic RL, we introduce multiple cooperative critics from two levels of the hierarchy and propose a reinforcement learnin…

2019-02-08abs ↗pdf ↗

Modeling price formation with interacting Hawkes processes leading to stochastic volatility with leverage.

problem Capturing the complex dynamics of price formation in financial markets.
method Agent-based approach to aggregate self-exciting point processes with mean-field interaction.
result Aggregated model converges to a stochastic volatility model with leverage effect and faster-than-linear mean reversion.

Improved generative models using critically-damped Langevin diffusion.

problem Current score-based generative models (SGMs) use overly simplistic diffusion processes, leading to complex denoising tasks and suboptimal performance.
method Proposed a novel critically-damped Langevin diffusion (CLD) and derived a score matching objective and sampling scheme.
result CLD-based SGMs achieve superior performance in synthesis quality compared to previous methods.

Study of critical points in Ginzburg-Landau approximation with stability results.

problem Stability of critical points in Ginzburg-Landau approximation.
method Application of previous joint method with T. Rivière for upper semi-continuity of extended Morse index.
result Upper semi-continuity of extended Morse index for sequences of critical points.

Enhanced Sampling Scheme improves masked generative modeling.

problem Limitations of existing sampling schemes in masked non-autoregressive generative modeling.
method ESS consists of three stages: Naive Iterative Decoding, Critical Reverse Sampling, and Critical Resampling.
result ESS achieves significant performance gains in unconditional and class-conditional sampling.

The paper analyzes SGD in high-dimensional networks, revealing new scaling limits.

problem Understanding SGD dynamics in high-dimensional networks.
method Analyzing the effective dynamics of SGD using recent work on the subject.
result A new correction term emerges at the critical scaling regime, changing the phase diagram.

Paper improves AIRL by enhancing policy imitation and addressing reward recovery issues.

problem Inadequate policy imitation and limited transferable reward recovery in AIRL.
method Substituted built-in algorithm with SAC for policy updating and proposed PPO-AIRL + SAC hybrid framework.
result SAC improves policy imitation but hinders reward recovery; PPO-AIRL + SAC achieves satisfactory transfer effect.

Probabilistic modeling is a powerful approach for analyzing empirical information. We describe Edward, a library for probabilistic modeling. Edward's design reflects an iterative process pioneered by George Box: build a model of a phenomenon, make inferences about the model given data, and criticize the model's fit to …

2016-10-31abs ↗pdf ↗

Introduces VSMD to improve generative diffusion processes without high costs.

problem High training costs and scalability issues in generative diffusion processes.
method Introduces variational Schrödinger momentum diffusion (VSMD) with adaptively transport-optimized variational scores and critical-damping transform.
result Efficiently generates anisotropic shapes while maintaining transport efficacy, outperforming alternatives.

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 ↗

Optimistic actor-critic tackles linear MDPs with parametric policies.

problem Theoretical limitations of existing actor-critic methods for linear MDPs.
method Proposes an optimistic actor-critic framework with parametric log-linear policies and approximate Thompson sampling.
result Achieves state-of-the-art sample complexity in both on-policy and off-policy settings.

New theory predicts deep neural networks can operate in an extended critical regime without fine-tuning.

problem Understanding the dynamics and computational principles of deep neural networks.
method Combining theories of heavy-tailed random matrices and non-equilibrium statistical physics.
result Deep neural networks can operate in an extended critical regime without fine-tuning parameters.

The distance function to a generic submanifold behaves well under small perturbations.

problem The critical points of the distance function to a generic submanifold can be poorly behaved.
method Listed and proved regularity conditions on critical and μ-critical points of a submanifold, and showed they are generically satisfied and stable under small C2C^2 perturbations.
result The distance function to a submanifold satisfies Morse-like conditions when the regularity conditions are fulfilled.

Similar to humans and animals, deep artificial neural networks exhibit critical periods during which a temporary stimulus deficit can impair the development of a skill. The extent of the impairment depends on the onset and length of the deficit window, as in animal models, and on the size of the neural network. Deficit…

2017-11-24abs ↗pdf ↗

New method diagnoses criticality in deep neural networks, improving performance.

problem Improving theoretical understanding and practical initialization of deep neural networks.
method Introducing partial Jacobians and deriving recurrence relations for their norms to analyze criticality.
result Proper stacking of LayerNorm and residual connections leads to a critical architecture for any initialization.

HOFLON automates process start-ups and grade-changes using offline RL and online optimization.

problem Manual operation of start-ups and grade-changes by experts is declining, leaving plant owners without the necessary tacit know-how.
method HOFLON combines offline RL to learn a latent manifold and long-horizon Q-critic, and online optimization to maximize Q-critic while penalizing deviations and excessive variable changes.
result HOFLON outperforms standard offline RL in industrial case studies, delivering better cumulative rewards than historical data.