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

0.4%0.9%1.3%1.8% · Oct 199919922001200920182026
48 results for Serial Episodes

New memory allocation scheme improves image generation performance.

problem Improving episodic and semantic memory representation in neural networks.
method Developed a hierarchical latent variable model with differentiable, locally block allocated latent memory.
result Improved conditional likelihood values on various datasets.

The paper proposes a generic learning method for complex structures.

problem Learning algorithms for complex structures are inefficient and require significant effort.
method Mapping any complex structure onto a generic form (serialization) and applying sequence-based density estimators.
result The method is competitive or better than specialized algorithms for given structures and provides protection from overfitting.

Stochastic momentum methods trade compute efficiency for serial runtime.

problem Stochastic momentum methods trade compute efficiency for serial runtime.
method Stochastic HB and ASGD for consistent linear regression with Gaussian covariates.
result HB preserves SGD-level CE over a larger batch-size window, allowing larger batches to reduce serial runtime until HB reaches its deterministic accelerated scale.

Study predicts hearing recovery in MD patients using TEOAE signals.

problem Predicting hearing recovery in MD patients during acute episodes.
method Applied machine learning to TEOAE signals from MD patients, using SVM for classification.
result Baseline TEOAE parameters can predict hearing recovery in MD patients.

The paper proposes estimators for bid-ask spreads with and without serial dependence.

problem Estimating bid-ask spreads in financial markets with and without serial dependence.
method The authors propose moment-based estimators for bid-ask spreads, considering both geometric Brownian motion and geometric fractional Brownian motion for price dynamics, and Ornstein-Uhlenbeck process for microstructure noise.
result The estimators are consistent and asymptotically normal, and perform well compared to existing approaches on simulated data.

The book chapter discusses tail risk analysis for financial data using extreme value statistics.

problem Serial dependence in financial time series complicates tail risk assessment.
method The approach involves unconditional and conditional quantile forecasting.
result Serial dependence impacts multivariate tail dependence.

The study sets criteria for efficient communication in distributed online learning.

problem Achieving optimal learning performance while minimizing communication in distributed online learning.
method Formal criteria based on the intuition that in the worst case, every input is essential for learning performance and must be exchanged.
result The criteria hold for a simplified version of a previously published protocol, providing a communication bound that scales with the serialized prediction problem's hardness.

We study the impact of volatility on intraday serial correlation, at time scales of less than 20 minutes, exploiting a data set with all transaction on SPX500 futures from 1993 to 2001. We show that, while realized volatility and intraday serial correlation are linked, this relation is driven by unexpected volatility o…

2006-10-03abs ↗pdf ↗

Algorithm beats best constant rebalancing portfolio in long-term investment.

problem Poor performance of learning algorithms in online portfolio optimization.
method Leverages serial dependence in asset returns without distributional assumptions.
result Strategy asymptotically grows to highest rate among all strategies.

CoT enhances transformer accuracy on serial tasks by enabling serial computation.

problem Improving accuracy of large language models on inherently serial problems.
method Integrating a chain of thought (CoT) into decoder-only transformers to enable serial computation.
result Constant-depth transformers with CoT can solve problems in AC^0, surpassing TC^0 without CoT.

In this paper we investigate the adaptive market efficiency of the agricultural commodity futures market, using a sample of eight futures contracts. Using a battery of nonlinear tests, we uncover the nonlinear serial dependence in the returns series. We run the Hinich portmanteau bicorrelation test to uncover the momen…

2014-12-27abs ↗pdf ↗

Algorithm tackles constrained reinforcement learning with concave-convex and knapsack constraints.

problem Constrained episodic reinforcement learning with concave rewards and convex constraints.
method Modular analysis with strong theoretical guarantees for concave-convex and knapsack settings.
result Significantly outperforms existing approaches in constrained episodic environments.

ParaMonte::Python streamlines Bayesian data analysis with fast Monte Carlo and MCMC routines.

problem Efficiently sampling posterior distributions in Bayesian modeling and data science.
method Serial and MPI-parallelized Markov Chain Monte Carlo (MCMC) routines.
result Automated model calibration and uncertainty quantification in Bayesian analysis.

