Cover Image

Quickest Change Detection with Confusing Change

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Yu-Zhen Janice, Zuo, Jinhang, Veeravalli, Venugopal V., Towsley, Don
Format:	Preprint
Published:	2024
Subjects:	Statistics Theory Information Theory Machine Learning Signal Processing Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Local Landscape of Phase Retrieval Under Limited Samples
by: Liu, Kaizhao, et al.
Published: (2023)

Quickest Change Detection for Multiple Data Streams Using the James-Stein Estimator
by: Halme, Topi, et al.
Published: (2024)

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

Conditional Score Learning for Quickest Change Detection in Markov Transition Kernels
by: Chen, Wuxia, et al.
Published: (2025)

Quickest Change Detection with Cost-Constrained Experiment Design
by: Lubenia, Patrick Vincent N., et al.
Published: (2025)

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

Piecewise Linearity of Min-Norm Solution Map of a Nonconvexly Regularized Convex Sparse Model
by: Zhang, Yi, et al.
Published: (2023)

Learning Where to Look: UCB-Driven Controlled Sensing for Quickest Change Detection
by: Huang, Yu-Han, et al.
Published: (2026)

Newton Meets Marchenko-Pastur: Massively Parallel Second-Order Optimization with Hessian Sketching and Debiasing
by: Romanov, Elad, et al.
Published: (2024)

ODELoRA: Training Low-Rank Adaptation by Solving Ordinary Differential Equations
by: Gao, Yihang, et al.
Published: (2026)

Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization
by: Gao, Yihang, et al.
Published: (2025)

Adaptive Learning for IRS-Assisted Wireless Networks: Securing Opportunistic Communications Against Byzantine Eavesdroppers
by: Taherpour, Amirhossein, et al.
Published: (2025)

Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization
by: Luo, Yuetian, et al.
Published: (2021)

Weighed l1 on the simplex: Compressive sensing meets locality
by: Tasissa, Abiy, et al.
Published: (2021)

K-Deep Simplex: Deep Manifold Learning via Local Dictionaries
by: Tankala, Pranay, et al.
Published: (2020)

Reinforcement Learning Design for Quickest Change Detection
by: Cooper, Austin, et al.
Published: (2024)

Covert Bayesian Quickest Change Detection
by: Lo, Yun-Feng, et al.
Published: (2026)

Robust Quickest Change Detection in Non-Stationary Processes
by: Hou, Yingze, et al.
Published: (2023)

Score-Based Quickest Change Detection and Fault Identification for Multi-Stream Signals
by: Chen, Wuxia, et al.
Published: (2025)

Covariance-Based Activity Detection in Cooperative Multi-Cell Massive MIMO: Scaling Law and Efficient Algorithms
by: Wang, Ziyue, et al.
Published: (2023)

Robust Phase Retrieval by Alternating Minimization
by: Kim, Seonho, et al.
Published: (2024)

Exactly or Approximately Wasserstein Distributionally Robust Estimation According to Wasserstein Radii Being Small or Large
by: Ding, Xiao, et al.
Published: (2025)

Covariance-Based Device Activity Detection with Massive MIMO for Near-Field Correlated Channels
by: Wang, Ziyue, et al.
Published: (2024)

QoS-Aware and Routing-Flexible Network Slicing for Service-Oriented Networks
by: Chen, Wei-Kun, et al.
Published: (2024)

Optimal transport natural gradient for statistical manifolds with continuous sample space
by: Chen, Yifan, et al.
Published: (2018)

An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing
by: Chen, Wei-Kun, et al.
Published: (2023)

Beamforming Design for Integrated Sensing and Communications Using Uplink-Downlink Duality
by: Attiah, Kareem M., et al.
Published: (2024)

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
by: Li, Gen, et al.
Published: (2020)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)

Quantized Constant-Envelope Waveform Design for Massive MIMO DFRC Systems
by: Wu, Zheyu, et al.
Published: (2024)

A Survey of Recent Advances in Optimization Methods for Wireless Communications
by: Liu, Ya-Feng, et al.
Published: (2024)

G{é}n{é}ration de Matrices de Corr{é}lation avec des Structures de Graphe par Optimisation Convexe
by: Fahkar, Ali, et al.
Published: (2025)

Generating Correlation Matrices with Graph Structures Using Convex Optimization
by: Fakhar, Ali, et al.
Published: (2025)

On the Fundamental Tradeoff of Joint Communication and Quickest Change Detection with State-Independent Data Channels
by: Seo, Daewon, et al.
Published: (2024)

Long-time dynamics and universality of nonconvex gradient descent
by: Han, Qiyang
Published: (2025)

High-probability sample complexities for policy evaluation with linear function approximation
by: Li, Gen, et al.
Published: (2023)

Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality
by: Wibisono, Andre
Published: (2025)

A New Adaptive Balanced Augmented Lagrangian Method with Application to ISAC Beamforming Design
by: Wu, Jiageng, et al.
Published: (2024)

Optimization of Beyond Diagonal RIS: A Universal Framework Applicable to Arbitrary Architectures
by: Wu, Zheyu, et al.
Published: (2024)

An Adaptive Proximal Inexact Gradient Framework and Its Application to Per-Antenna Constrained Joint Beamforming and Compression Design
by: Fan, Xilai, et al.
Published: (2025)