Imagen de Portada

High Probability Latency Sequential Change Detection over an Unknown Finite Horizon

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Huang, Yu-Han, Veeravalli, Venugopal V.
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Systems and Control Statistics Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Sequential Change Detection for Learning in Piecewise Stationary Bandit Environments
por: Huang, Yu-Han, et al.
Publicado: (2025)

A Simple Geometric Proof of the Optimality of the Sequential Probability Ratio Test for Symmetric Bernoulli Hypotheses
por: Pabbaraju, Chirag, et al.
Publicado: (2025)

Robust Online Sampling from Possibly Moving Target Distributions
por: Clément, François, et al.
Publicado: (2025)

Asymptotically Optimal Sequential Testing with Heterogeneous LLMs
por: Li, Guokai, et al.
Publicado: (2026)

Finite-Horizon Quickest Change Detection Balancing Latency with False Alarm Probability
por: Huang, Yu-Han, et al.
Publicado: (2025)

Linear Regression with Unknown Truncation Beyond Gaussian Features
por: Kouridakis, Alexandros, et al.
Publicado: (2026)

Probability Tools for Sequential Random Projection
por: Li, Yingru
Publicado: (2024)

Minimax optimal testing by classification
por: Gerber, Patrik Róbert, et al.
Publicado: (2023)

Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel
por: Gupta, Shivam, et al.
Publicado: (2024)

Robustly Learning Single-Index Models via Alignment Sharpness
por: Zarifis, Nikos, et al.
Publicado: (2024)

Separating Oblivious and Adaptive Models of Variable Selection
por: Chen, Ziyun, et al.
Publicado: (2026)

Breaking the Heavy-Tailed Noise Barrier in Stochastic Optimization Problems
por: Puchkin, Nikita, et al.
Publicado: (2023)

Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians
por: Lee, Jane H., et al.
Publicado: (2024)

Attainability of Two-Point Testing Rates for Finite-Sample Location Estimation
por: Compton, Spencer, et al.
Publicado: (2025)

Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph
por: Yu, Xifan, et al.
Publicado: (2024)

Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime
por: Chen, Guanyi, et al.
Publicado: (2025)

Accurate Analysis of Sparse Random Projections
por: Skórski, Maciej
Publicado: (2024)

The Power of Two Matrices in Spectral Algorithms for Community Recovery
por: Dhara, Souvik, et al.
Publicado: (2022)

Optimum Noise Mechanism for Differentially Private Queries in Discrete Finite Sets
por: Kadam, Sachin, et al.
Publicado: (2021)

A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
por: Van Over, Brandon, et al.
Publicado: (2024)

On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
por: Li, Bowen, et al.
Publicado: (2024)

Adaptive control of dynamic networks
por: Pan, Chunyu, et al.
Publicado: (2023)

Computational Complexity Analysis of Interval Methods in Solving Uncertain Nonlinear Systems
por: Prakash, Rudra, et al.
Publicado: (2026)

Entangled Mean Estimation in High-Dimensions
por: Diakonikolas, Ilias, et al.
Publicado: (2025)

Computing High-dimensional Confidence Sets for Arbitrary Distributions
por: Gao, Chao, et al.
Publicado: (2025)

High-dimensional estimation with missing data: Statistical and computational limits
por: Verchand, Kabir Aladin, et al.
Publicado: (2026)

High-Dimensional Gaussian Mean Estimation under Realizable Contamination
por: Diakonikolas, Ilias, et al.
Publicado: (2026)

Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models
por: Diakonikolas, Ilias, et al.
Publicado: (2024)

Faster algorithms for the alignment of sparse correlated Erdös-Rényi random graphs
por: Muratori, Andrea, et al.
Publicado: (2024)

Exact threshold for approximate ellipsoid fitting of random points
por: Bandeira, Afonso S., et al.
Publicado: (2023)

Fitting an ellipsoid to random points: predictions using the replica method
por: Maillard, Antoine, et al.
Publicado: (2023)

Stable Algorithms Lower Bounds for Estimation
por: Yu, Xifan, et al.
Publicado: (2026)

On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule
por: Chen, Zongchen, et al.
Publicado: (2024)

Random Multi-Type Spanning Forests for Synchronization on Sparse Graphs
por: Jaquard, Hugo, et al.
Publicado: (2024)

On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem
por: Lovig, Maxwell, et al.
Publicado: (2024)

The Conflict Graph Design: Estimating Causal Effects under Arbitrary Neighborhood Interference
por: Kandiros, Vardis, et al.
Publicado: (2024)

Universal entrywise eigenvector fluctuations in delocalized spiked matrix models and asymptotics of rounded spectral algorithms
por: Chen, Shujing, et al.
Publicado: (2025)

The Entropy and Crossentropy of Generalized Mallows Models
por: Meilă, Marina
Publicado: (2025)

Finding planted cliques using gradient descent
por: Gheissari, Reza, et al.
Publicado: (2023)

Bayesian inference of planted matchings: Local posterior approximation and infinite-volume limit
por: Fan, Zhou, et al.
Publicado: (2026)