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

275582109 · Jun 202019922001200920172026
48 results for rare transitions

Develops methods to simulate rare transitions in molecular systems.

problem Rare transitions between metastable states in molecular systems are difficult to study due to limited data.
method Two novel methods: chain-based and midpoint-based approaches.
result Demonstrates effectiveness of methods in both data-rich and data-scarce scenarios.

A new method uses deep learning to efficiently sample rare transitions for estimating committor functions.

problem Efficiently sampling rare transitions to estimate committor functions in high-dimensional problems.
method DASTR (Deep Adaptive Sampling on Transition Paths) method using deep generative models.
result Significantly improved accuracy in approximating committor functions through efficient sampling.

Deep reinforcement learning method finds rare events in complex systems.

problem Computing transition pathways in high-dimensional systems.
method Formulated as a cost minimization problem, solved using DDPG with physical properties.
result Efficiently samples and computes globally optimal transition pathways.

Method reveals dissimilarity in alloys' Curie temperatures.

problem Tackles the dissimilarity between rare-earth transition metal binary alloys.
method Ensemble learning with Kernel ridge regression.
result Reveals meaningful relations between alloys' structure and Curie temperature.

New methods use machine learning to simulate rare transitions in molecular systems.

problem Simulating rare transitions between metastable states in molecular dynamics.
method Generative models and reinforcement learning for importance sampling.
result Efficiently generated transition paths linking metastable states.

Enhanced diffusion sampling improves rare event sampling in biomolecular simulations.

problem Efficiently sampling rare transition events in biomolecular systems.
method Quantitative steering protocols to generate biased ensembles and exact reweighting.
result Fast, accurate, and scalable estimation of equilibrium properties.

Enhanced diffusion sampling tackles rare event sampling in biomolecular simulations.

problem Efficiently sampling rare transition events in biomolecular simulations.
method Quantitative steering protocols to generate biased ensembles, followed by exact reweighting.
result Fast, accurate, and scalable estimation of equilibrium properties for folding free energies.

A new framework uses stochastic optimal control to estimate rare events more accurately.

problem Estimating rare events like chemical reactions in biomolecules is computationally challenging.
method The approach casts committor estimation as a stochastic optimal control problem, developing direct and off-policy Value Matching losses.
result The framework yields more accurate committor estimates, reaction rates, and equilibrium constants.

New method uses active importance sampling for rare event optimization in high-dimensional problems.

problem Optimizing complex, high-dimensional functions with rare events.
method Combines rare events sampling with neural network optimization.
result Importance sampling reduces asymptotic variance, improving generalization.

PRESTO improves rare event prediction by shrinking towards proportional odds model.

problem Difficult to predict rare events due to class imbalance.
method PRESTO relaxes proportional odds model by estimating separate weights for transitions between categories, imposing L1 penalty to shrink towards proportional odds.
result PRESTO consistently estimates decision boundary weights under sparsity assumption, improving rare probability estimation.

Develops methods for spectral estimation and rare-event prediction in complex systems.

problem Challenges in understanding dynamics in complex systems with many degrees of freedom.
method Inexact iterative numerical linear algebra methods for spectral estimation and rare-event prediction.
result Demonstrates methods on low-dimensional and high-dimensional models, showing their effectiveness.

New CVs preserve transition rates in molecular dynamics.

problem Designing CVs that accurately capture rare events in high-dimensional systems.
method Integrating manifold learning and group-invariant featurization to construct neural network-based CVs that satisfy orthogonality conditions.
result Achieved a CV for butane that reproduces the anti-gauche transition rate with less than ten percent relative error.

Study phase transitions in shuffled regression problems.

problem Phase transitions in shuffled regression problems.
method Transformed permutation recovery into probabilistic graphical model, used message passing (MP) algorithm and branching random walk process.
result Characterized impact of signal-to-noise-ratio ($\snr$) on permutation recovery, proposed Gaussian approximation method.

Complex numbers have long been favoured for digital signal processing, yet complex representations rarely appear in deep learning architectures. RNNs, widely used to process time series and sequence information, could greatly benefit from complex representations. We present a novel complex gated recurrent cell, which i…

2018-06-21abs ↗pdf ↗

New insights into neural networks reveal unexpected phase transitions.

problem Understanding how overparameterized neural networks learn and generalize.
method Statistical physics of disordered systems applied to non-convex binary neural networks.
result Atypical phase transitions lead to better generalization in neural networks.

Develops a machine learning framework for computing most probable paths in stochastic systems.

problem Computing the most probable paths in stochastic dynamical systems.
method Reformulates the boundary value problem of Hamiltonian systems and uses a neural network to solve the Euler-Lagrange equation for the Onsager-Machlup action functional.
result Demonstrates the efficacy and accuracy of the machine learning approach in computing most probable paths for stochastic systems with various types of noise.

Efficient RL algorithms for linear function approximation with limited adaptivity constraints.

problem Limited adaptivity in reinforcement learning with linear function approximation.
method Proposed two efficient online RL algorithms for episodic linear Markov decision processes under batch learning and rare policy switch models.
result Achieved efficient regret bounds for both batch learning and rare policy switch models, with substantial reduction in adaptivity.

New RL algorithm achieves nearly optimal performance for linear MDPs.

problem Optimal reinforcement learning for episodic linear MDPs.
method Weighted linear regression with variance estimator and rare-switching policy.
result Achieves nearly minimax optimal regret ildeO(dH3K) ilde O(d\sqrt{H^3K}).

