\infty)$
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Beyond $\ell_2$-norm and $\ell_\infty$-norm: A Curvature-Inspired $\ell_p$-Norm Scheme for Deep Neural Networks
Announce Type: new Abstract: The existing optimizers for deep neural networks (DNNs) typically rely on either the $\ell_2$ norm or the $\ell_\infty$ norm, resulting in optimizers that do not adapt well to substantial changes in curvature across parameter dimensions. Generally, the training process of DNNs often exhibits strong curvature anisotropy in the early period, whereas in the later period, the training process of DNNs tends to move toward flatter regions with weaker anisotropy....
Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs
arXiv:2601.23229v2 Announce Type: replace Abstract: Markov decision processes (MDPs) are a fundamental model in sequential decision making. Robust MDPs (RMDPs) extend this framework by allowing uncertainty in transition probabilities and optimizing against the worst-case realization of that uncertainty. In particular, $(s, a)$-rectangular RMDPs with $L_\infty$ uncertainty sets form a fundamental and expressive model: they subsume classical MDPs and turn-based stochastic games.
Improved Distribution Estimation in $\ell_\infty$
arXiv:2605.30509v1 Announce Type: cross Abstract: We present improved bounds for estimating discrete probability distributions under the $\ell_\infty$ norm. These include minimax bounds in expectation and high-probability tail bounds. We resolve some of the open questions posed in Kontorovich and Painsky (JMLR, 2025) -- including a fully empirical version of the tightest risk bound they presented and identifying the form of the worst-case extremal distribution.
Robust $\mathcal{H}_\infty$ Observer Design via Finsler's Lemma and IQCs
arXiv:2604.03989v3 Announce Type: replace-cross Abstract: This paper develops a Finsler-based LMI for robust $\mathcal{H}_\infty$ observer design with integral quadratic constraints (IQCs) and block-structured uncertainty. By introducing a slack variable that relaxes the coupling between the Lyapunov matrix, the observer gain, and the IQC multiplier, the formulation addresses two limitations of the standard block-diagonal approach: the LMI requirement $\mathrm{He}(PA) \prec 0$ (which fails...
Strict stability of extension types
Announce Type: replace-cross Abstract: The theory of $(\infty,1)$-categories can be developed synthetically in an augmentation of homotopy type theory introduced by Riehl--Shulman. Central to their development is an additional type forming operation called extensions. The original article sketches the semantics of this formal system, explaining how the simplicial homotopy theory can be used to reason about $(\infty,1)$-categories presented using the Segal space model.
Approximation by short exponential sums with geometric error decay based on Gauss quadrature
Announce Type: new Abstract: We present new short exponential sum approximations of length $N$ for $f_1(x)=\frac{1}{a+x}$ with $a>0$ on $[0, \infty)$ and for $f_2(x)= {\mathrm e}^{-x^2/2\sigma}$ with $\sigma>0$ on ${\mathbb R}$ with geometric error decay ${\rho}^{-2N}$ for user-defined $N \ge 2$ and $\rho > The approximations are built over consecutive intervals $[b_j, \, b_{j+1}) \subset [0, \infty)$, $j \in {\mathbb N}_{0}$, with interval lengths that depend on $\rho$ and grow...
Variational free complement method with Gaussian-expanded complement functions: convergence with fixed Gaussian expansion length
Physics > Chemical Physics [Submitted on 1 Jun 2026] Title:Variational free complement method with Gaussian-expanded complement functions: convergence with fixed Gaussian expansion length View PDF HTML (experimental)Abstract:For the free complement theory with Gaussian-expanded complement functions, the energy convergence of $n_\mathrm{G} = \mathrm{constant} < \infty, n\rightarrow\infty$ is discussed, where $n_\mathrm{G}$ is the number of the Gaussian functions in the STO-$n$G expansion.
Overclocking Electrostatic Generative Models
arXiv:2509.22454v2 Announce Type: replace Abstract: Electrostatic generative models such as PFGM++ have recently emerged as a powerful framework, achieving competitive performance in image synthesis. PFGM++ operates in an extended data space with auxiliary dimensionality $D$, recovering the diffusion model framework as $D\to\infty$, while yielding superior empirical results for finite $D$. Like diffusion models, PFGM++ relies on expensive ODE simulations to generate samples, making it...
Sampling and reconstruction of convex functions
Announce Type: new Abstract: We discuss optimal recovery for classes of multivariate convex functions from given point samples, as well as the sampling numbers of these classes, corresponding to optimal sample choices. Upper and lower bounds for either variant are established when the reconstruction error is measured in $L_p$ for $1\leq p\leq \infty$. These bounds match, sometimes up to logarithmic factors, and therefore characterize the respective optimal rate of decay. For classical...
Strategyproof Mechanisms for Euclidean Facility Location Problems under $L_p$-norm Social Cost
arXiv:2606.08621v1 Announce Type: new Abstract: We study strategyproof mechanisms for eliciting agents' location preferences truthfully in the Euclidean plane $\mathbb R^2$ and locating a facility so as to minimize the $L_p$-norm social cost, defined as the $L_p$-norm of the vector of distances from the facility to the agents' preferred locations, for any $p \ge 1$. While the cases $p=1$ and $p=\infty$ have been well-studied, open questions remain about the optimal approximation ratios...