🏢 University of Warwick
What makes unlearning hard and what to do about it
·5453 words·26 mins·
loading
·
loading
AI Theory
Interpretability
🏢 University of Warwick
Researchers developed RUM, a refined unlearning meta-algorithm, that significantly improves existing unlearning methods by strategically refining forget sets and employing appropriate unlearning algor…
Symmetric Linear Bandits with Hidden Symmetry
·1466 words·7 mins·
loading
·
loading
Machine Learning
Reinforcement Learning
🏢 University of Warwick
Researchers unveil a novel algorithm for high-dimensional symmetric linear bandits, achieving a regret bound of O(d^(2/3)T^(2/3)log(d)), surpassing limitations of existing approaches that assume expli…
SARAD: Spatial Association-Aware Anomaly Detection and Diagnosis for Multivariate Time Series
·3459 words·17 mins·
loading
·
loading
Machine Learning
Deep Learning
🏢 University of Warwick
SARAD: A novel anomaly detection approach for multivariate time series leverages spatial information and association reduction patterns to achieve state-of-the-art performance.
Quasi-Bayes meets Vines
·2473 words·12 mins·
loading
·
loading
AI Generated
Machine Learning
Deep Learning
🏢 University of Warwick
Quasi-Bayesian Vine (QB-Vine) efficiently models high-dimensional densities by recursively updating 1D marginal predictives and a vine copula, significantly outperforming state-of-the-art methods.
Physics-Informed Variational State-Space Gaussian Processes
·1537 words·8 mins·
loading
·
loading
Machine Learning
Deep Learning
🏢 University of Warwick
PHYSS-GP: a novel physics-informed state-space Gaussian process model for efficient spatio-temporal data modeling, outperforming existing methods in predictive accuracy and computational speed.
Particle Semi-Implicit Variational Inference
·1634 words·8 mins·
loading
·
loading
🏢 University of Warwick
Particle Variational Inference (PVI) revolutionizes semi-implicit variational inference by directly optimizing the ELBO using a novel particle approximation, improving efficiency and expressiveness ov…
Learning the Expected Core of Strictly Convex Stochastic Cooperative Games
·1497 words·8 mins·
loading
·
loading
AI Theory
Optimization
🏢 University of Warwick
A novel Common-Points-Picking algorithm efficiently learns stable reward allocations (expected core) in strictly convex stochastic cooperative games with unknown reward distributions, achieving high p…
An Analysis of Elo Rating Systems via Markov Chains
·2046 words·10 mins·
loading
·
loading
AI Generated
AI Theory
Optimization
🏢 University of Warwick
Elo rating system’s convergence rigorously analyzed via Markov chains under the Bradley-Terry-Luce model, demonstrating competitive learning rates and informing efficient tournament design.