New rule universally consistent for online learning with non-ergodic data.
problem Online learning with non-ergodic data processes.
method Developed an online learning rule for processes on (X,Y) pairs.
result Generalizes past results to non-ergodic processes on (X,Y).
Paper benchmarks machine learning for detecting process curve drifts.
problem Detecting drifts in multivariate manufacturing process data.
method Synthetic data generation and evaluation score introduction.
result Existing algorithms often fail with complex drift scenarios.
Deep learning outperforms traditional methods in estimating OU process parameters.
problem Parameter estimation of the Ornstein-Uhlenbeck process is challenging.
method Used a multi-layer perceptron to estimate OU process parameters compared to traditional methods like Kalman filter and maximum likelihood estimation.
result Deep learning method outperforms traditional methods in parameter estimation of the OU process.
New method learns stochastic process representations without exact reconstruction.
problem Learning exact representations of high-dimensional noisy stochastic processes.
method CReSP framework for contrastive learning of stochastic processes.
result Effective for learning representations of various stochastic processes.
New learnability criteria for non-iid processes equivalent to online learning.
problem Statistical learning under non-iid stochastic processes is underdeveloped.
method Defined two learnability notions and showed their equivalence to online learning.
result Learnability criteria for non-iid processes are equivalent to online learning.
Unified reinforcement learning and stochastic processes with action-driven processes.
problem Combining reinforcement learning and stochastic processes for efficient control.
method Action-driven processes, leveraging control-as-inference, and minimizing Kullback-Leibler divergence.
result Action-driven processes unify reinforcement learning and stochastic processes, equivalent to maximum entropy reinforcement learning.
New model improves field learning with improved equivariance.
problem Learning equivariant stochastic fields.
method Equivariant Gaussian processes and Steerable Conditional Neural Processes.
result SteerCNPs significantly improve performance in transfer learning tasks.
Predicting business process behaviour is an important aspect of business process management. Motivated by research in natural language processing, this paper describes an application of deep learning with recurrent neural networks to the problem of predicting the next event in a business process. This is both a novel m…
Meta-learn sparse Gaussian process inference for faster predictions.
problem Cubic computational cost of exact Gaussian process inference for many observations.
method Meta-learn sparse Gaussian process inference.
result Rapid prediction on new tasks with sparse Gaussian processes.
AI learns to design chemical processes efficiently.
problem Designing efficient chemical processes.
method Hierarchical reinforcement learning and graph neural networks.
result Quick learning in various decision spaces.
We present a multi-task learning formulation for Deep Gaussian processes (DGPs), through non-linear mixtures of latent processes. The latent space is composed of private processes that capture within-task information and shared processes that capture across-task dependencies. We propose two different methods for segmen…
New algorithm learns bridged diffusion processes without time-reversals.
problem Learning bridged diffusion processes efficiently and accurately.
method Score matching with Doob's h-transform, avoiding time-reversals.
result Outperforms existing methods in learning bridged diffusion processes.
Deep RL optimizes processing paths to desired material structures.
problem Optimizing processing paths to achieve desired material properties.
method Deep reinforcement learning guided by structure representations and reward signals.
result Algorithm learns to find optimal paths to target structures in material space.
This paper applies AMP theory to improve learning tasks.
problem Improving learning efficiency by optimizing task-specific models.
method Uses aggregated Markov processes to reduce model complexity and enhance learning.
result Demonstrates how AMP theory can be effectively applied to stochastic learning.
A new process model for machine learning applications with quality assurance.
problem Lack of standard process model for machine learning applications.
method Six-phase process model with quality assurance methodology.
result Proposes a new process model for machine learning applications.
This paper investigates the supervised learning problem with observations drawn from certain general stationary stochastic processes. Here by \emph{general}, we mean that many stationary stochastic processes can be included. We show that when the stochastic processes satisfy a generalized Bernstein-type inequality, a u…
Paper reveals hidden convexities in deep learning models using sparse signal processing.
problem Non-convex loss functions in deep learning models complicate optimization and theoretical understanding.
method Developed convex equivalences of ReLU NNs and their connections to sparse signal processing models.
result Recent research has uncovered hidden convexities in certain NN architectures, notably two-layer ReLU networks and other architectures.
Quantum Gaussian processes enable scalable quantum learning.
problem Lack of simple, interpretable, scalable learning frameworks for quantum data.
method Bayesian framework using Gaussian processes with quantum kernels.
result Provable and scalable quantum Gaussian processes for quantum learning.
Paper proposes a new method for learning business process representations.
problem Challenges in capturing all useful information in business process data.
method Combines Gramian Angular Fields and Convolutional Neural Networks for representation learning.
result Demonstrates effectiveness of the approach through visualization and multiple process prediction tasks.
A new method uses active learning to monitor industrial processes more accurately.
problem Classifying process states (IC, OC) with limited labeled data.
method Stream-based active learning for partially hidden Markov models.
result Improved dynamic recognition of process states, especially unseen classes.
Learning Granger causality for general point processes is a very challenging task. In this paper, we propose an effective method, learning Granger causality, for a special but significant type of point processes --- Hawkes process. We reveal the relationship between Hawkes process's impact function and its Granger caus…
Quantum computing improves fault diagnosis in industrial processes.
problem Fault detection and diagnosis in industrial process systems.
method Integrates quantum computing and deep learning to extract features and diagnose faults.
result Quantum-assisted deep learning achieves high fault detection rates (79.2% and 99.39%).
Graph Gaussian processes use Matérn models for better function learning.
problem Lack of Gaussian process models for graph input spaces.
method Stochastic partial differential equation characterization of Matérn Gaussian processes.
result Graph Matérn Gaussian processes inherit properties of Euclidean and Riemannian models and can be trained efficiently.
NDPs learn to sample from complex function distributions using neural networks and diffusion models.
problem Learning rich distributions over functions with neural networks.
method NDPs use denoising diffusion models and custom attention blocks to incorporate stochastic process properties.
result NDPs can capture functional distributions close to true Bayesian posteriors and outperform neural processes.
Study online learning of quantum processes, showing feasibility for certain types.
problem Learning quantum processes adaptively, especially for bounded gate complexity and Pauli channels.
method Online learning, mistake-bounded model, multiplicative weights update algorithm, Bell sampling.
result Online learning feasible for quantum channels of bounded gate complexity and Pauli channels.
Study proposes a novel local explanation method for deep learning classifiers in process mining.
problem Lack of interpretability in deep learning models for process mining.
method Defines local regions using latent space representations and visualizes explanations.
result Deep learning classifier achieves high performance and local explanations increase user trust.
Graph signal processing improves machine learning for network data.
problem Handling structured data on graphs in machine learning.
method Graph filters and transforms for efficient data processing.
result Enhanced model interpretability and improved efficiency.
Gaussian processes are used in machine learning to learn input-output mappings from observed data. Gaussian process regression is based on imposing a Gaussian process prior on the unknown regressor function and statistically conditioning it on the observed data. In system identification, Gaussian processes are used to …
Reduces bounded loss learning to binary classification.
problem Universal consistency of non-i.i.d. processes with bounded loss.
method Constructive reduction to binary classification.
result Any bounded loss output setting can be reduced to binary classification.
BNP extends Neural Processes using bootstrap to better model uncertainty.
problem Limitation of NP in modeling stochastic processes with a single latent variable.
method Introduces BNP by incorporating bootstrap to estimate uncertainty without assuming a specific form.
result Demonstrates improved flexibility and robustness of BNP on various data types.
Paper introduces statistical learning for point processes.
problem Statistical learning for point processes in general spaces.
method Combines bivariate innovations and point process cross-validation.
result Statistical learning approach outperforms state of the art.
A green simulation-assisted reinforcement learning method for biomanufacturing.
problem Complexity, high variability, lead time, and limited historical data in biopharmaceutical manufacturing.
method Quantifies model risk, uses posterior distribution, and selectively reuses simulation data.
result Demonstrates promising performance in online learning and decision making.
Active learning improves GP regression on complex, high-dimensional data.
problem Improving Gaussian Process regression in high-dimensional spaces with discontinuous functions.
method Combines manifold learning with active learning to optimize data selection and reduce dimensionality.
result Superior performance over random learning in synthetic data experiments.
This paper tackles federated learning for automatic latent variable selection in multi-output Gaussian processes.
problem Challenges in determining the adequate number of latent processes and relying on centralized learning for privacy and computational issues.
method Proposes a hierarchical model with spike-and-slab priors for automatic latent process selection and variational inference-based federated learning algorithm.
result Demonstrates the advantageous features of the proposed federated approach through simulations and real-world data.
This work uses stochastic geometry to improve STIT processes in machine learning.
problem Improving STIT processes for efficient and consistent machine learning applications.
method Utilizing tools from stochastic geometry to characterize kernels and obtain consistency results.
result Generalization of STIT processes and their kernels, leading to improved machine learning methods.
Bayesian approach uses Gaussian process for reinforcement learning.
problem Robotic locomotion environments
method Bayesian actor-critic, model-free reinforcement learning with Gaussian process for exploration and policy optimization.
result Gaussian process method outperforms current algorithms in robotic locomotion environments.
Batch Active Learning uses derivative information for Gaussian Process regression.
problem Efficiently selecting data batches in Gaussian Process regression models.
method Proposes using the predictive covariance matrix to select data batches, exploiting full correlation.
result Demonstrates the effectiveness of incorporating derivative information across diverse applications.
Learning the influence structure of multiple time series data is of great interest to many disciplines. This paper studies the problem of recovering the causal structure in network of multivariate linear Hawkes processes. In such processes, the occurrence of an event in one process affects the probability of occurrence…
New active learning methods for Gaussian process improve predictive modeling of composite fuselage.
problem Improving predictive modeling of composite fuselage with limited training samples and uncertainties.
method Proposed two new active learning algorithms for Gaussian process considering uncertainties.
result The proposed approach realizes better prediction performance for automatic shape control of composite fuselage.
Model separates overall uncertainty into aleatoric and epistemic components for active learning.
problem Active learning with uncertainty quantification.
method Non-stationary Heteroscedastic Gaussian process model.
result Model separates overall uncertainty into aleatoric and epistemic components.
Improved sample efficiency in reinforcement learning with deep Gaussian processes.
problem Efficiently learn to control actions with limited interaction data.
method Deep Gaussian processes that simulate dynamics with depth and prior knowledge.
result Significantly improved early sample efficiency across various tasks, including half-cheetah control.
SkyGP improves Gaussian process scalability for real-time learning.
problem Scalability issues with exact Gaussian processes for streaming data.
method Streaming kernel-induced progressively generated Gaussian process experts (SkyGP).
result SkyGP maintains performance guarantees while improving scalability.
UNHaP removes noise from physiological events using Hawkes processes.
problem Challenges in identifying true events from spurious ones in physiological signal analysis.
method UNHaP uses marked Hawkes processes to distinguish and unmix true events from noise.
result UNHaP significantly reduces false detection rates and enhances event understanding.
We tackle the problem of multi-task learning with copula process. Multivariable prediction in spatial and spatial-temporal processes such as natural resource estimation and pollution monitoring have been typically addressed using techniques based on Gaussian processes and co-Kriging. While the Gaussian prior assumption…
VMGP extends Gaussian processes for Bayesian meta-learning, improving uncertainty prediction.
problem Bayesian meta-learning for few-shot tasks with non-Gaussian uncertainty.
method VMGP (Variational Meta-Gaussian Processes) extends Gaussian processes to model non-Gaussian predictive posteriors.
result VMGP significantly outperforms existing Bayesian meta-learning methods on complex tasks.
Deep learning improves analysis of complex natural processes.
problem Simplistic dynamics in regression analyses of complex natural processes.
method Flexible function approximation using deep learning, relaxing standard assumptions.
result Substantial improvements in behavioral and neuroimaging data.
Study differentially private methods for learning Hawkes processes.
problem Lack of thorough analysis on sample complexity for learning Hawkes processes parameters and releasing differentially private versions.
method Developed non-private and differentially private estimators for Hawkes processes parameters.
result Obtained sample complexity results for both private and non-private settings.
Proposes FairRR to improve fairness in machine learning models through randomized response.
problem Achieving group fairness in machine learning models.
method Formulates group fairness as optimizing a design matrix in Randomized Response, proposing FairRR.
result Demonstrates FairRR yields excellent model utility and fairness.