pre-)asymptotic
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Shortcomings and capacities of real-constrained neural networks in complex spaces
Announce Type: new Abstract: We find the asymptotic ratio between the storage capacities when enforcing real pre-activations in a complex hypothesis class as opposed to complex ones in the same class. Our methods depend on Gardner volume comparisons at critical capacity. Our proof relies on an application of the Harish-Chandra-Itzykson-Zuber (HCIZ) formula, nonstandard in literature.
Flow map learning in nonlinear vector autoregressive models: influence of the feature-library structure on the training error
arXiv:2605.31438v1 Announce Type: new Abstract: Time series forecasting often requires learning nonlinear and time-delayed dependencies. A paradigmatic class of forecasting models are nonlinear vector autoregressive processes (NVAR), also known as next-generation reservoir computers (NG-RCs). These models approximate the Koopman operator on the space spanned by their explicit feature library.
How Accurately Can a Gaussian Approximate Stochastic Approximation Iterates?
arXiv:2602.13906v2 Announce Type: replace-cross Abstract: Stochastic approximation (SA) is a method for finding the root of an operator perturbed by noise. The focus of this paper is studying the distribution of SA iterates in finite time. In general, it is not possible to characterize the exact distribution, and therefore our goal is to find an approximation which can yield useful tail bounds.
Zeroth-Order Non-Log-Concave Sampling with Variance Reduction and Applications to Inverse Problems
arXiv:2605.30573v1 Announce Type: new Abstract: Sampling from high-dimensional, non-log-concave distributions with unnormalized densities remains a fundamental challenge in machine learning, particularly in black-box settings where gradient information is inaccessible or computationally prohibitive. While Langevin dynamics provides a principled framework for sampling when gradients are accessible, its extension to the black-box settings suffers from high variance and lacks non-asymptotic...
High-Dimensional Theory of LoRA Fine-Tuning in a Solvable Attention Model
Announce Type: new Abstract: We develop a high-dimensional statistical theory of low-rank adaptation (LoRA) in attention models, capturing the interplay between pre-training and fine-tuning. We introduce a solvable framework in which a single-head attention layer is first pre-trained on a data-abundant task and subsequently adapted via a rank-one LoRA update on limited data. In the high-dimensional limit, both stages admit a sharp asymptotic characterization in terms of a finite set of order...
Distribution-free changepoint localization after sequential change detection
arXiv:2606.01256v1 Announce Type: cross Abstract: This paper introduces a distribution-free framework for constructing post-detection confidence sets for changepoints after stopping a sequential change detection procedure. It is well known that conformal test martingales can be used to sequentially detect changes in distribution, but by themselves provide no inference for the time at which a proclaimed change occurred. Past work on post-detection inference requires pre- and post-change...
Modeling Covariate Transition for Efficient Estimation of Longitudinal Treatment Effects in Randomized Experiments
arXiv:2605.31443v1 Announce Type: cross Abstract: We present a regression-adjustment framework designed for the estimation of longitudinal treatment effects in randomized experiments under static regimes. While regression-adjustment methods are useful for variance reduction in randomized experiments by using pre-treatment covariates, they usually focus only on average effects, from which we cannot obtain valuable insights into when the effects appear and how long they continue. To address...
Families of Control-Cost-Parametrized Inverse-Optimal Universal Stabilizers
Announce Type: new Abstract: A classical universal stabilization formula offers the practitioner no design freedom: it is a single, parameter-free object. We introduce a cost-parametrized family of stabilizing feedback laws, where (1) the user chooses a function that serves as the running cost on control in an inverse-optimal cost functional, and (2) obtains, through a formula, a nonlinear "expander" of a pre-existing universal controller, which solves an infinite-horizon optimal control...
Port React Compiler to Rust
[compiler] Port React Compiler to Rust#36173 This is an experimental, work-in-progress port of React Compiler to Rust. Key points: - Work-in-progress - we are sharing early, prior to testing internally at Meta, to get feedback from partners in parallel with continued development.
Every Byte Matters
Every byte matters Published 2026-06-01 on Farid Zakaria's Blog I have spent a large portion of my career working in Java. In that time, you get used to huge classes. Just add a new method and field to the class.