3,602+ open-access research outputs.
We study the dynamics of circular cosmic string loops in a spatially flat Friedmann Lema\^itre Robertson Walker universe within a fractional Polyakov framework that incorporates nonlocal memory effect…
In this paper, we resolve an open question in the field of optimization algorithms for training parametrized quantum circuits: Does the popular Rotosolve algorithm converge? Until now, interpolation-b…
The IKKT matrix model, which is proposed as a non-perturbative formulation of superstring theory, has an issue typical of zero-dimensional theory -- ambiguity in the definition of its path integral. T…
We present PolyKV, a system in which multiple concurrent inference agents share a single, asymmetrically compressed KV cache pool. Rather than allocating a separate KV cache per agent -- the standard …
In this article, we develop an efficient algorithm based on three special variants of the nonlinear conjugate gradient method, namely, the Polak--Ribiere--Polyak, Hestenes--Stiefel, and Liu--Story sch…
Polyak-Ruppert averaging yields an asymptotically normal estimator with sandwich covariance $H^{-1}SH^{-1}$, the foundation of online inference. When the gradient step is preconditioned by a data-driv…
In this work we analyze the classical confinement of relativistic and supersymmetric spinning particles in higher-codimension braneworlds. Considering warped backgrounds generated by string-like $ n=2…
Ni-doped Cd1-xMnxS (x=0.4) thin films were prepared via a cost-effective chemical bath deposition (CBD) method to investigate their suitability for optoelectronic applications. Incorporation of a seco…
We present a non-Abelian model for magnetic monopoles in inhomogeneous media, based on a generalization of the standard 't~Hooft-Polyakov model. The medium is described by spatially dependent coupling…
Naturally produced stingless bee hive (NP-SBH) is an intricately produced material by the combination of waxes, resin and other biological materials that offers protection and structural stability to …
We numerically investigate whether the center-symmetric confined phase of large-$N$ $SU(N)$ gauge theory with one adjoint Dirac fermion persists under spatial compactification on $\mathbb{R}^3 \times …
Linear convergence of first-order methods is typically characterized by global optimization conditions whose constants reflect worst-case geometry of the ambient space. In high-dimensional or structur…
Analysis of Stochastic Gradient Descent (SGD) and its variants typically relies on the assumption of uniformly bounded variance, a condition that frequently fails in practical non-convex settings, suc…
This paper studies a stochastic algorithm for linearly constrained nonconvex optimization, where the objective function is smooth but only unbiased stochastic gradients with bounded variance are avail…
Understanding the topology of sublevel sets yields crucial insights into the optimization landscape of non-convex functions. If sublevel sets are connected, local search algorithms are less likely to …
The Calogero-Sutherland model is a paradigmatic integrable system describing one-dimensional non-relativistic particles with inverse-square interactions. At interaction strength $\lambda=2$, the CSM e…
We study continuous-time online learning where data are generated by a diffusion process with unknown coefficients. The learner employs a two-layer neural network, continuously updating its parameters…
We study online covariance matrix estimation for Polyak--Ruppert averaged stochastic gradient descent (SGD). The online batch-means estimator of Zhu, Chen and Wu (2023) achieves an operator-norm conve…
In this paper, we propose a unified compression algorithm for distributed nonconvex opitmization with both the locally- and globally-bounded communication compressors, including 1-bit compressors, sat…
Byzantine-robust distributed optimization relies on robust aggregation rules to mitigate the influence of malicious Byzantine workers. Despite the proliferation of such rules, a unified convergence an…
Free open-access publishing with Google Scholar indexing.
Submission Guide →