Adjoint sampler targets infinite-dimensional function spaces for efficient sampling.

problem Limited theory and algorithms for sampling infinite-dimensional function spaces.
method Adjoint Sampler for infinite-dimensional function spaces based on stochastic maximum principle.
result FAS achieves superior performance in synthetic and real systems.

Study phase transitions in identifying infected individuals using group testing.

problem Identifying a set of k infected individuals from a population using pooled tests.
method Two random assignment designs (constant-column and Bernoulli) and polynomial-time inference procedures.
result Sharp phase transitions in statistical and computational limits for detection and recovery problems.

It is common in modern prediction problems for many predictor variables to be counts of rarely occurring events. This leads to design matrices in which many columns are highly sparse. The challenge posed by such "rare features" has received little attention despite its prevalence in diverse areas, ranging from natural …

2018-03-18abs ↗pdf ↗

Proposes a thermodynamic work minimization framework for guiding generative models.

problem Guiding generative models in sparse-data regimes with limited target samples or constraints.
method Regularization framework inspired by thermodynamic work, introducing Path Guidance and Observable Guidance.
result Improves sample efficiency and reduces bias in molecular simulations.

Fund2Persona creates personalized financial advisor personas from fund data, improving investment advice.

problem Lack of consistent advisor expertise and difficulty in encoding it in LLM systems.
method Grounds financial advisor personas in fund disclosures, market context, and manager commentary through an agentic actor--scorer--patcher loop.
result Personas better recover portfolio decisions and manager interpretation than generic baselines.

Fund2Persona creates personalized financial advisor personas from fund data, improving investment advice and manager interpretation.

problem Lack of consistent and specific financial advisor expertise in personalized investment advice.
method Grounds financial advisor personas in fund disclosures, holdings transitions, market context, and manager commentary through an agentic actor--scorer--patcher loop.
result Personas better recover portfolio decisions and grounded manager interpretation than generic baselines.
Colored minority gamescond-mat.stat-mech

We study the behavior of simple models for financial markets with widely spread frequency either in the trading activity of agents or in the occurrence of basic events. The generic picture of a phase transition between information efficient and inefficient markets still persists even when agents trade on widely spread …

2002-02-26abs ↗pdf ↗

Develops a method to estimate rare-event probabilities under distributional uncertainty.

problem Distributional uncertainty limits the effectiveness of rare-event simulation techniques.
method Wasserstein distributionally robust rare-event simulation (DRIS) framework.
result DRIS achieves vanishing relative error in estimating rare-event probabilities.

This paper evaluates data enrichment techniques for rare event detection in manufacturing.

problem Rare events in manufacturing lead to unplanned downtime and high energy consumption.
method Time series data augmentation, sampling, and imputation techniques combined with supervised machine learning.
result Data enrichment enhances rare failure event detection and prediction by up to 48%.

Proposes a method to ensure accurate estimation of rare events in AI systems.

problem Lack of efficiency guarantees in black-box systems for rare-event simulation.
method Integrates deep learning with importance sampling to create a statistically guaranteed estimator.
result Demonstrates effective estimation of rare-event probabilities in AI systems.

WEST uses EHRs and expert cases to improve rare disease phenotyping.

problem Limited labeled data for rare diseases.
method Weakly supervised transformer model trained on probabilistic silver-standard labels.
result WEST outperforms existing methods in phenotype classification and subphenotyping.

Given a labeled dataset that contains a rare (or minority) class of of-interest instances, as well as a large class of instances that are not of interest, how can we learn to recognize future of-interest instances over a continuous stream? We introduce RaRecognize, which (i) estimates a general decision boundary betwee…

2019-06-28abs ↗pdf ↗

This research examines rare spurious correlations in neural networks and their impact on accuracy and privacy.

problem Rare spurious correlations in neural networks and their privacy risks.
method Introducing spurious patterns correlated with a fixed class to a few training examples, analyzing 2\ell_2 regularization and Gaussian noise.
result Rare spurious correlations can significantly impact neural network accuracy and privacy, and specific mitigation methods can be effective.

In rare disease physician targeting, a major challenge is how to identify physicians who are treating diagnosed or underdiagnosed rare diseases patients. Rare diseases have extremely low incidence rate. For a specified rare disease, only a small number of patients are affected and a fractional of physicians are involve…

2017-01-19abs ↗pdf ↗

Simulates patient pathways to detect delayed rare disease diagnoses.

problem Delayed rare disease diagnoses in France, causing health system and patient harm.
method Probabilistic modelling of patient pathways to create an alert system.
result Alert system detects and refers wandering patients to CRMRs.

Model predicts travel time under rare conditions using a vector-space model.

problem Predicting travel time under rare temporal conditions (e.g., holidays, school vacations) is challenging due to limited historical data and other temporal changes.
method Presented a vector-space model for encoding rare temporal conditions, allowing coherent representation learning across different conditions.
result Increased performance for travel time prediction over different baselines when using the vector-space encoding for representing the temporal setting.

Deep CNNs struggle with rare taxa; one-class classifiers help identify them.

problem Efficiently identifying rare benthic macroinvertebrates in insect monitoring.
method Combining deep CNNs with one-class classifiers to identify rare taxa.
result The proposed approach can improve rare species identification, supporting automation.