\rceil$
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
One-Shot Klein Cutting Planes for Lipschitz Geodesically Convex Optimization in Hyperbolic Space
arXiv:2605.17540v4 Announce Type: replace Abstract: Motivated by the COLT 2023 open problem of Criscitiello, Mart\'inez-Rubio, and Boumal on deterministic first-order methods for Lipschitz geodesically convex optimization on Hadamard manifolds, we study hyperbolic space \[ \HH^d_{-\kappaC^2} =\{X\in\R^{d+1}:\ipL{X}{X}=-1,\ X_0>0\}, \qquad \ip{U}{V}_X=\kappaC^{-2}\ipL{U}{V}. For every geodesically convex $M$-Lipschitz function \[ f:\bar B_{\HH}(x_0,r)\to\R,\qquad s=\kappaC r, \] we give a...
SA-DTS: Semantic-Aware Digital Twin Synchronization over 6G Networks
Announce Type: new Abstract: Digital Twins (DTs) are emerging as a cornerstone of the 6G vision, enabling real-time cyber-physical mirroring for smart manufacturing, autonomous vehicles, and remote healthcare. However, maintaining high-fidelity synchronization at scale demands an enormous and sustained uplink bandwidth, threatening both the feasibility and the energy efficiency of large deployments. We propose a Semantic-Aware DT Synchronization (SA-DTS) framework that radically redefines...
An extremal problem for completely unclustered Burrows-Wheeler images
arXiv:2606.01267v1 Announce Type: cross Abstract: The Burrows--Wheeler transform is usually viewed as a clustering transform: it tends to group equal letters into long runs. We study the opposite extremal regime, where the BWT output is completely unclustered, that is, has as many equal-letter runs as positions. Known results imply, on the one hand, that the number of runs in the BWT of a Lyndon word can increase by at most a factor of two, and, on the other hand, that over every alphabet of...
Tight list replicability bounds via a novel sphere covering theorem
arXiv:2606.06148v1 Announce Type: new Abstract: In recent years, list replicability has emerged as a framework for formalizing reproducibility in learning theory. A central question is how the required list size relates to the accuracy parameter and natural complexity measures of the hypothesis class.
Proven Advantage of Multiobjective Evolutionary Algorithms for Problems with Different Degrees of Conflict
arXiv:2408.04207v3 Announce Type: replace Abstract: The field of multiobjective evolutionary algorithms (MOEAs) often emphasizes its popularity for optimization problems with conflicting objectives. However, it is still theoretically unknown how MOEAs perform compared with typical approaches outside this field. This paper conducts such a systematic theoretical comparison on problem classes with different degrees of conflict.