23 citations · 36 across the 16 of their papers we have counts for
8 papers · 1 filter
Optimal Rényi and Logarithmic Additive Functional Entropy Estimation
Arman Adibi, Piotr Krysta
We characterize the minimax sample complexity of estimating Rényi entropy from independent samples on an alphabet of size at most , when the known order may vary with .…
A Mixture-of-Experts Framework for Multi-Stream Quickest Change Detection
Wuxia Chen, Arman Adibi, Taposh Banerjee +1
A Mixture-of-Experts (MoE) framework is proposed for quickest change detection (QCD) where there are multiple experts, and each expert produces a sequence of statistics for change…
Certified Robustness via Sparse Second-Order Cone Relaxations
Mohammadreza Maleki, Daniel Sadig, Rushendra Sidibomma +3
Certified robustness is critical for deploying neural networks in safety-sensitive settings, but computing exact certificates typically requires solving nonconvex optimization prob…
Nash Equilibrium Text: A Game-Theoretic Decoding Framework for Text Generation
Alireza Jafari, Arman Adibi, Mohammad Ghavamzadeh +1
Text revision has become an integral component of large language models. This paper formulates revision such that it admits a Nash equilibrium: Token positions are players, vocabul…
Transformers as In-Context Samplers: From Closed-Form Diffusion to Estimation-Free Sampling
Arman Adibi, Alireza Jafari, Mohammad Ghavamzadeh +1
A growing body of work establishes that large language models are not mere statistical memorizers, but are capable of in-context learning: performing inference at test time using o…
Tight Sample Bounds for Renyi and Min-Entropy Estimation
Arman Adibi, Piotr Krysta
Estimating entropy from samples is fundamental in information theory and property testing. Shannon entropy measures average uncertainty and can be estimated to constant additive ac…
Convergence of Byzantine-Resilient Gradient Tracking via Probabilistic Edge Dropout
Amirhossein Dezhboro, Fateme Maleki, Arman Adibi +2
We study distributed optimization over networks with Byzantine agents that may send arbitrary adversarial messages. We propose \emph{Gradient Tracking with Probabilistic Edge Dropo…
Cascading Robustness Verification: Toward Efficient Model-Agnostic Certification
Mohammadreza Maleki, Rushendra Sidibomma, Arman Adibi +1
Certifying neural network robustness against adversarial examples is challenging, as formal guarantees often require solving non-convex problems. Hence, incomplete verifiers are wi…