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

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for deep sequential regression

Paper tackles uncertainty prediction for deep sequential regression.

problem Challenges in generating accurate uncertainty estimates for deep recurrent networks.
method Flexible method that generates symmetric and asymmetric uncertainty estimates without stationarity assumptions.
result Outperforms competitive baselines on both drift and non-drift scenarios.

This paper applies deep learning to ordinal regression, modeling it as a binary search.

problem Ordinal regression with deep learning models.
method Formulated ordinal regression as a binary search problem, using recurrent neural networks.
result Deep learning model shows comparable or better predictive power compared to traditional methods.

The paper develops a state-space approach to deep Gaussian processes for efficient state estimation.

problem Efficient regression and state estimation for deep Gaussian processes.
method Hierarchical transformed Gaussian process priors, state-space representation, linear stochastic differential equations, sequential methods.
result The state-space approach enables efficient state estimation and regression for deep Gaussian processes.

New insights into continual learning for deep models, showing convergence issues but local linear solutions.

problem Challenges in continual learning for homogeneous deep models.
method Sequential projections onto task margin sets, leveraging nonconvex projection theory.
result Local linear convergence under certain conditions for homogeneous deep networks.

Deep Bayesian models estimate causal effects for dynamic treatment regimes over long follow-up times.

problem Challenges in causal effect estimation for dynamic treatment regimes with long follow-up times.
method Combining outcome regression models with deep Bayesian models for high-dimensional features.
result Stable and accurate dynamic causal effect estimation from observational data, especially with long-term follow-up.

G-Net uses deep learning for complex counterfactual outcome prediction.

problem Estimating counterfactual outcomes under dynamic treatment strategies.
method G-Net is a sequential deep learning framework for G-computation.
result G-Net can handle complex temporal data and provide accurate treatment effects.

A new method for estimating uncertainty in deep neural networks.

problem Challenges in uncertainty estimation in deep neural networks, especially with increased complexity.
method Decompose tasks into representation learning and state space model for uncertainty estimation.
result The proposed method can estimate predictive distributions on top of existing neural networks.

Sequential coordinate ascent is more robust in high-dimensional linear regression.

problem Behavior difference between sequential and parallel coordinate ascent in variational inference.
method Comparison of sequential and parallel coordinate ascent algorithms in high-dimensional linear regression.
result Sequential algorithm converges under more relaxed conditions than parallel algorithm.

This paper reviews methods for interpreting deep learning models with sequential data.

problem Limited interpretability of deep learning models in sequential data domains.
method Reviews and compares techniques for sequential interpretability.
result Current techniques have limitations and future research is needed.

This paper studies statistical estimation in optional regression models.

problem Estimating parameters in regression models with optional semimartingale processes.
method Structural least squares (LS) estimates and their sequential versions.
result Strong consistency of LS-estimates and fixed accuracy of sequential LS-estimates.

Sparse Gaussian process quantile regression tackles computational challenges in Bayesian quantile regression.

problem Nonconjugacy and computational cost in Gaussian process quantile regression.
method Sparse Gaussian process framework with Laplace approximation, adaptive inducing-input placement, and sequential data acquisition.
result Accuracy of Laplace approximation and effectiveness of adaptive mechanisms in reducing predictive uncertainty.

Hybrid model for online nonlinear prediction using LSTM and soft GBDT.

problem Online nonlinear prediction with manual feature selection and model selection issues.
method End-to-end architecture with LSTM for feature extraction and soft GBDT for regression, jointly optimized.
result Significant performance improvements over conventional methods on real datasets.

Discovery of atomistic systems with desirable properties is a major challenge in chemistry and material science. Here we introduce a novel, autoregressive, convolutional deep neural network architecture that generates molecular equilibrium structures by sequentially placing atoms in three-dimensional space. The model e…

2018-10-26abs ↗pdf ↗

Student performance prediction - where a machine forecasts the future performance of students as they interact with online coursework - is a challenging problem. Reliable early-stage predictions of a student's future performance could be critical to facilitate timely educational interventions during a course. However, …

2018-04-19abs ↗pdf ↗