We present a general framework for accelerating a large class of widely used Markov chain Monte Carlo (MCMC) algorithms. Our approach exploits fast, iterative approximations to the target density to speculatively evaluate many potential future steps of the chain in parallel. The approach can accelerate computation of t…

2014-03-28abs ↗pdf ↗

Improved regret bound for online learning in unknown MDPs.

problem Online learning in unknown episodic MDPs with changing loss functions.
method Adapts adversarial MDP model to convex performance criteria using entropic regularization.
result Achieved ildeO(LXAT) ilde{O}(L|X|\sqrt{|A|T}) regret bound.

Many interesting real world domains involve reinforcement learning (RL) in partially observable environments. Efficient learning in such domains is important, but existing sample complexity bounds for partially observable RL are at least exponential in the episode length. We give, to our knowledge, the first partially …

2016-05-25abs ↗pdf ↗

Algorithm improves online learning in adversarial bandits.

problem Online learning in adversarial multi-armed bandits with non-uniform best arm distribution.
method Online-within-online setup, inner and outer learners, leveraging non-uniform empirical distribution of best arms.
result Improves regret bounds for non-uniform best arm distributions.

New algorithm learns reward signals from episodic returns for better reinforcement learning.

problem Difficulty in designing reward functions for real-world reinforcement learning tasks.
method Introduces a new algorithm that decomposes episodic returns into time-step rewards using deep neural networks.
result Learning reward signals from episodic returns improves reinforcement learning efficiency.

Estimates Hurst exponent of log-volatility using KS statistic, addressing serial correlation in financial data.

problem Estimating Hurst exponent of log-volatility in financial time series with serial correlation.
method Proposes a random permutation procedure to remove serial correlation, using the Kolmogorov-Smirnov statistic for distribution-based estimation.
result Establishes the asymptotic variance of the estimator and reveals statistically significant hierarchy of roughness in volatility measures.

Reinforcement learning (RL) algorithms have made huge progress in recent years by leveraging the power of deep neural networks (DNN). Despite the success, deep RL algorithms are known to be sample inefficient, often requiring many rounds of interaction with the environments to obtain satisfactory performance. Recently,…

2018-05-19abs ↗pdf ↗

We introduce a new class of reinforcement learning methods referred to as {\em episodic multi-armed bandits} (eMAB). In eMAB the learner proceeds in {\em episodes}, each composed of several {\em steps}, in which it chooses an action and observes a feedback signal. Moreover, in each step, it can take a special action, c…

2015-08-04abs ↗pdf ↗

Proposes rCV to preserve serial correlations in time-series models.

problem Loss of serial correlations in cross-validation for time-series models.
method Form k folds, generate k new partial time-series, reconstruct using imputation/smoothing, build primary models, evaluate performance.
result Avoids loss of serial correlations and preserves non-stationarity in predictions.

Enhanced image recognition models learn from human-like memory and shape biases.

problem Improving robustness of image recognition models against various perturbations.
method Integrating human-like episodic memory and shape bias features into image recognition models.
result Combining human-like features improves robustness against both adversarial and natural perturbations.

Method predicts LFSM increments from past observations using codifference.

problem Forecasting LFSM increments from discrete-time observations.
method Uses codifference for serial dependence, with conditional expectation or projection for α>1α>1 or α<2α<2.
result Method shows promising performance in forecasting volatilities, capturing kurtosis and serial dependence.

New rule reduces exploration regret to logarithmic, improving bad episode handling.

problem Improving exploration regret in average reward MDPs.
method Replacing Doubling Trick with Vanishing Multiplicative rule in EVI-based algorithms.
result Regret is logarithmic under the new rule, significantly better than linear.

Improved reinforcement learning for episodes with varying action sets.

problem Reinforcement learning with context-dependent action sets.
method Extends MVP algorithm to handle adversarial and stochastic contexts.
result Established minimax regret bounds of O(SAH3KlogL)O(\sqrt{SAH^3K\log L}) for adversarial contexts.