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,878 papers · 148 categories

Trend · papers per month

4478941,3411,788 · Jun 202019922001200920172026
48 results for learning times

Logarithmic regret for continuous-time reinforcement learning.

problem Continuous-time Markov decision processes with unknown transition probabilities and holding times.
method Upper confidence reinforcement learning, mean holding time estimation, stochastic comparison of point processes.
result Logarithmic regret bound achieved in finite time.

Continuous-time algorithms improve online learning performance.

problem Online learning with sequential data and minimizing overall regret.
method Extending discrete-time algorithms to continuous-time models for online linear optimization, adversarial bandit, and adversarial linear bandit.
result Optimal regret bounds are proven for continuous-time settings.

SoftCLT improves time series representation learning by soft contrastive loss.

problem Ignoring inherent correlations in time series leads to poor representation quality.
method SoftCLT introduces instance-wise and temporal contrastive loss with soft assignments.
result SoftCLT consistently improves various downstream tasks in time series learning.

ExpCLR uses expert features to improve time-series representation learning.

problem Current representation learning approaches fail to ensure useful properties for time-series data.
method ExpCLR employs expert features to replace data transformations in contrastive learning, ensuring two useful properties for time-series representations.
result ExpCLR outperforms state-of-the-art methods on three real-world time-series datasets.

Improved reinforcement learning with adaptive learning rates.

problem Enhancing the convergence rate of reinforcement learning algorithms.
method Two time-scale linear stochastic approximation algorithms, using Lyapunov functions and adaptive learning rates.
result Adaptive learning rate scheme significantly improves convergence rate over fixed learning rates.

A new method uses sinusoidal functions to represent timestamps as dense vectors for improving irregularly sampled time series learning.

problem Challenges in supervised learning with irregularly sampled time series due to irregular time intervals.
method Proposes a novel method to represent timestamps as dense vectors using sinusoidal functions, called Time Embeddings.
result Improves LSTM-based and classical machine learning models, especially with very irregular data.

Proposes a new approach to time series representation learning by embedding patches independently.

problem Capturing dependencies between time series patches is not optimal for representation learning.
method 1) Patch reconstruction task, 2) Patch-wise MLP, 3) Complementary contrastive learning.
result Improves time series forecasting and classification performance compared to state-of-the-art models.

Curriculum learning and imitation learning improve control over financial time-series data.

problem Improving control performance over complex financial time-series data.
method Data augmentation for curriculum learning and policy distillation for imitation learning.
result Curriculum learning shows significant improvement over time-series control tasks.

Develops a reinforcement learning algorithm for learning deterministic equilibrium policies in time-inconsistent control problems.

problem Learning equilibrium policies in time-inconsistent control problems.
method Continuous-time model-free reinforcement learning algorithm using deterministic policy gradient approach.
result Learned equilibrium policies in general time-inconsistent control problems.

Logarithmic regret achieved in continuous-time linear-quadratic reinforcement learning.

problem Optimizing control actions in unknown continuous-time systems over a finite time horizon.
method Least-squares algorithm based on continuous-time observations and controls, with perturbation analysis and parameter estimation error analysis.
result Logarithmic regret bound of order O((lnM)(lnlnM))O((\ln M)(\ln\ln M)).

Quantum model generates complex time series data with preserved temporal dynamics.

problem Generating synthetic time series data with temporal correlations.
method Quantum Hamiltonian learning to encode temporal dynamics.
result The proposed quantum model captures unique temporal features of the learned time series.

TRS-ODENs learn dynamics with time-reversal symmetry for more efficient learning.

problem Learning dynamics with time-reversal symmetry for more efficient learning.
method Proposed a loss function and a new framework (TRS-ODENs) to learn dynamics efficiently.
result TRS-ODENs can learn dynamics from noisy and complex trajectories efficiently.

Meta-learning for Koopman spectral analysis with short time-series data.

problem Lack of long time-series for training embedding functions in Koopman spectral analysis.
method Meta-learning approach using bidirectional LSTM and neural network to estimate embedding functions from short time-series.
result The proposed method achieves better performance in eigenvalue estimation and future prediction compared to existing methods.

A new unsupervised contrastive learning framework improves time series representation learning.

problem Lack of labeled data in time series data.
method Proposes an unsupervised contrastive learning framework using a novel contrastive loss and data augmentation.
result Framework outperforms other approaches on univariate and multivariate time series, and benefits transfer learning.

Develops DPG methods for continuous-time RL with deterministic policies.

