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.

169,051 papers · 148 categories

Trend · papers per month

167334501668 · Jun 202019922001200920182026
48 results for work history

The paper explains why estimating a history-dependent policy can reduce MSE in reinforcement learning.

problem Understanding why history-dependent policies can improve MSE in off-policy evaluation.
method The paper derives a bias-variance decomposition of MSE for various OPE estimators, showing how history-dependent policies can decrease variance and increase bias.
result History-dependent policies can decrease the variance of importance sampling estimators, leading to lower MSE.

Marden's Tameness Conjecture predicts that every hyperbolic 3-manifold with finitely generated fundamental group is homeomorphic to the interior of a compact 3-manifold. It was recently established by Agol and Calegari-Gabai. We will survey the history of work on this conjecture and discuss its many applications.

2010-07-31abs ↗pdf ↗

Neural networks improve cancer risk prediction from family history data.

problem Improving cancer risk prediction from family history data using machine learning.
method Developed and trained neural network models on large pedigrees to predict hereditary cancers.
result Neural networks can achieve nearly optimal prediction performance and outperform traditional models in misreported data.

Combining deep learning and ensemble smoothers for better history matching.

problem Dealing with complex facies distributions in history matching.
method Using autoencoders and generative adversarial networks to parameterize facies models, applying distance-based localization.
result Improved history matching performance with deep learning parameterizations.

Bayesian inference over admissible histories leads to irreversible kinetics.

problem Modeling irreversible processes in systems with uncertain histories.
method A Gibbs-type measure weighted by energy-dissipation action and observation constraints, interpreted as a Bayesian posterior.
result The measure concentrates on maximum-a-posteriori (MAP) histories, recovering classical deterministic evolution.

HS-FNO models non-Markovian PDEs by learning history and future states.

problem Non-Markovian dynamics where future states depend on past history.
method History-Space Fourier Neural Operator (HS-FNO) for delay and memory-driven PDEs.
result HS-FNO achieves lowest aggregate errors across various PDE families.

Rhino learns causal relationships from time series data with history-dependent noise.

problem Discovering causal relationships from time series data with non-linear relations, instantaneous effects, and history-dependent noise.
method Combines vector auto-regression, deep learning, and variational inference.
result Demonstrates better causal relationship discovery performance compared to baselines.

Recurrent networks learn beliefs from history in partially observable environments.

problem Learning optimal policies in partially observable environments.
method Trained recurrent neural networks to approximate value functions, measuring mutual information between hidden states and beliefs.
result Recurrent networks' hidden states correlate with beliefs of relevant state variables, improving expected return.

SRMC framework reduces Monte Carlo variance by history-based sampling in high-dimensional spaces.

problem Efficient sampling in high-dimensional discrete or continuous state spaces.
method Score-Repellent Monte Carlo (SRMC) framework that summarizes history through running average of score evaluations.
result Improves estimator variance and mode coverage with constant memory usage.

Paper analyzes history-based RL methods for MDPs, introduces a theoretical framework and practical algorithm.

problem Improving RL performance in MDPs using history-based features.
method Theoretical framework for history-based RL, practical algorithm design.
result Practical RL algorithm shows effectiveness on continuous control tasks.

This paper suggests claim history will be deprecated in future auto insurance rates.

problem The role of historical claim records in auto insurance rates.
method Proposes a new risk variable elimination method and real-time road risk model design.
result Claim history will be considered a 'noise' factor and deprecated in Pay-How-You-Drive models.

We present in this chapter (Chapter II) the history of ideas which lead up to the development of modern knot theory. We are more detailed when pre-XX century history is reported. With more recent times we are more selective, stressing developments related to Jones type invariants of links. In the Appendix, A.Przybyszew…

2007-03-03abs ↗pdf ↗

Rewriting history improves RL algorithms for solving multiple tasks.

problem Improving sample efficiency in multi-task reinforcement learning.
method Introducing hindsight relabeling as inverse RL to generalize goal-relabeling techniques.
result Relabeling data using inverse RL accelerates learning in multi-task settings.

PHE adds pseudo-rewards to history to minimize regret in stochastic bandits.

problem Minimizing cumulative regret in stochastic multi-armed bandits.
method PHE algorithm that adds O(t)O(t) i.i.d. pseudo-rewards to history and pulls the best arm based on the perturbed history.
result Near-optimal regret bounds derived for PHE.

DR-FRL learns functional states from irregular histories for causal inference.

problem Causal inference with irregularly sampled longitudinal data.
method DR-FRL workflow combining functional and temporal encoders, nuisance heads, and EIF-targeted validation.
result DR-FRL can improve causal inference when pseudo-outcomes are heavy-tailed or measurement is informative.

Paper tackles reinforcement learning for STL specifications with state history.

problem Learning optimal policies to satisfy STL specifications often requires too much state history, making the problem computationally intractable.
method Proposes a compact augmented state-space representation to capture state history and an approximation method to solve the objective.
result Shows the performance bound of the approximate solution and compares it with an existing technique.

Memory-Augmented Recurrent Networks improve dialogue coherence by expanding conversation history storage.

problem Fixed-size vectors limit dialogue coherence; attention mechanisms are computationally expensive.
method Introduce Neural Turing Machines (NTMs) to provide flexible and permanent storage for dialogue history.
result Improved perplexity performance compared to existing baselines.

