• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    柯

    柯朗数学科学研究所

    Courant Institute of Mathematical Sciences,New York University
    院校EST. 1935
    1,659论文总数
    14.3万引用总数

    论文量&引用量时间轴

    机构学者

    论文(1659)

    年份
    起
    –
    止
    排序
    1Efficiently Stable Presentations from Error-Correcting Codes
    Michael Chapman,Thomas Vidick,Henry Yuen

    We introduce a notion of \emph{efficient stability} for finite presentations of groups. Informally, a finite presentation using generators $S$ and relations $R$ is \emph{stable} if any map from $S$ to unitaries that approximately satisfies the relations (in the tracial norm) is close to the restriction of a representation of $G$ to the subset $S$. This notion and variants thereof have been extensively studied in recent years, in part motivated by connections to property testing in computer science. The novelty in our work is the focus on \emph{efficiency}, which, informally, places an onus on small presentations -- in the sense of encoding length. The goal in this setup is to achieve non-trivial tradeoffs between the presentation length and its modulus of stability. With this goal in mind we analyze various natural examples of presentations. We provide a general method for constructing presentations of $\mathbb{Z}_2^k$ from linear error-correcting codes. We observe that the resulting presentation has a weak form of stability exactly when the code is \emph{testable}. This raises the question of whether testable codes give rise to genuinely stable presentations using this method. While we cannot show that this is the case in general, we leverage recent results in the study of non-local games in quantum information theory (Ji et al., Discrete Analysis 2021) to show that a specific instantiation of our construction, based on the Reed-Muller family of codes, leads to a stable presentation of $\mathbb{Z}_2^k$ of size polylog$(k)$ only. As an application, we combine this result with recent work of de la Salle (arXiv:2204.07084) to re-derive the quantum low-degree test of Natarajan and Vidick (IEEE FOCS'18), which is a key building block in the recent refutation of Connes' Embedding Problem via complexity theory (Ji et al., arXiv:2001.04383).

    2026DISCRETE ANALYSIS(2026)引用:8
    引用
    AI阅读
    加入学术空间
    2Global Existence of Strong Solutions to the Inhomogeneous Kinetic Wave Equation
    Ioakeim Ampatzoglou,Tristan Léger

    In this paper we construct global dispersive solutions to the space inhomogeneous kinetic wave equation (KWE) which propagate L^1_xv —moments and conserve mass, momentum and energy. We prove that they scatter, and that the wave operators mapping the initial data to the scattering states are 1–1, onto and continuous in a suitable topology. This is the first global existence result for strong solutions for KWE. This contrasts with prior global existence results for mild solutions, which satisfy a transported version of the equation but do not solve the equation itself. Our proof is carried out entirely in physical space and combines dispersive estimates for the free transport with new trilinear bounds for the gain and loss operators of the KWE on weighted Lebesgue spaces. The main difficulty is the fast growth of the hard-sphere kernel. Our fundamental tool to handle it is a novel collisional averaging estimate. We also show that the nonlinear evolution preserves positivity forward in time. For this, we use the Kaniel–Shinbrot iteration scheme (Kaniel and Shinbrot in Commun Math Phys 58:65–84, 1978), properly initialized to ensure successive approximations are dispersive.

    2026Communications in Mathematical Physics(2026)引用:7
    引用
    AI阅读
    加入学术空间
    3On Dedekind's Problem, a Sparse Version of Sperner's Theorem, and Antichains of a Given Size in the Boolean Lattice
    Matthew Jenssen, Alexandru Malekshahian,Jinyoung Park

    Dedekind's problem, dating back to 1897, asks for the total number of antichains contained in the Boolean lattice on elements. We study Dedekind's problem using a recently developed method based on the cluster expansion from statistical physics, and as a result, obtain several new results on the number and typical structure of antichains in . We obtain detailed estimates for both and the number of antichains of size for any fixed . We also establish a sparse version of Sperner's theorem: we determine the sharp threshold and scaling window for the property that almost every antichain of size is contained in a middle layer of .

    2026JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES(2026)引用:7
    引用
    AI阅读
    加入学术空间
    4Universal Learning of Nonlinear Dynamics
    Evan Dogariu, Anand Paresh Brahmbhatt,Elad Hazan

    We study the fundamental problem of learning a marginally stable unknown nonlinear dynamical system. We describe an algorithm for this problem, based on the technique of spectral filtering, which learns a mapping from past observations to the next based on a spectral representation of the system. Using techniques from online convex optimization, we prove vanishing prediction error for any nonlinear dynamical system that has finitely many marginally stable modes, with rates governed by a novel quantitative control-theoretic notion of learnability. The main technical component of our method is a new spectral filtering algorithm for linear dynamical systems, which incorporates past observations and applies to general noisy and marginally stable systems. This significantly generalizes the original spectral filtering algorithm to both asymmetric dynamics as well as incorporating noise correction, and is of independent interest.

    ICLR 2026引用:6
    引用
    AI阅读
    加入学术空间
    5Universal Priors: Solving Empirical Bayes Via Bayesian Inference and Pretraining
    Nick Cannella,Anzo Teh,Yanjun Han,Yury Polyanskiy

    We theoretically justify the recent empirical finding of Teh et al. (2025) that a transformer pre-trained on synthetically generated data achieves strong performance on empirical Bayes (EB) problems. We take an indirect approach to this question: rather than analyzing the model architecture or training dynamics, we ask why a pretrained Bayes estimator, trained under a prespecified training distribution, can adapt to arbitrary test distributions. Focusing on Poisson EB problems, we identify the existence of universal priors such that training under these priors yields a near-optimal regret bound of (O) over tilde( 1/n) uniformly over all test distributions. Our analysis leverages the classical phenomenon of posterior contraction in Bayesian statistics, showing that the pretrained Bayes estimator adapts to unknown test distributions precisely through posterior contraction. This perspective also explains the phenomenon of length generalization, in which the test sequence length exceeds the training length, as the model performs Bayesian inference using a fractional posterior.

    2026THIRTY NINTH ANNUAL CONFERENCE ON LEARNING THEORY(2026)引用:5
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 1659 篇论文

    合作机构(100)

    纽约大学合作论文 183
    谷歌合作论文 48
    哈佛大学合作论文 41
    普林斯顿大学合作论文 31
    麻省理工学院合作论文 19
    特拉维夫大学合作论文 14
    马克斯·普朗克学会合作论文 14
    康奈尔大学合作论文 14
    斯坦福大学合作论文 14
    耶鲁大学合作论文 12

    机构统计