4 papers
A New Algebraic Algorithm for LWE
Luca Campa, Massimo Fumiani, Arnab Roy
The Learning With Errors (LWE) problem, introduced by Regev in 2005, is central to modern cryptography and post-quantum security. The algorithms to solve the search version of the…
Why Clipping Matters in AdaGrad? Toward a High-Probability Theory under Generalized Smoothness
Alokendu Mazumder, Ayaan Mohd, Harshit Rawat +3
We analyze the original same-step coordinate-wise AdaGrad under generalized smoothness and heavy-tailed noise with bounded variance. In this setting, local curvature may grow sub-q…
On Hamming-Lipschitz Type Stability of the Subdominant (Minmax) Ultrametric: Theory and Simple Proofs
Alokendu Mazumder, Arnab Roy, Punit Rathore
The subdominant (minmax) ultrametric is a canonical tree-structured summary of a dissimilarity matrix, arising equivalently as the ultrametric induced by single-linkage clustering.…
Muonphilic asymmetric dark matter at a future muon collider
Arnab Roy, Raymond R. Volkas
We explore phenomenological constraints on, and future muon collider sensitivities to, the parameter spaces of various muonphilic portals to fermionic asymmetric dark matter (ADM).…