Acute kidney injury (AKI) commonly occurs in hospitalized patients and can lead to serious medical complications. In order to optimally predict AKI before it develops at any time during a hospital stay, we present a novel framework in which AKI is continually predicted automatically from EHR data over the entire hospit…
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,932 papers · 148 categories
Trend · papers per month
48 results for “continual prediction”
Hybrid quantum neural networks predict continuous variables.
problem Predicting continuous variables using quantum computing.
method Quantum classical hybrid neural networks for continuous variable prediction.
result Quantum neural networks outperform classical methods in continuous variable prediction.
Inference, Prediction, and Entropy-Rate Estimation of Continuous-time, Discrete-event Processescond-mat.stat-mech
New methods for inferring, predicting, and estimating continuous-time, discrete-event processes.
problem Inferring, predicting, and estimating entropy rate of continuous-time, discrete-event processes.
method Bayesian structural inference extended with neural networks.
result Methods are competitive for prediction and entropy-rate estimation with state-of-the-art.
This paper describes recent development and test implementation of a continuous time recurrent neural network that has been configured to predict rates of change in securities. It presents outcomes in the context of popular technical analysis indicators and highlights the potential impact of continuous predictive capab…
New measure assesses predictive dependence between continuous variables, capturing non-functional relationships.
problem Quantifying the joint dependence between continuous random variables.
method Introduces a novel, fully non-parametric measure bounded [0,1] that assesses predictive accuracy loss.
result The measure captures a wide range of relationships, including non-functional ones, and is interpretable.
Proposes a method for generating prediction intervals in dose-response models using conformal prediction.
problem Uncertainty quantification in continuous treatments for personalized healthcare decisions.
method Causal dose-response problem framed as covariate shift, using weighted conformal prediction with propensity estimation and kernel functions.
result Demonstrates the significance of covariate shift assumptions for robust prediction intervals.
A method for predicting survival using neural networks for both continuous and discrete time.
problem Survival prediction for both continuous and discrete time data.
method Proposes a scheme for discretizing continuous-time data and two interpolation schemes for continuous-time survival estimates.
result The hazard rate parametrization of neural networks yields better performance than the parametrization of the probability mass function.
Policy Prediction Network improves continuous control problems with model-free and model-based learning.
problem Improving sample complexity and performance in continuous control problems.
method Integrates model-free and model-based reinforcement learning, introduces implicit model-based learning for continuous action space.
result First to introduce implicit model-based learning to Policy Gradient algorithms for continuous action space.
A new video prediction model treats videos as continuous processes, reducing sampling steps and improving efficiency.
problem Efficiency and temporal coherence in video prediction models.
method Treats videos as a continuous multi-dimensional process, reducing sampling steps.
result Reduction of 75% sampling steps, state-of-the-art performance on benchmark datasets.
New approach to continual learning prioritizes adaptation over retention.
problem Catastrophic forgetting in lifelong learning models.
method Formalized CL as an online optimization problem, introduced Transfer Efficiency, and derived a Critical Task Duration.
result Retention can hinder real-time adaptation in non-stationary environments.
Paper studies continuous prediction with experts' advice using differential equations.
problem Continuous prediction with experts' advice in online learning.
method Continuous-time stochastic calculus and differential equations.
result Improved guarantees for quantile regret with continuous-time algorithm.
The paper tackles fast rates in structured prediction problems.
problem Structured prediction problems with discrete outputs.
method Introducing continuous surrogate problems and leveraging their convergence rates for discrete problems.
result Super fast rates, including exponential rates, for excess risk in structured prediction problems.
Neural Jump Ordinary Differential Equations: Consistent Continuous-Time Prediction and Filteringstat.ML
Neural Jump ODE improves continuous-time prediction and filtering of irregularly sampled time series.
problem Theoretical guarantees for continuous-time prediction and filtering of irregularly observed time series.
method Introducing Neural Jump ODE (NJ-ODE) that models conditional expectation between observations with neural ODEs and jumps.
result Theoretical guarantees for the -optimal prediction are provided, showing convergence of model output to optimal prediction.
Gradient boosting of regression trees is a competitive procedure for learning predictive models of continuous data that fits the data with an additive non-parametric model. The classic version of gradient boosting assumes that the data is independent and identically distributed. However, relational data with interdepen…
Temporal-difference (TD) networks are a class of predictive state representations that use well-established TD methods to learn models of partially observable dynamical systems. Previous research with TD networks has dealt only with dynamical systems with finite sets of observations and actions. We present an algorithm…
Proposes a new method for continual learning in neural networks.
problem Challenges in applying sequential Bayesian inference to neural networks.
method Sequential function-space variational inference.
result Neural networks trained with the proposed method achieve better predictive accuracy.
POSL predicts dynamic convection volumes in hemodiafiltration patients.
problem Continuous, personalised predictions in personalised medicine.
method Adapted POSL to dynamically predict convection volumes using combinations of parametric regressions and machine learning.
result POSL outperformed candidate learners in predicting convection volumes with lower errors and better calibration.
End-to-end network predicts and aligns continuous emotion labels.
problem Inconsistent alignment of continuous emotion labels with speech signals.
method Convolutional neural network with a multi-delay sinc layer.
result State-of-the-art results in predicting and aligning continuous emotion labels.
Study finds RNNs predict STBG better than ARIMA, useful for diabetes patients.
problem Improving short-term blood glucose prediction for diabetes management.
method Investigated Recurrent Neural Networks (RNNs) and compared them to ARIMA for STBG prediction.
result Population-based RNN model outperforms ARIMA across various prediction horizons.
Develops conformalized prediction intervals for bounded continuous outcomes.
problem Predicting continuous outcomes within bounded ranges, especially when models are misspecified.
method Conformal prediction intervals based on transformation regression models, accounting for heteroscedasticity and asymmetry.
result Valid finite-sample coverage confirmed in simulations and real data applications.
Proposes first method for continuously indexed domain adaptation.
problem Challenges of transferring knowledge between continuously indexed domains.
method Combines adversarial adaptation with a novel discriminator.
result Outperforms state-of-the-art methods on synthetic and real-world datasets.
PARMESAN learns from memory without parameters for fast, efficient continual learning.
problem Inflexibility in deep learning methods for continual learning.
method Transductive reasoning and memory search for parameter-free learning.
result 3-4 orders of magnitude faster than baselines, comparable performance.
Continuous-depth Evoformer reduces protein folding prediction time and resource usage.
problem Efficient protein structure prediction with reduced computational costs.
method Continuous-depth formulation of Evoformer using Neural Ordinary Differential Equations (Neural ODEs).
result The continuous-time Evoformer achieves constant memory cost and improved efficiency.
We quantify causal bias in continuous treatment settings.
problem Identifying and quantifying causal bias in continuous treatment scenarios.
method Developed a novel characterization of causal bias in structural causal models, proving conditions for zero bias and efficient estimation.
result Causal bias can be estimated efficiently under certain structural equation restrictions, allowing for causal regularization of predictive models.
Meta-descent improves online prediction in non-stationary settings.
problem Non-stationary online prediction problems.
method Meta-gradient descent to adapt step-size parameters.
result Meta-descent methods outperform other approaches in non-stationary prediction.
It has long been assumed that high dimensional continuous control problems cannot be solved effectively by discretizing individual dimensions of the action space due to the exponentially large number of bins over which policies would have to be learned. In this paper, we draw inspiration from the recent success of sequ…
ScoreGrad predicts multivariate time series with energy-based models, achieving state-of-the-art results.
problem Predicting multivariate time series with generative models while considering noise and distribution.
method ScoreGrad uses continuous energy-based generative models with a feature extraction and score matching module.
result ScoreGrad achieves state-of-the-art results on six real-world datasets.
In a mixed-traffic scenario where both autonomous vehicles and human-driving vehicles exist, a timely prediction of driving intentions of nearby human-driving vehicles is essential for the safe and efficient driving of an autonomous vehicle. In this paper, a driving intention prediction method based on Hidden Markov Mo…
Daytime hypoglycemia should be accurately predicted to achieve normoglycemia and to avoid disastrous situations. Hypoglycemia, an abnormally low blood glucose level, is divided into daytime hypoglycemia and nocturnal hypoglycemia. Many studies of hypoglycemia prevention deal with nocturnal hypoglycemia. In this paper, …
Study efficient rebalancing strategies for portfolio tracking error.
problem Optimizing portfolio rebalancing under high-frequency asset price models.
method Discrete-time rebalancing strategies derived from continuous model.
result Asymptotically efficient sequence of simple strategies.
Analytic Continuation by Feature Learningcond-mat.str-el
Improved neural network predicts spectral functions more accurately than traditional methods.
problem Reconstructing real-time spectral functions from imaginary-time Green's functions is ill-posed and challenging.
method Feature Learning Network (FL-net) for enhanced prediction accuracy.
result FL-net achieves at least 20% improvement over traditional methods like MEM.
SupRB learns rules for continuous decision problems from examples.
problem Learning from continuous choices and explaining decisions to operators.
method SupRB is a supervised rule-based learning system for multi-dimensional continuous problems.
result SupRB provides human-understandable rules for optimal choices and quality predictions.
DeepMDP simplifies complex observations into continuous latent states.
problem Learning from high-dimensional observations in reinforcement learning.
method Trains a DeepMDP model that predicts rewards and next latent states.
result Optimization of DeepMDP objectives ensures quality of latent space and environment model.
A new emulator connects observables directly from data.
problem Constructing fast and accurate surrogate models for robust predictions.
method Introduces Multiparameter Eigenvalue Problem (MEP) emulator trained with Eigenvector Continuation (EC) and Parametric Matrix Model (PMM) data.
result The MEP emulator can make predictions directly from observables to observables.
This paper tackles delayed feedback in continuous training for CTR prediction, improving model performance by 3%.
problem Delayed feedback in CTR prediction leads to inferior performance and user experience.
method Comparing 5 loss functions and models in offline and online settings.
result Proposed methods outperform previous state-of-the-art by 3% relative cross entropy (RCE).
New method optimizes fairness in predictive models for continuous sensitive attributes.
problem Enforcing full statistical independence on continuous sensitive attributes is too restrictive.
method Functional bilevel optimization (FBO) and ITD algorithms.
result Achieves lowest or near-lowest fairness-accuracy regret on synthetic and real datasets.
Efficient algorithms compute conformal prediction sets for regression problems.
problem Providing strong coverage guarantees for predictions without distributional assumptions.
method Approximate homotopy continuation for convex regularized empirical risk minimization.
result Efficient algorithms to compute conformal prediction sets for regression problems.
Improved Gaussian Process model for predicting trajectories without independence assumption errors.
problem Incorrect independence assumption in previous work on Gaussian Process uncertainty propagation.
method Proposed a novel piecewise linear approximation to correct the independence assumption in continuous models.
result Corrected the independence assumption in Gaussian Process models for predicting trajectories.
Combines CP with stability bounds for efficient continuous prediction.
problem Infeasibility of CP sets for continuous targets.
method Combining CP with stability bounds for a single model fit.
result Efficient continuous prediction with guaranteed coverage.
The utility of learning a dynamics/world model of the environment in reinforcement learning has been shown in a many ways. When using neural networks, however, these models suffer catastrophic forgetting when learned in a lifelong or continual fashion. Current solutions to the continual learning problem require experie…
A new method for interpreting AI models using Shapley value for functional data.
problem Interpreting AI models, especially those based on functional data.
method Proposes an interpretability method based on the Shapley value for continuous games.
result Demonstrates the effectiveness of the method through experiments with simulated and real data.
A new method for Gaussian Processes handles mixed continuous and categorical inputs.
problem Modeling cross-correlations between continuous and categorical data.
method Low-Rank Correlation (LRC) method for Gaussian Processes with flexible rank approximation.
result LRC outperforms existing methods in estimating cross-correlations and predicting response surfaces.
ICP improves prediction intervals for continuous outcomes at lower computational cost.
problem Systematic bias in point predictions that undermines their use in decision-making.
method Develops Isotonic Conformal Prediction (ICP) framework to decouple calibration from prediction-set construction.
result SICP and TICP procedures match SC-CP coverage at lower computational cost.
CatBoostLSS predicts entire conditional distributions for probabilistic forecasting.
problem Limited to predicting only the conditional mean, traditional CatBoost is improved.
method Models all moments of a parametric distribution (mean, location, scale, shape).
result Enhanced flexibility in data analysis and probabilistic forecasting.
Proves solution uniqueness for biomembrane shape prediction.
problem Proving solution uniqueness for the genus one Canham variational problem.
method Combining numeric analytic continuation and singularity analysis to prove non-negativity of a sequence.
result Proves positivity of the sequence, leading to solution uniqueness.
We consider the optimization of an uncertain objective over continuous and multi-dimensional decision spaces in problems in which we are only provided with observational data. We propose a novel algorithmic framework that is tractable, asymptotically consistent, and superior to comparable methods on example problems. O…
PEAKS selects key training examples incrementally based on prediction error and kernel similarity.
problem Dynamic data selection in deep learning models.
method Prediction Error Anchored by Kernel Similarity (PEAKS) for incremental data selection.
result PEAKS outperforms existing selection strategies and yields better performance returns as training data size grows.
Predicts traffic flow using reinforcement learning and sensor data.
problem Accurately predict expanding and evolving long-term streaming traffic networks.
method Formulates the problem as a continuous reinforcement learning task, where the agent predicts future traffic based on sensor data.
result The approach improves accuracy in predicting traffic flow by updating the agent's state representation over time.