problem High variance and slow convergence in stochastic policy RL methods.
method Derives continuous-time policy gradient formula and proposes CT-DDPG algorithm.
result CT-DDPG achieves superior stability and faster convergence in continuous-time RL.

Safe active learning for time-series models with Gaussian processes.

problem Learning time-series models while respecting safety constraints.
method Employing Gaussian processes with a nonlinear exogenous input structure, the approach dynamically explores the input space to generate data for model learning.
result The approach effectively learns time-series models under safety constraints, as demonstrated in a technical application.

Q(ΔΔ)-Learning improves Q-Learning by separating action-value functions into different time scales.

problem Q-Learning struggles with bias-variance trade-off, especially in long-term rewards.
method Introduces Q(ΔΔ)-Learning, extending TD(ΔΔ) to decompose Q(ΔΔ)-function into distinct discount factors.
result Q(ΔΔ)-Learning achieves better stability and scalability, especially for long-term tasks.

Paper introduces solving financial problems using time-stepped FBSDE and deep learning.

problem Quantitative finance problems under specific dynamics and instruments.
method Formulate as FBSDE, turn into control problems, time-step, solve with optimization and deep learning.
result Solves financial problems with new methods and deep learning.

TNC learns time series representations by leveraging temporal neighborhoods.

problem Complex, unlabeled time series data.
method Temporal Neighborhood Coding (TNC) with a debiased contrastive objective.
result TNC outperforms other unsupervised methods in time series clustering and classification.

A new ML method predicts long-time-step molecular dynamics, preserving symplectic and time-reversible properties.

problem Limited computational efficiency in long-time-step molecular dynamics simulations.
method Learning data-driven structure-preserving maps to generate long time-step classical dynamics.
result The method eliminates artifacts like lack of energy conservation and loss of equipartition.

Minimal assumptions analysis of Q-learning with time-varying policies.

problem Finite-time analysis of Q-learning with time-varying policies for discounted MDPs.
method Minimal assumptions, Poisson equation decomposition, sensitivity analysis.
result Established convergence rate and sample complexity for Q-learning.

Study shows using time-series privileged information improves model efficiency.

problem Efficiently predicting future outcomes using supervised models with privileged information.
method Developed an algorithm for learning with privileged time-series data and proved its efficiency for non-stationary Gaussian-linear systems.
result Learning with privileged information is more efficient than without it for non-stationary Gaussian-linear systems.

InceptionTime improves deep learning for time series classification, balancing accuracy and scalability.

problem Scalability issues in existing time series classification methods.
method InceptionTime, an ensemble of deep CNN models inspired by Inception-v4 architecture.
result InceptionTime achieves similar accuracy to HIVE-COTE but is significantly more scalable.

DeepLINK-T uses deep learning and knockoffs for time series data.

problem Interpreting and reproducible deep learning models for high-dimensional time series data.
method Combines deep learning with knockoffs for FDR control in feature selection for time series models.
result DeepLINK-T effectively controls FDR while demonstrating superior feature selection for high-dimensional longitudinal time series data.

MLAT improves kNN performance in time series by learning metrics that align and capture temporal dependencies.

problem Improving kNN performance in time series by learning metrics that effectively handle variations and temporal dependencies.
method MLAT uses a sliding window to augment time series data and applies time-invariant metric learning to derive the most appropriate distance measure.
result MLAT outperforms other existing algorithms in various real-world data sets.

Paper introduces timing-based adversarial attacks on DRL-based navigation systems.

problem Vulnerability of DRL-based navigation systems to adversarial attacks.
method Timing-based adversarial strategies using physical noise patterns.
result Adversarial timing attacks significantly degrade DRL-based navigation performance.

Overview of high-dimensional time series regression methods.

problem Estimation and inference with high-dimensional time series data.
method Limit theory for high-dimensional dependent data, asymptotic theory for time series regression, statistical learning methods.
result Main limit theory results and asymptotic theory for high-dimensional time series regression.

Develops framework for understanding deep learning in time series data.

problem Understanding and explaining decisions made by deep learning models in time series data.
method Uses deep neural networks to capture and explain temporal dependencies in time series data.
result Framework successfully captures and explains temporal dependencies in various synthetic and real-world datasets.

Proposes a self-boosted time series forecasting model using multi-task and multi-view learning.

problem Improving robustness and performance of time series forecasting models.
method Decomposes original time series into multiple series, uses multi-task learning for closely related series, and multi-view learning for loosely related series.
result Shows superior performance compared to existing methods on real-world datasets.