We establish optimal rates for online regression for arbitrary classes of regression functions in terms of the sequential entropy introduced in (Rakhlin, Sridharan, Tewari, 2010). The optimal rates are shown to exhibit a phase transition analogous to the i.i.d./statistical learning case, studied in (Rakhlin, Sridharan,…

2014-02-11abs ↗pdf ↗

This review assesses deep-learning methods for complex sequential data.

problem Lack of robustness and transparency in deep-learning frameworks for irregular sequential data.
method Systematic literature review of existing algorithms.
result Recurrent neural networks dominate in performance evaluation of deep-learning frameworks.

We study the problem of safe learning and exploration in sequential control problems. The goal is to safely collect data samples from operating in an environment, in order to learn to achieve a challenging control goal (e.g., an agile maneuver close to a boundary). A central challenge in this setting is how to quantify…

2019-06-13abs ↗pdf ↗

Tree-based LSTM improves sequential regression with missing data.

problem Regression for variable-length sequential data with missing samples.
method Tree architecture of LSTM networks, selecting LSTM networks based on presence-pattern of previous inputs.
result Significant performance improvements on financial and real-life datasets.

Selecting input variables or design points for statistical models has been of great interest in adaptive design and active learning. Motivated by two scientific examples, this paper presents a strategy of selecting the design points for a regression model when the underlying regression function is discontinuous. The fi…

2019-04-02abs ↗pdf ↗

Proposes a deep learning framework for interval-censored survival data.

problem Lack of deep learning methods for interval-censored survival data.
method Partially linear transformation models with DNN approximations for nonlinear effects.
result DNN estimator achieves minimax-optimal convergence and superior performance.

Sparse Meta Networks adapt deep neural networks incrementally for fast learning.

problem Training deep neural networks is slow and impractical for complex, changing environments.
method Sparse Meta Networks use a memory layer to learn online sequential adaptation, accumulating fast-weights incrementally.
result Sparse Meta Networks achieve strong performance in various sequential adaptation scenarios.

Unified deep sequential and state-space models for robust option pricing with uncertainty.

problem Combining robustness to noise and uncertainty measurement in option pricing models.
method Unscattered reservoir smoother (URS) integrating deep sequential and state-space models.
result URS achieves competitive forecasting accuracy and uncertainty measurement in noisy datasets.

Detects data drift in deep learning models using neural embeddings.

problem Detecting changes in data distribution in deep learning models.
method Formulates drift detection in a sequential decision framework and introduces a loss function to balance false alarms and quick detection.
result Demonstrates improved ability to balance false alarms and quick detection in change detection.

The paper addresses estimating long-term treatment effects with monotone missing data.

problem Estimating long-term treatment effects with missing data, especially monotone missing.
method The paper introduces the sequential missingness assumption for identification and proposes three novel estimation methods: inverse probability weighting, sequential regression imputation, and SeqMSM. It also introduces a balancing-enhanced approach, BalanceNet, to improve estimation accuracy.
result The proposed methods, including BalanceNet, effectively estimate long-term treatment effects with monotone missing data.

Randomized SINDy learns dynamic data structures using probabilistic methods.

problem Learning time-dependent data structures in dynamic systems.
method Sequential machine learning with a probabilistic approach, incorporating feature augmentation and Tikhonov regularization.
result Demonstrated effectiveness in regression and binary classification using real-world data.

This paper analyzes deep Stable neural networks, showing convergence rates under different growth settings.

problem Analyzing the behavior of deep Stable neural networks as width increases.
method Large-width asymptotic analysis and convergence rates for fully connected feed-forward deep Stable NNs.
result The rescaled deep Stable NN converges weakly to a Stable SP under joint growth, with sup-norm convergence rates established.

Study on neural networks' performance in sequential task learning.

problem Understanding the performance of neural networks in sequential task learning.
method Theoretical analysis of generalization performance in continual learning using statistical mechanical analysis of kernel ridge-less regression.
result Characteristic transitions from positive to negative transfer observed in neural networks.

New algorithm tackles stochastic optimization with inequality constraints.

problem Stochastic optimization with inequality constraints in various applications.
method Active-set stochastic sequential quadratic programming (StoSQP) with a differentiable exact augmented Lagrangian.
result Global convergence for any initialization, KKT residuals converge to zero almost surely.

This paper presents a novel technique based on gradient boosting to train the final layers of a neural network (NN). Gradient boosting is an additive expansion algorithm in which a series of models are trained sequentially to approximate a given function. A neural network can also be seen as an additive expansion where…

2019-09-26abs ↗pdf ↗

A universal framework for constructing confidence sets using sequential likelihood mixing.

problem Constructing reliable confidence sets for realizable likelihood functions.
method Sequential likelihood mixing, integrating Bayesian inference and regret inequalities.
result Establishes fundamental connections and provable coverage guarantees for various inference techniques.

Bayesian reflex models AI learning like the autonomic nervous system.

problem Online learning in dynamic AI environments.
method Bayesian online algorithms with belief maintenance, sequential updating, and uncertainty-driven action balancing.
result Unified framework for adaptive AI learning.

Transformers learn new tasks from few examples via optimal approximation.

problem Learning new tasks from limited examples using large language models.
method Developed approximation and generalization error bounds for transformers trained on nonparametric regression tasks.
result Transformers achieve minimax optimal estimation risk in context.

This paper develops a novel deep recurrent neural network for sequential signal reconstruction.

problem Sequential signal reconstruction from low-dimensional measurements.
method Unfolding a reweighted 1\ell_1-1\ell_1 minimization algorithm to design a deep recurrent neural network.
result The proposed reweighted-RNN significantly outperforms existing RNN models in sequential frame reconstruction.

We propose a penalized orthogonal-components regression (POCRE) for large p small n data. Orthogonal components are sequentially constructed to maximize, upon standardization, their correlation to the response residuals. A new penalization framework, implemented via empirical Bayes thresholding, is presented to effecti…

2008-11-25abs ↗pdf ↗