Image de couverture de livre

High Probability Latency Sequential Change Detection over an Unknown Finite Horizon

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Huang, Yu-Han, Veeravalli, Venugopal V.
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Systems and Control Statistics Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Sequential Change Detection for Learning in Piecewise Stationary Bandit Environments
par: Huang, Yu-Han, et autres
Publié: (2025)

A Simple Geometric Proof of the Optimality of the Sequential Probability Ratio Test for Symmetric Bernoulli Hypotheses
par: Pabbaraju, Chirag, et autres
Publié: (2025)

Robust Online Sampling from Possibly Moving Target Distributions
par: Clément, François, et autres
Publié: (2025)

Asymptotically Optimal Sequential Testing with Heterogeneous LLMs
par: Li, Guokai, et autres
Publié: (2026)

Finite-Horizon Quickest Change Detection Balancing Latency with False Alarm Probability
par: Huang, Yu-Han, et autres
Publié: (2025)

Linear Regression with Unknown Truncation Beyond Gaussian Features
par: Kouridakis, Alexandros, et autres
Publié: (2026)

Probability Tools for Sequential Random Projection
par: Li, Yingru
Publié: (2024)

Minimax optimal testing by classification
par: Gerber, Patrik Róbert, et autres
Publié: (2023)

Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel
par: Gupta, Shivam, et autres
Publié: (2024)

Robustly Learning Single-Index Models via Alignment Sharpness
par: Zarifis, Nikos, et autres
Publié: (2024)

Separating Oblivious and Adaptive Models of Variable Selection
par: Chen, Ziyun, et autres
Publié: (2026)

Breaking the Heavy-Tailed Noise Barrier in Stochastic Optimization Problems
par: Puchkin, Nikita, et autres
Publié: (2023)

Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians
par: Lee, Jane H., et autres
Publié: (2024)

Attainability of Two-Point Testing Rates for Finite-Sample Location Estimation
par: Compton, Spencer, et autres
Publié: (2025)

Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph
par: Yu, Xifan, et autres
Publié: (2024)

Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime
par: Chen, Guanyi, et autres
Publié: (2025)

Accurate Analysis of Sparse Random Projections
par: Skórski, Maciej
Publié: (2024)

The Power of Two Matrices in Spectral Algorithms for Community Recovery
par: Dhara, Souvik, et autres
Publié: (2022)

Optimum Noise Mechanism for Differentially Private Queries in Discrete Finite Sets
par: Kadam, Sachin, et autres
Publié: (2021)

A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
par: Van Over, Brandon, et autres
Publié: (2024)

On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
par: Li, Bowen, et autres
Publié: (2024)

Adaptive control of dynamic networks
par: Pan, Chunyu, et autres
Publié: (2023)

Computational Complexity Analysis of Interval Methods in Solving Uncertain Nonlinear Systems
par: Prakash, Rudra, et autres
Publié: (2026)

Entangled Mean Estimation in High-Dimensions
par: Diakonikolas, Ilias, et autres
Publié: (2025)

Computing High-dimensional Confidence Sets for Arbitrary Distributions
par: Gao, Chao, et autres
Publié: (2025)

High-dimensional estimation with missing data: Statistical and computational limits
par: Verchand, Kabir Aladin, et autres
Publié: (2026)

High-Dimensional Gaussian Mean Estimation under Realizable Contamination
par: Diakonikolas, Ilias, et autres
Publié: (2026)

Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Faster algorithms for the alignment of sparse correlated Erdös-Rényi random graphs
par: Muratori, Andrea, et autres
Publié: (2024)

Exact threshold for approximate ellipsoid fitting of random points
par: Bandeira, Afonso S., et autres
Publié: (2023)

Fitting an ellipsoid to random points: predictions using the replica method
par: Maillard, Antoine, et autres
Publié: (2023)

Stable Algorithms Lower Bounds for Estimation
par: Yu, Xifan, et autres
Publié: (2026)

On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule
par: Chen, Zongchen, et autres
Publié: (2024)

Random Multi-Type Spanning Forests for Synchronization on Sparse Graphs
par: Jaquard, Hugo, et autres
Publié: (2024)

On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem
par: Lovig, Maxwell, et autres
Publié: (2024)

The Conflict Graph Design: Estimating Causal Effects under Arbitrary Neighborhood Interference
par: Kandiros, Vardis, et autres
Publié: (2024)

Universal entrywise eigenvector fluctuations in delocalized spiked matrix models and asymptotics of rounded spectral algorithms
par: Chen, Shujing, et autres
Publié: (2025)

The Entropy and Crossentropy of Generalized Mallows Models
par: Meilă, Marina
Publié: (2025)

Finding planted cliques using gradient descent
par: Gheissari, Reza, et autres
Publié: (2023)

Bayesian inference of planted matchings: Local posterior approximation and infinite-volume limit
par: Fan, Zhou, et autres
Publié: (2026)