Applications in machine learning, optimization, and control require the sequential selection of a few system elements, such as sensors, data, or actuators, to optimize the system performance across multiple time steps. However, in failure-prone and adversarial environments, sensors get attacked, data get deleted, and a…
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,657 papers · 148 categories
Trend · papers per month
48 results for “sequential systems”
Recursive experts improve dynamic sequential learning systems.
problem Adapt to changing environments in sequential learning.
method Design hyper-experts that recursively merge to achieve optimal performance.
result Achieve minimax optimal regret bounds up to constant factors.
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.
We develop a new method to estimate failure probabilities in complex systems.
problem Estimating failure probabilities in safety-critical autonomous systems is challenging due to the rarity of failures and large state spaces.
method We propose an adaptive importance sampling algorithm that minimizes forward Kullback-Leibler divergence and uses Markov score ascent methods.
result Our method provides more accurate failure probability estimates than existing techniques.
New method for evaluating sequential recommendations with lower variance.
problem Evaluating good sequences of music, video, news, and e-commerce recommendations.
method Proposes a new counterfactual estimator for sequential reward interactions with lower variance and asymptotic unbiasedness.
result Our method outperforms existing methods in bias and data efficiency for sequential track recommendations.
Solves selecting the best optimizing system problems.
problem Selecting the best system among contenders with unknown performance.
method Adaptive algorithms integrating stochastic gradient descent and sequential elimination.
result Exponential rates of convergence to zero for false selection probability.
SIM models user interests from long sequential behavior data, improving click-through rate prediction.
problem Challenges in capturing user interests with long user behavior sequences.
method SIM uses a cascaded search paradigm with two units: General Search Unit and Exact Search Unit.
result SIM achieves significant CTR and RPM lifts in Alibaba's display advertising system.
Two-stage risk control for ranked retrieval systems.
problem Assessing prediction uncertainty and risk control in sequential machine learning systems.
method Developed two-stage risk control methods based on LTT and CRC frameworks, leveraging sequential nature of retrieval and ranking phases.
result The proposed methods provide theoretical guarantees and reduce computational burden compared to prior work.
One of the key challenges in identifying nonlinear and possibly non-Gaussian state space models (SSMs) is the intractability of estimating the system state. Sequential Monte Carlo (SMC) methods, such as the particle filter (introduced more than two decades ago), provide numerical solutions to the nonlinear state estima…
A new dataset tracks user interactions and click responses in online marketplaces.
problem Lack of exposure data in recommender systems datasets.
method Proposes a novel dataset including slates and click responses, allowing more accurate likelihood models.
result Models using exposure data show more natural likelihood, reducing bias towards previously exposed items.
Gaussian processes help in modeling complex, nonlinear relationships in signal processing.
problem Modeling complex, nonlinear relationships in signal processing.
method Sequential inference for Gaussian processes.
result Gaussian processes enable efficient and accurate modeling of complex relationships.
Universal preconditioning reduces sequential prediction regret.
problem Improving sequential prediction performance.
method Convolve target sequence with orthogonal polynomial coefficients.
result First sublinear and hidden-dimension-independent regret bounds.
This thesis analyzes MACL systems with low-regret learning algorithms for sequential decision making.
problem Designing efficient learning algorithms for multi-agent cooperative systems to minimize regret.
method Analyzes and develops algorithms for cooperative multi-agent multi-armed bandit problems and online convex optimization in distributed settings.
result Presented regret lower bounds and efficient algorithms for achieving these bounds, providing guidance on communication protocols.
When is Particle Filtering Efficient for Planning in Partially Observed Linear Dynamical Systems?cs.LG
This paper studies when particle filtering is efficient for planning in partially observed systems.
problem The efficiency of particle filtering for planning in partially observed linear dynamical systems.
method Coupling of ideal and approximate sequences to bound particle complexity.
result Polynomially many particles suffice for stable systems to approximate optimal planning.
Context-aware recommender systems (CARSs) apply sensing and analysis of user context in order to provide personalized services. Adding context to a recommendation model is challenging, since the addition of context may increases both the dimensionality and sparsity of the model. Recent research has shown that modeling …
Experimenting, Fast and Slow: Bayesian Optimization of Long-term Outcomes with Online Experimentscs.LG
Bayesian optimization for long-term outcomes using fast and slow experiments.
problem Optimizing long-term system effects with short-term misleading results.
method Combining fast and slow experiments for Bayesian optimization.
result Sequential optimization over large action spaces in a short time.
LEM efficiently models long-term sequences with gradients.
problem Learning long-term sequential dependencies in data.
method Gradient-based multiscale ordinary differential equations system.
result LEM outperforms state-of-the-art models in various tasks.
Improved sequential tests detect anomalies faster in multi-stream auditing.
problem Efficiently auditing machine learning systems across multiple data streams.
method Developed new sequential tests using merging martingales and averaging/products rules.
result Balanced tests achieve optimal stopping times in sparse and dense alternatives.
Study on sequential defaulting in financial networks, analyzing stability and optimal timing.
problem Understanding which banks default and how much they can fulfill in a sequential financial network.
method Sequential model of financial networks, analyzing stability and optimal timing of defaults.
result Stabilization time can heavily depend on the ordering of announcements, and finding the best time for default is NP-hard.
Paper formalizes a reinforcement learning model for complex information structures.
problem Complex interdependence in sequential decision-making problems.
method Formalizes a novel reinforcement learning model with explicit information structure representation.
result Upper bound on sample complexity of learning general sequential decision-making problems.
ComiRec framework predicts user interests for personalized recommendations.
problem Predicting user interests from sequential behavior data.
method ComiRec framework captures multiple user interests and balances recommendation accuracy and diversity.
result ComiRec achieves significant improvements over state-of-the-art models in sequential recommendation.
Sparse Meta Networks for Sequential Adaptation and its Application to Adaptive Language Modellingcs.NE
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.
End-to-end autonomous driving perception learns latent features for better performance.
problem Current autonomous driving systems are complex and require human engineering.
method Sequential latent representation learning for end-to-end perception.
result End-to-end perception model solves detection, tracking, localization, and mapping problems.
Bayesian inference models failure distributions in autonomous systems.
problem Estimating the distribution of failures in complex systems.
method Bayesian inference using system dynamics rollouts and gradient computation.
result Improves sample efficiency and parameter space coverage in autonomous systems.
Gradient-free framework for Bayesian experimental design in complex systems.
problem Optimal experimental design in systems where gradient information is unavailable.
method Combines EKI and ALDI for optimization and sampling, with approximations for scalable utility estimation.
result Demonstrates robust, accurate, and efficient experimental design in various complex systems.
This paper speeds up iterative GP inference with warm starting.
problem Improving scalability of Gaussian process inference.
method Warm starting sequential posteriors using known solutions.
result Significant speed-ups and improved Bayesian optimisation performance.
Sequential or online dimensional reduction is of interests due to the explosion of streaming data based applications and the requirement of adaptive statistical modeling, in many emerging fields, such as the modeling of energy end-use profile. Principal Component Analysis (PCA), is the classical way of dimensional redu…
Adapts MBDOE for real-time parameter estimation in complex systems.
problem Costly posterior inference and design optimization in nonlinear systems.
method Combines DAD with differentiable mechanistic models for real-time parameter estimation.
result Demonstrated on four systems, including a DC motor.
Study on learning to predict dynamical systems without assuming their structure.
problem Learning to predict the next state of a dynamical system with unknown evolution function.
method Defined new combinatorial measures to quantify mistake and regret bounds in realizable and agnostic settings.
result In the realizable setting, the number of mistakes can grow arbitrarily with time.
New algorithm for sequential off-policy learning improves performance over batch methods.
problem Training policies from logged interaction data in a sequential setting.
method Combines Logarithmic Smoothing with online PAC-Bayesian tools.
result Improves performance and accelerates convergence in sequential off-policy learning.
AI system narrows human decision options for better outcomes.
problem Improving human decision-making in sequential tasks.
method Developed a decision support system using a pre-trained AI agent to limit human action choices.
result Participants outperformed AI and solo play in a wildfire mitigation game.
Novel approach to Bayesian experimental design for non-exchangeable data.
problem Optimal experimental design for non-exchangeable data.
method Inside-Out SMC algorithm embedded in particle Markov chain Monte Carlo framework.
result Efficacy demonstrated on a set of dynamical systems.
REN addresses uncertainty in user feedbacks for better recommendation systems.
problem Recurrent neural networks focus solely on item relevance, neglecting diverse item exploration.
method Proposes REN, a new type of recurrent neural network that balances relevance and exploration while accounting for representation uncertainty.
result REN achieves satisfactory long-term rewards on synthetic and real-world recommendation datasets, outperforming state-of-the-art models.
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.
System detects financial misinformation and generates clear explanations.
problem Identifying and explaining fraudulent financial content.
method Combined large language models, pre-processing, and sequential learning.
result Achieved F1-score of 0.8283 for classification and ROUGE-1 of 0.7253 for explanations.
BCI system improves word selection efficiency using sequential best-arm identification.
problem Conventional non-adaptive BCI paradigms lead to a lengthy learning process.
method Casted as sequence of best-arm identification tasks in multi-armed bandits, using pre-trained LLMs and STTS algorithm.
result Substantial empirical improvement in word selection efficiency demonstrated.
Most of Markov Chain Monte Carlo (MCMC) and sequential Monte Carlo (SMC) algorithms in existing probabilistic programming systems suboptimally use only model priors as proposal distributions. In this work, we describe an approach for training a discriminative model, namely a neural network, in order to approximate the …
Proposes using frequent sequences to improve sequential recommendation models.
problem Combining user history and recent actions for personalized recommendations.
method Uses frequent sequences to identify relevant parts of user history, embedding items based on preferences and dynamics in a unified metric model.
result Outperforms state-of-the-art methods, especially on sparse datasets.
This paper enhances privacy in statistical model checking of cyber-physical systems.
problem Privacy concerns in consumer-level applications due to statistical model checking.
method Proposes expected differential privacy and a new exponential mechanism for sequential algorithms.
result Demonstrates a novel mechanism to preserve privacy in statistical model checking.
DiPS learns to optimize sketching policies for better recommendation quality.
problem Optimizing sketching policies for long-term user interest prediction in recommender systems.
method Differentiable policy for sketching that learns from training data.
result DiPS requires up to 50% fewer sketch items to achieve the same recommendation quality.
This work extends identifiability analysis to sequential latent variable models, focusing on Switching Dynamical Systems.
problem Identifying latent variables in sequential data models.
method Proved identifiability of Markov Switching Models and established conditions for Switching Dynamical Systems.
result Identifiability of latent variables and non-linear mappings in Switching Dynamical Systems up to affine transformations.
This work addresses identifiability in sequential data with switching dynamics, introducing a new estimator.
problem Identifiability of sequential data with regime-switching dynamics under flexible assumptions.
method Introduces SDS, a flow-based estimator for exact likelihood optimization.
result Demonstrates improved disentanglement and more accurate forecasting compared to VAE-based estimators.
Study optimal control in unknown nonlinear systems with near-optimal regret bound.
problem Sequential control in unknown, nonlinear dynamical systems.
method LC^3 algorithm, based on information theory.
result Near-optimal regret bound for episodic settings.
Generative adversarial network for probabilistic forecasting of random systems.
problem Forecasting random dynamical systems without distributional assumptions.
method Recurrent neural network and generative adversarial network (GAN) with regularization based on maximum mean discrepancy (MMD).
result The proposed model successfully forecasts complex stochastic processes with multiple-step predictions.
We propose RecSim, a configurable platform for authoring simulation environments for recommender systems (RSs) that naturally supports sequential interaction with users. RecSim allows the creation of new environments that reflect particular aspects of user behavior and item structure at a level of abstraction well-suit…
Models of complex systems are often formalized as sequential software simulators: computationally intensive programs that iteratively build up probable system configurations given parameters and initial conditions. These simulators enable modelers to capture effects that are difficult to characterize analytically or su…
A computer code can simulate a system's propagation of variation from random inputs to output measures of quality. Our aim here is to estimate a critical output tail probability or quantile without a large Monte Carlo experiment. Instead, we build a statistical surrogate for the input-output relationship with a modest …
DCBO optimizes interventions in evolving causal systems.
problem Optimal interventions in time-varying causal systems.
method Combines sequential decision making, causal inference, and GP emulation.
result DCBO identifies optimal interventions faster than competitors.