Rating Prediction is a basic problem in Recommender System, and one of the most widely used method is Factorization Machines(FM). However, traditional matrix factorization methods fail to utilize the benefit of implicit feedback, which has been proved to be important in Rating Prediction problem. In this work, we consi…

2014-10-29abs ↗pdf ↗

Geometric Brownian motion simulates stock prices for Brazilian small caps index.

problem Simulating stock prices for the Brazilian small caps index.
method Used geometric Brownian motion to simulate stock prices of Brazilian small caps index using historical data.
result Simulated prices better for portfolios with higher returns, lower risks, and higher Sharpe Indexes.

This paper explores deep learning in music generation, from history to current techniques.

problem Creating music automatically using deep learning.
method Analysis of historical and recent deep learning music generation systems.
result Deep learning can learn musical styles and generate music samples.

Epsilon-machines are minimal, unifilar presentations of stationary stochastic processes. They were originally defined in the history machine sense, as hidden Markov models whose states are the equivalence classes of infinite pasts with the same probability distribution over futures. In analyzing synchronization, though…

2011-11-18abs ↗pdf ↗

Transformers improve Alzheimer's disease progression prediction by accounting for irregular biomarker histories.

problem Difficult prediction of medium-horizon Alzheimer's disease progression due to tied clinical scores and irregular biomarker observations.
method Developed a residual gap-aware transformer that combines statistical reference with transformer-based residual learning.
result The proposed model reduces mean error and improves prediction-observation correlation compared to baseline models.

Foundation models improve wage gap decomposition by capturing omitted career history factors.

problem Estimating wage disparities using incomplete career history data.
method Fine-tuning foundation models to mitigate omitted variable bias and estimate wage gaps.
result Foundation models can decompose gender wage gaps more accurately than traditional econometric methods.

A dangerously brief history of the developments of the main ideas in economics, as observed by a physicist, is given. This was published in 'Econophysics of Stock and Other Markets', Eds. A. Chatterjee, B. K. Chakrabarti, New Economic Windows Series, Springer, Milan, 2006, pp~219-224.

2007-09-26abs ↗pdf ↗

This paper argues for decolonizing AI alignment by incorporating open-source Hinduism concepts.

problem Coloniality in AI development and deployment, particularly in alignment practices.
method Proposes three forms of openness: model, societal, and excluded knowledge openness, using Hindu viśe\d{s}a-dharma.
result AI alignment should be decolonialized to avoid moral absolutism and better align with desired values.

Network growth processes can be understood as generative models of the structure and history of complex networks. This point of view naturally leads to the problem of network archaeology: reconstructing all the past states of a network from its structure---a difficult permutation inference problem. In this paper, we in…

2018-03-25abs ↗pdf ↗

Deep learning calibrates CO2 storage formations from seismic and well data.

problem Uncertainty in CO2 storage formation properties.
method Two deep learning models for well and seismic data, integrated into MCMC history matching.
result Significant uncertainty reduction in key parameters and accurate CO2 plume predictions.

Study designs incentives for adapting multi-agent systems without knowing their learning dynamics.

problem Designing incentives for an adapting population in multi-agent systems without prior knowledge of their learning dynamics.
method Introduces a model-based non-episodic Reinforcement Learning (RL) formulation for steering Markovian agents towards desired policies, focusing on history-dependent strategies to handle model uncertainty.
result Identifies conditions for the existence of steering strategies to guide agents to desired policies and provides empirical algorithms to approximately solve the objective.

Deep learning improves history matching of complex facies models.

problem Preserving geological realism in reservoir models with complex facies distributions.
method Convolutional variational autoencoder and ensemble smoother with multiple data assimilation.
result The parameterization generated well-defined channelized facies, outperforming previous methods.

A new method uses a frozen language model to improve sample efficiency in reinforcement learning.

problem Improving sample efficiency in reinforcement learning with partially observable environments.
method FROZEN Hopfield network and HELM (History Embedding Language Model) method.
result HELM achieves new state-of-the-art results on Minigrid and Procgen environments.

HDT improves MCMC on graphs with history-dependent sampling.

problem Efficient sampling from target distributions on general graphs with low computational overhead.
method History-driven target (HDT) framework that replaces the original target distribution with a history-dependent one.
result Near-zero variance performance and scalability to large graphs with memory-efficient implementation.

In this paper, we solve a problem posed by Rodica Simion regarding type B Gram determinants. We present this in a fashion influenced by the work of W.B.R.Lickorish on Witten-Reshetikhin-Turaev invariants of 3-manifolds. The roots of the determinant were predicted by Dabkowski and Przytycki, and the complete factorizati…

2008-02-08abs ↗pdf ↗

New algorithm for truncated linear regression without knowing the survival set.

problem Estimating the unknown regressor in truncated linear regression with an unknown survival set.
method Sub-Gaussian feature vectors and novel subroutine for learning unions of intervals.
result First algorithm with poly(d/ε) runtime for truncated linear regression with unknown survival set.

We propose a general framework to describe the impact of different events in the order book, that generalizes previous work on the impact of market orders. Two different modeling routes can be considered, which are equivalent when only market orders are taken into account. One model posits that each event type has a te…

2011-07-18abs ↗pdf ↗