New probabilistic linear multistep methods derived from Gaussian processes.
problem Solving ordinary differential equations with probabilistic approaches.
method Adams-Bashforth and Adams-Moulton family of linear multistep methods derived from Gaussian process framework.
result Probabilistic versions of deterministic methods converge to the exact solution and local truncation error.
A deep learning model predicts traffic conditions over multiple steps.
problem Multistep traffic forecasting on road networks.
method Attention Graph Convolutional Sequence-to-Sequence model (AGC-Seq2Seq) with attention mechanism.
result AGC-Seq2Seq model outperforms other models in multistep traffic prediction.
Unified model improves sampling speed and quality.
problem Difficult to balance sampling speed and quality.
method Multistep Consistency Models combining consistency and diffusion models.
result Improved sampling quality with reduced steps.
Combines LSTM and medians for accurate multistep time series prediction.
problem Accurate multistep time series forecasting for web traffic.
method Uses LSTM for long-term trends and medians for seasonality in multiple time series.
result Improves forecasting accuracy compared to using only LSTM or medians alone.
Investor finds a fair outcome in complex financial markets.
problem Finding a fair outcome in complex financial markets.
method Recalled and proved the existence of personal equilibrium in a multistep, generically incomplete financial market model.
result Personal equilibrium exists in a multistep, generically incomplete financial market model under appropriate assumptions.
BCD-prox improves robustness and accuracy in filtering and parameter estimation.
problem Simultaneous filtering and parameter estimation of complex ODE models.
method Block coordinate descent proximal algorithm (BCD-prox) for ODE systems.
result BCD-prox outperforms state-of-the-art methods in robustness, accuracy, and training time.
Paper analyzes biased stochastic approximation with a novel multistep Lyapunov function.
problem Finite-time analysis of biased stochastic approximation algorithms.
method Developed a multistep Lyapunov function to analyze convergence and error bounds.
result First finite-time error bounds for TD- and Q-learning with linear function approximation.
We study multistep Bayesian betting strategies in coin-tossing games in the framework of game-theoretic probability of Shafer and Vovk (2001). We show that by a countable mixture of these strategies, a gambler or an investor can exploit arbitrary patterns of deviations of nature's moves from independent Bernoulli trial…
Continuous semi-implicit models enable faster training and better performance in generative modeling.
problem Slow convergence in hierarchical semi-implicit models during training.
method CoSIM, a continuous semi-implicit model that incorporates a continuous transition kernel for efficient training.
result CoSIM achieves superior performance on image generation tasks compared to existing methods.
New methods improve deep reinforcement learning by accelerating credit assignment.
problem Challenges in achieving fast and stable off-policy learning in deep reinforcement learning.
method Extends the generalized PBE objective to support multistep credit assignment and derives three gradient-based methods.
result Proposed methods outperform PPO and StreamQ in MuJoCo and MinAtar environments.
RNF learns distinct representations for Bayesian filtering steps, improving time series prediction accuracy and uncertainty.
problem Improving time series prediction accuracy and uncertainty using distinct representations for Bayesian filtering steps.
method Introduces Recurrent Neural Filter (RNF) architecture that learns distinct representations for each Bayesian filtering step.
result RNF improves accuracy of one-step-ahead forecasts and provides realistic uncertainty estimates.
The study forecasts, reconstructs, and selects features of ocean waves using neural networks.
problem Forecasting, reconstructing, and feature selection of ocean waves.
method Recurrent and sequence-to-sequence neural networks, Bayesian hyperparameter optimization, Elastic Net method.
result Proposed methods outperform alternatives in significant wave height reconstruction.
New method for pricing options in stochastic volatility models.
problem Pricing options in models with stochastic volatility.
method Time-adaptive, high-order compact finite difference scheme.
result Extends fourth-order multistep methods to stochastic volatility models.
A new machine learning method for Bayesian inverse problems in function spaces.
problem Bayesian inverse problems in function spaces with incompatibility of white noise sources.
method One-step generative transport with amortized neural operator and prior-aligned Gaussian random field.
result Generative operator trained on prior samples and noisy observations generates posterior samples efficiently.
New method reduces PDE model parameters by 30% with sparsity.
problem Redundant parameters in neural network projections.
method Bregman iterations for sparsity, POD compression, bias propagation.
result 30% fewer parameters with similar accuracy.
Proposes a graph neural network for traffic forecasting in WANs.
problem Traffic forecasting challenges in WANs due to dynamic and large data volumes.
method Dynamic diffusion convolutional recurrent neural networks for multistep traffic forecasting.
result Significant improvements in forecasting accuracy compared to classical methods.
COLoKe adapts Koopman embeddings online, reducing overfitting and improving long-term predictions.
problem Online adaptation of Koopman embeddings to avoid overfitting and maintain long-term predictive accuracy.
method Combines deep feature learning with multistep prediction consistency in a lifted space, using a conformal-style mechanism for selective updates.
result Empirically effective in reducing overfitting and maintaining long-term predictive accuracy.
Proposes exact inference for continuous-time Gaussian process dynamics.
problem Inexact inference methods for continuous-time Gaussian process dynamics are impractical for irregularly-sampled data.
method Uses higher-order numerical integrators to discretize dynamics with arbitrary accuracy and proposes multistep and Taylor integrators for exact inference.
result Demonstrates accurate representation of continuous-time systems through exact GP inference.
New algorithm solves complex equations using deep learning.
problem High-dimensional nonlinear PDEs and BSDEs.
method Iterated time discretization, deep neural networks, stochastic gradient descent.
result Increased accuracy and reduced complexity compared to existing methods.
Generative models for complex stochastic dynamics using adversarial learning.
problem Data-driven modeling of multistep stochastic dynamics.
method Adversarial learning with GANs and MMD for stable model classes.
result Stable generative models for long-time prediction and stochastic systems.
New RNA scheme accelerates gradient methods online and improves convergence.
problem Improving convergence rates of gradient methods.
method Adapting Regularized Nonlinear Acceleration (RNA) to handle faster multistep algorithms.
result Optimal complexity bounds and asymptotically optimal rates for convex minimization problems.
RESIST improves decentralized learning resilience against MITM attacks.
problem Decentralized learning's vulnerability to MITM attacks.
method Multistep consensus gradient descent framework with robust statistics-based screening methods.
result Achieves algorithmic and statistical convergence for various ERM problems.
Proposes an efficient method for GPLVM with arbitrary kernels.
problem GPLVM's limitation with standard kernel functions and computational bottlenecks.
method Uses the unscented transformation to handle arbitrary kernels efficiently.
result Comparable or better performance with linear computational complexity.
The study proposes using TD error for selecting σ in Q(σ, λ).
problem Selecting the value of σ in Q(σ, λ) based on state characteristics.
method TD error as a heuristic for selecting σ.
result TD error can effectively select σ based on state characteristics.
Paper introduces differential privacy for sparse classification learning.
problem Privacy-preserving sparse classification learning.
method Differential privacy via ADMM with exponential noise addition.
result Proposes a privacy-preserving logistic regression algorithm.
New model reduces volatility parameters and complexity.
problem Accurately modeling multivariate volatility with network structure.
method Introduces a new multivariate volatility model using both low and high-frequency data.
result The model significantly reduces parameter count and computational complexity.
Proposes DPGN for integrating physics knowledge into graph networks for climate prediction.
problem Lack of explicit physics knowledge in deep neural networks.
method Integrates implicit physics knowledge from domain experts into latent space of DPGN.
result Significant improvement in climate prediction tasks.
A new Bayesian method optimizes time-dependent expensive functions with lookahead.
problem Maximizing a time-dependent, expensive oracle with limited evaluations.
method Recursive, two-step lookahead expected payoff (r2LEY) acquisition function.
result r2LEY outperforms myopic methods in synthetic and real-world datasets.
Infomap reveals modular patterns in complex systems' higher-order flows.
problem Understanding complex systems' dynamical patterns through higher-order network flows.
method Unified sparse memory networks and the Infomap algorithm.
result Infomap identifies overlapping and nested flow modules in various higher-order interactions.
Improves neural network estimates using IFs without needing more data.
problem Bias and lack of flexibility in neural network models.
method MultiNet and MultiStep methods using Influence Functions.
result Improves model robustness and facilitates statistical inference without additional data.
Deep learning framework predicts streamflow and flood probabilities in Australian catchments.
problem Large-scale flooding prediction challenges due to model calibration and missing data.
method Ensemble quantile-based deep learning framework using quantile regression and CAMELS dataset.
result Notable efficacy and uncertainties in streamflow forecasts with varied catchment properties.
We examine how the most prevalent stochastic properties of key financial time series have been affected during the recent financial crises. In particular we focus on changes associated with the remarkable economic events of the last two decades in the mean and volatility dynamics, including the underlying volatility pe…
This work uses neural networks and time-stepping to discover nonlinear dynamics from data.
problem Automating the creation of predictive models from large data sets.
method Combining neural networks with multi-step time-stepping schemes.
result Accurately learned dynamics, future state forecasting, and basin of attraction identification.
Paper constructs moving frame for centroaffine curves to identify and analyze polygon flows.
problem Discriminate and analyze stability of polygon flows.
method Constructs moving frame and invariants for discrete centroaffine curves using centroaffine curvatures and torsions.
result Identifies stable and periodically stable discrete curves using centroaffine curvatures and torsions.
Consistency models generate high-quality samples fast and without iterative sampling.
problem Slow generation in diffusion models.
method Direct mapping of noise to data, supporting fast one-step generation and multistep sampling.
result Consistency models achieve state-of-the-art FID scores and outperform diffusion models in one-step generation.
Paper analyzes meromorphic (1,0)-forms on compact Riemann surfaces.
problem Analyzing meromorphic (1,0)-forms on compact Riemann surfaces.
method Algebro-geometric approach using Riemann-Roch theorem and group theory.
result Every non-constant meromorphic function on a compact Riemann surface of genus 0 has the same number of zeros and poles.
Few-step protein backbone generators reduce sampling time by over 20x.
problem Computational bottleneck in diffusion-based protein generation models.
method Score distillation adapted for protein backbone generation, combined with inference time noise modulation.
result Significant reduction in sampling time (20+ fold) while maintaining comparable performance.
Framework improves clinical timeline reconstruction from text and tables.
problem Temporal precision and event timing in clinical narratives and EHRs.
method Retrieval-augmented multimodal alignment framework.
result Consistently improves absolute timestamp accuracy and temporal concordance.
The paper addresses Dyna-style RL's value hallucination issue by proposing a new algorithm.
problem Value hallucination in Dyna-style RL due to bootstrapping simulated states.
method Introduces a new Dyna algorithm using predecessor models with multi-step updates.
result Evidence supports the Hallucinated Value Hypothesis (HVH), suggesting predecessor models with multi-step updates are promising.
While computer and communication technologies have provided effective means to scale up many aspects of education, the submission and grading of assessments such as homework assignments and tests remains a weak link. In this paper, we study the problem of automatically grading the kinds of open response mathematical qu…
Yu. I. Merzljakov developed a method of splittable coordinates which helps to verify the linearity of some groups, he established some fundamental results using this method. In this paper we use the method of splittable coordinates and find some sufficient condition under which the semi--direct product of two linear gr…
Paper presents a machine learning method to improve significance tests for misspecified linear models.
problem Misspecification of linear assumptions in social science models leads to inaccurate significance levels.
method Apply machine learning to fit ground truth function, calculate linear approximation, and adjust the estimator.
result The method significantly outperforms linear regression for non-linear ground truth functions.
Kernel methods estimate system matrices in linear systems theory.
problem Estimating system matrices in linear dynamical systems.
method Learning theory applied to state space of linear systems.
result Illustrated via numerical examples, kernel methods can stabilize systems.
Develops fast approximations for conditional Shapley values in linear and polynomial models.
problem Estimating conditional Shapley values using regression models is computationally expensive.
method A new approximative estimation method for conditional Shapley values using linear and polynomial regression models.
result Our method significantly reduces computation time compared to existing methods.
Linearized probit regression matches nonlinear methods in accuracy.
problem Binary regression accuracy with nonlinear methods.
method Linearizing probit model with linear estimators.
result Linearized estimators perform similarly to nonlinear methods.
Policy gradient methods achieve linear convergence in simple MDPs.
problem Analyzing convergence rates of policy gradient methods in finite MDPs.
method Connections with policy iteration to show linear convergence with large step-sizes.
result Policy gradient methods succeed with large step-sizes and achieve linear rate of convergence.
Study derivative-free methods for linear policies in linear-quadratic systems.
problem Optimizing policies in linear-quadratic systems with limited derivative information.
method Derivative-free methods applied to linear policies over various noise and reward feedback settings.
result These methods converge to near-optimal policies with a polynomial number of zero-order evaluations.
This work connects LLE, factor analysis, and probabilistic PCA through a stochastic perspective.
problem Exploring the theoretical connection between LLE, factor analysis, and probabilistic PCA.
method Solving the stochastic linear reconstruction of LLE using expectation maximization.
result LLE, factor analysis, and probabilistic PCA are shown to be connected through a stochastic perspective.