Copertina

High Probability Latency Sequential Change Detection over an Unknown Finite Horizon

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Huang, Yu-Han, Veeravalli, Venugopal V.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Systems and Control Statistics Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

Probability Tools for Sequential Random Projection
di: Li, Yingru
Pubblicazione: (2024)

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

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

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

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

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

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

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

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

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

Accurate Analysis of Sparse Random Projections
di: Skórski, Maciej
Pubblicazione: (2024)

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

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

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

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

Adaptive control of dynamic networks
di: Pan, Chunyu, et al.
Pubblicazione: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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