\log N)^{(d-1)(1-1
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Infinite sequences with optimal diaphony, periodic $L_2$-discrepancy, and beyond
arXiv:2606.05482v1 Announce Type: new Abstract: We investigate the periodic $L_2$-discrepancy of infinite sequences $\S_d$ in $[0,1)^d$ and its analytic counterpart, the diaphony. We prove that infinite order-2 digital sequences over $\mathbb{F}_2$ attain the optimal order $L_{2,N}^{{\rm per}}(\S_d) \le C_d (\log N)^{d/2}/N$ for all $N \in \mathbb{N}\setminus \{1\}$, matching known lower bounds for infinitely many $N \in \mathbb{N}$.
Empirical Approximation of $L_p$ Norms
arXiv:2606.00347v1 Announce Type: cross Abstract: We study empirical $L_p$ moments of a random vector $\pmb\varphi$ based on its i.i.d.\ copies $\pmb\varphi^1,\ldots,\pmb\varphi^m$, that is, $\frac1m\sum_{j=1}^m |\langle \pmb\varphi^j,y\rangle|^p$. Our main result is a new estimate for the expected uniform deviation \[ \mathbb{E}\sup_{y\in D}\biggl| \frac1m\sum_{j=1}^m |\langle \pmb\varphi^j,y\rangle|^p -\mathbb{E}|\langle \pmb\varphi,y\rangle|^p \biggr| \] over an arbitrary index set $D$....
Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures
arXiv:2411.12438v2 Announce Type: replace Abstract: We develop a new approach for clustering non-spherical (i.e., arbitrary component covariances) Gaussian mixture models via a subroutine, based on the sum-of-squares method, that finds a low-dimensional separation-preserving projection of the input data. Our method gives a non-spherical analog of the classical dimension reduction, based on singular value decomposition, that, among several other applications, forms a key component of the...
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...
Minimax optimal differentially private synthetic data for smooth queries
arXiv:2602.01607v3 Announce Type: replace-cross Abstract: Differentially private synthetic data enables the sharing and analysis of sensitive datasets while providing rigorous privacy guarantees for individual contributors. A central challenge is to achieve strong utility guarantees for meaningful downstream analysis. Many existing methods ensure uniform accuracy over broad query classes, such as all Lipschitz functions, but this level of generality often leads to suboptimal rates for...
Hard labels sampled from sparse targets mislead rotation invariant algorithms
Announce Type: replace-cross Abstract: One of the most common machine learning setups is logistic regression. In many classification models, including neural networks, the final prediction is obtained by applying a logistic link function to a linear score. In binary logistic regression, the feedback can be either soft labels, corresponding to the true conditional probability of the data (as in distillation), or sampled hard labels (taking values $\pm 1$).
Test-case reducers are underappreciated debugging tools
Test-case reducers are less well known than they should be, and those who are aware of them don’t always realise the variety of ways we can use – perhaps even abuse! – them. In this post, I’m going to explore some of the things I’ve learnt while using these wonderful tools. I’ll start at the basics, because the idea is so simple that it can be hard to believe it works.
Gooey: A GPU-accelerated UI framework for Zig
A GPU-accelerated UI framework for Zig, targeting macOS (Metal), Linux (Vulkan/Wayland), and Browser (WASM/WebGPU). Join the Gooey discord Early Development: API is evolving. Example app built with Gooey — chat-zig, an Anthropic Claude client using the Zig 0.16 std.
Whole-genome duplication shaped cell-type evolution in the vertebrate brain
Abstract The complex brains of vertebrates have more cell types than those of their closest relatives. Whole-genome duplications (WGDs) occurred during early vertebrate evolution1, but it is unclear whether the duplicated genes (ohnologues) facilitated cell-type evolution. Here using brain single-cell transcriptomes from five chordates—human2, mouse3, lizard4, lamprey5 and amphioxus—we report that many cell-type families with conserved core transcription factors in vertebrates do not show...
Deep learning four decades of human migration
Abstract Human migration is a fundamental driver of global demographic change, shaping population structure, labour markets and social policy across countries1,2,3. Although long-term migration patterns are often linked to economic development4, they can shift rapidly in response to shocks such as conflict, environmental crises and political change5. Despite its importance, migration remains difficult to measure consistently: existing data are sparse, concentrated in high-income settings and...