@article{21252,
  abstract     = {Context. Recent observational results from asteroseismic studies show that an important fraction of solar-like stars do not present detectable stochastically excited acoustic oscillations. This non-detectability seems to correlate with a high rotation rate in the convective envelope and a high surface magnetic activity. At the same time, the properties of stellar convection are affected by rotation and magnetism.
Aims. We investigate the role of rotation in the excitation of acoustic modes in the convective envelope of solar-like stars, to evaluate its impact on the energy injected in the oscillations.
Methods. We derived theoretical prescriptions for the excitation of acoustic waves in the convective envelope of rotating solar-like stars. We adopted the rotating mixing-length Theory to model the influence of rotation on convection. We used the MESA stellar evolution code and the GYRE stellar oscillation code to estimate the power injected in the oscillations from our theoretical prescriptions.
Results. We demonstrate that the power injected in the acoustic modes is insensitive to rotation if a Gaussian time-correlation function is assumed, while it can decrease by up to 60% for a Lorentzian time-correlation function, for a 20 Ω⊙ rotation rate. We show that the modification of the excitation rate by rotation depends not only on the rotation rate but also on the radial and angular orders of the considered oscillation mode. This result can allow for better constraints on the properties of stellar convection by studying observationally acoustic mode excitation.
Conclusions. These results demonstrate how important it is to take into account the modification of stellar convection by rotation when evaluating the amplitude of the stellar oscillations it stochastically excites. They open the path for understanding the large variety of observed acoustic-mode amplitudes at the surface of solar-like stars as a function of surface rotation rates.},
  author       = {Bessila, L. and Deckx van Ruys, A. and Buriasco, V. and Mathis, S. and Bugnet, Lisa Annabelle and García, R. A. and Mathur, S.},
  issn         = {1432-0746},
  journal      = {Astronomy & Astrophysics},
  publisher    = {EDP Sciences},
  title        = {{The impact of rotation on the stochastic excitation of stellar acoustic modes in solar-like pulsators}},
  doi          = {10.1051/0004-6361/202452093},
  volume       = {700},
  year         = {2025},
}

@inbook{21255,
  abstract     = {As an important plant hormone to regulate growth and development, auxin has been investigated for more than a century. It had been clearly demonstrated and well-accepted that the intracellular auxin receptors, TIR1/AFBs, are F-box proteins mediating transcriptional auxin signaling by their E3 ubiquitin ligase activity, which targets and sends for degradation the Aux/IAA transcriptional repressors. The recent discovery of adenylate cyclase (AC) and guanylate cyclase (GC) activities for TIR1/AFBs open entirely new perspectives on how auxin signaling can operate. This chapter traces back the history of how canonical transcriptional auxin signaling was established and introduces the discovery of the TIR1/AFBs-mediated nontranscriptional signaling branch. Finally, the current understanding and open questions of how TIR1/AFBs’ AC and GC activities contribute to the transcriptional and nontranscriptional auxin signaling are discussed, highlighting the possibility that cyclic adenosine monophosphate (cAMP) and cyclic guanosine monophosphate (cGMP) act as second messengers in auxin signal transduction.},
  author       = {Qi, Linlin and Friml, Jiří},
  booktitle    = {Cryptic Enzymes and Moonlighting Proteins},
  editor       = {Irving, Helen and Gehring, Chris and Wong, Aloysius},
  isbn         = {9780443157196},
  pages        = {299--322},
  publisher    = {Elsevier},
  title        = {{Nucleotidyl cyclase activities of TIR1/AFB auxin receptors: new insights into the mechanism of auxin signaling}},
  doi          = {10.1016/b978-0-443-15719-6.00015-5},
  year         = {2025},
}

@article{21256,
  abstract     = {Collagen IV is one of the main components of the basement membrane, a layer of material that lines the majority of tissues in multicellular organisms. Collagen IV molecules assemble into networks, providing stiffness and elasticity to tissues and informing cell and organ shape, especially during development. In this work, we develop two coarse-grained models for collagen IV molecules that retain biochemical bond specificity and coarse grain at different length scales. Through molecular-dynamics simulations, we test the assembly and mechanics of the resulting networks and measure their response to strain in terms of stress, microscopic alignment, and bond dynamics. Within the basement membrane, collagen IV networks rearrange by molecule turnover, which affects tissue organization and can be linked with enzyme activity. Here we explore network rearrangements via bond remodeling, the process of breaking and remaking of bonds between network molecules. We then investigate the effects of active (enzymatic) bond remodeling. We find that this nonequilibrium remodeling allows a network to keep its integrity under strain, while relaxing fully over a variety of timescales, a dynamic response that is unavailable to networks undergoing equilibrium remodeling.},
  author       = {Meadowcroft, Billie and Sorichetti, Valerio and Ratajczyk, Eryk and Perez Verdugo, Fernanda L and Khalilgharibi, Nargess and Mao, Yanlan and Palaia, Ivan and Šarić, Anđela},
  issn         = {2835-8279},
  journal      = {PRX Life},
  publisher    = {American Physical Society},
  title        = {{Nonequilibrium remodeling of collagen IV networks in Silico}},
  doi          = {10.1103/gdd5-rnh7},
  volume       = {3},
  year         = {2025},
}

@inbook{21257,
  abstract     = {We investigate the problem of accurate sparse fine-tuning of large language models (LLMs), that is, fine-tuning pre-trained LLMs on specialized tasks, while inducing sparsity in their weights. Our work is motivated by experiments showing that standard loss-based fine-tuning methods are not able to achieve high accuracy in this setting, especially at high sparsity targets. To address this issue, we perform a detailed study of knowledge distillation losses for fine-tuning of sparse models. We determine an L2-based distillation approach that we term ‘SquareHead’, which enables accurate recovery even at higher sparsities. Investigating the question of efficient inference, we show that sparse LLMs can be executed faster by taking advantage of sparsity. Specifically, we exhibit end-to-end results showing speedups enabled by sparsity, while recovering accuracy, on the following models and tasks, respectively: T5 for language translation, Whisper for speech translation, and open GPT-type models such as the Mosaic Pre-Trained Transformer (MPT) and Llama-2 models for text generation. In particular, for popular generative tasks, we show for the first time that sparse fine-tuning can reach 75% sparsity without drops in accuracy, and provide notable end-to-end speedups for inference on CPUs. Moreover, we also highlight that sparsity is compatible with other compression approaches, such as quantization.},
  author       = {Kurtic, Eldar and Kuznedelev, Denis and Frantar, Elias and Goinv, Michael and Pandit, Shubhra and Agarwalla, Abhinav and Nguyen, Tuan and Marques, Alexandre and Kurtz, Mark and Alistarh, Dan-Adrian},
  booktitle    = {Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques},
  editor       = {Passban, Peyman and Way, Andy and Rezagholizadeh, Mehdi},
  isbn         = {9783031857461},
  issn         = {2522-803X},
  pages        = {83--97},
  publisher    = {Springer Nature},
  title        = {{Sparse Fine-Tuning for Inference Acceleration of Large Language Models}},
  doi          = {10.1007/978-3-031-85747-8_6},
  year         = {2025},
}

@article{21269,
  abstract     = {The spatial organization of chromatin within the nucleus plays a crucial role in gene expression and genome function. However, the quantitative relationship between this organization and nuclear biochemical processes remains under debate. In this study, we present a graph-based generative model, bioSBM, designed to capture long-range chromatin interaction patterns from Hi-C data and, importantly, simultaneously link these patterns to biochemical features. Applying bioSBM to Hi-C maps of the GM12878 lymphoblastoid cell line, we identified a latent structure of chromatin interactions, revealing seven distinct communities that strongly align with known biological annotations. Additionally, we infer a linear transformation that maps biochemical observables, such as histone marks, to the parameters of the generative graph model, enabling accurate genome-wide predictions of chromatin contact maps on out-of-sample data, both within the same cell line and on the completely unseen HCT116 cell line under RAD21 depletion. These findings highlight bioSBM's potential as a powerful tool for elucidating the relationship between biochemistry and chromatin architecture and predicting long-range genome organization from independent biochemical data.},
  author       = {Zhang, Chen Y and Rosa, Angelo and Sanguinetti, Guido},
  issn         = {2835-8279},
  journal      = {PRX Life},
  number       = {4},
  publisher    = {American Physical Society},
  title        = {{bioSBM: A random graph model to integrate epigenomic data in chromatin structure prediction}},
  doi          = {10.1103/gy1p-4256},
  volume       = {3},
  year         = {2025},
}

@article{21270,
  abstract     = {The one-dimensional Fröhlich model describing the motion of a single electron interacting with optical phonons is a paradigmatic model of quantum many-body physics. We predict the existence of an arbitrarily large number of bound excited states in the strong-coupling limit and calculate their excitation energies. Numerical simulations of a discretized model demonstrate the complete amelioration of the projector Monte Carlo sign problem by walker annihilation in an infinite Hilbert space. They reveal the threshold for the occurrence of the first bound excited states at a value of 𝛼≈1.73 for the dimensionless coupling constant. This puts the threshold into the regime of intermediate interaction strength. We find a significant spectral weight and increased phonon number of the bound excited state at threshold.},
  author       = {Taylor, J. and Čufar, M. and Mitrouskas, David Johannes and Seiringer, Robert and Pahl, E. and Brand, J.},
  issn         = {2469-9969},
  journal      = {Physical Review B},
  number       = {18},
  publisher    = {American Physical Society},
  title        = {{Bound excited states of Fröhlich polarons in one dimension}},
  doi          = {10.1103/s9p9-jflq},
  volume       = {112},
  year         = {2025},
}

@article{21271,
  abstract     = {For general non-Hermitian large random matrices X and deterministic deformation matrices A, we prove that the local eigenvalue statistics of A+X close to the typical edge points of its spectrum are universal. Furthermore, we show that, under natural assumptions, on A the spectrum of A+X does not have outliers at a distance larger than the natural fluctuation scale of the eigenvalues. As a consequence, the number of eigenvalues in each component of Spec(A+X) is deterministic.},
  author       = {Campbell, Andrew J and Cipolloni, Giorgio and Erdös, László and Ji, Hong Chang},
  issn         = {2168-894X},
  journal      = {The Annals of Probability},
  number       = {6},
  pages        = {2256--2308},
  publisher    = {Institute of Mathematical Statistics},
  title        = {{On the spectral edge of non-Hermitian random matrices}},
  doi          = {10.1214/25-aop1761},
  volume       = {53},
  year         = {2025},
}

@inproceedings{21272,
  abstract     = {Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a Monte Carlo (MC)-based algorithm that updates spins one at a time. Yet, these localized updates can cause the system to become trapped in local minima. Cluster algorithms (CAs) were developed to address this limitation and have demonstrated considerable success in studying ferromagnetic systems; however, they tend to encounter percolation issues when applied to generic spin glasses. In this work, we introduce a novel CA designed to tackle these challenges by leveraging precomputed two-point correlations, aiming solve combinatorial optimization problems in the form of Max-Cut more efficiently. In our approach, clusters are formed probabilistically based on these correlations. Various classical and quantum algorithms can be employed to generate correlations that embody information about the energy landscape of the problem. By utilizing this information, the algorithm aims to identify groups of spins whose simultaneous flipping induces large transitions in configuration space with high acceptance probability - even at low energy levels - thereby escaping local minima more effectively. Notably, clusters generated using correlations from the Quantum Approximate Optimization Algorithm exhibit high acceptance rates at low temperatures. These acceptance rates often increase with circuit depth, accelerating the algorithm and enabling more efficient exploration of the solution space.},
  author       = {Eder, Peter J. and Kerschbaumer, Aron and Finžgar, Jernej Rudi and Medina Ramos, Raimel A and Schuetz, Martin J. A. and Katzgraber, Helmut G. and Braun, Sarah and Mendl, Christian B.},
  booktitle    = {2025 IEEE International Conference on Quantum Computing and Engineering},
  location     = {Albuquerque, NM, United States},
  publisher    = {IEEE},
  title        = {{Quantum-guided cluster algorithms for combinatorial optimization}},
  doi          = {10.1109/qce65121.2025.00033},
  year         = {2025},
}

@inproceedings{21281,
  abstract     = {A strategy profile in a multi-player game is a Nash equilibrium if no player can unilaterally deviate to achieve a strictly better payoff. A profile is an ε-Nash equilibrium if no player can gain more than ε by unilaterally deviating from their strategy. In this work, we use ε-Nash equilibria to approximate the computation of Nash equilibria. Specifically, we focus on turn-based, multiplayer stochastic games played on graphs, where players are restricted to stationary strategies - strategies that use randomness but not memory.
The problem of deciding the constrained existence of stationary Nash equilibria - where each player’s payoff must lie within a given interval - is known to be ∃ℝ-complete in such a setting (Hansen and Sølvsten, 2020). We extend this line of work to stationary ε-Nash equilibria and present an algorithm that solves the following promise problem: given a game with a Nash equilibrium satisfying the constraints, compute an ε-Nash equilibrium that ε-satisfies those same constraints - satisfies the constraints up to an ε additive error. Our algorithm runs in FNP^NP time.
To achieve this, we first show that if a constrained Nash equilibrium exists, then one exists where the non-zero probabilities are at least an inverse of a double-exponential in the input. We further prove that such a strategy can be encoded using floating-point representations, as in the work of Frederiksen and Miltersen (2013), which finally gives us our FNP^NP algorithm. 
We further show that the decision version of the promise problem is NP-hard. Finally, we show a partial tightness result by proving a lower bound for such techniques: if a constrained Nash equilibrium exists, then there must be one where the probabilities in the strategies are double-exponentially small.},
  author       = {Asadi, Ali and Brice, Leonard and Chatterjee, Krishnendu and Thejaswini, K. S.},
  booktitle    = {45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
  isbn         = {9783959774062},
  location     = {Pilani, India},
  pages        = {9:1--9:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{ε-stationary Nash equilibria in multi-player stochastic graph games}},
  doi          = {10.4230/lipics.fsttcs.2025.9},
  volume       = {360},
  year         = {2025},
}

@unpublished{21309,
  abstract     = {The polarization of light is a critically under-utilized, rich source of information in astronomy. For stars in particular, surface magnetism polarization that can be detected and measured with spectro-polarimetry. Many questions about these surface fields remain unanswered due to a lack of dedicated instruments capable of probing weak and strong surface magnetic fields for the entire mass range of stars, from M-dwarfs (and even substellar objects) to massive O-type stars at different evolutionary stages and metallicities. These questions range from the origin of these fields to their true incidence rate throughout the stellar population and the dependence on metallicity. Magnetic fields, although currently often excluded from stellar evolution models, play an important role in stellar evolution. Connecting the surface fields to internal fields through asteroseismology will instigate a new era of understanding stellar evolution and the transport of angular momentum and chemical elements throughout stellar interiors, also impacting our understanding of star-planet interactions and stellar remnants. Polarimetry is also an under-utilized tool to observationally constrain the mode identification of nonradial oscillations, which lies at the basis of accurate asteroseismic parameter estimation at percentage-level for stellar radii, masses, ages, internal rotation, and magnetic field strengths. Combining strong constraints on mode identification and surface magnetic properties through the acquisition of time-resolved, high-resolution and high-signal-to-noise (S/N) spectro-polarimetry and spectroscopy promises to bring leaps forward in our understanding of stellar structure, particularly when combined with long-term space photometric data from past, current, and future missions.},
  author       = {Vandersnickt, J. and Armenta, R. Ochoa and Vanlaer, V. and A. David-Uraz, A. David-Uraz and Aerts, C. and Das, S. B. and Bouret, J. -C. and Bowman, D. M. and Bugnet, Lisa Annabelle and Khalack, V. and J. Labadie-Bartz, J. Labadie-Bartz and Mathis, S. and Nazé, Y. and Neiner, C. and Petit, P. and Petit, V. and K. Thomson-Paressant, K. Thomson-Paressant and Doorsselaere, T. Van and Vanrespaille, M.},
  booktitle    = {arXiv},
  title        = {{Expanding stellar horizons with polarized light}},
  doi          = {10.48550/arXiv.2512.15170},
  year         = {2025},
}

@article{21317,
  abstract     = {Accreting white dwarfs (WDs) in close binary systems, commonly known as cataclysmic variables (CVs), with orbital periods below the canonical period minimum (≈80 minutes) are rare. Such short periods can only be reached if the donor star in the CV is either significantly evolved before initiating mass transfer to the WD or is metal-poor. We present optical photometry and spectroscopy of Gaia19bxc, a high-amplitude variable identified as a polar CV with an exceptionally short orbital period of 64.42 minutes—well below the canonical CV period minimum. High-speed photometry confirms persistent double-peaked variability consistent with cyclotron beaming, thus indicating the presence of a magnetic WD. Phase-resolved Keck/Low-Resolution Imaging Spectrometer (LRIS) spectroscopy reveals strong hydrogen and helium emission lines but no donor features, indicating the accretor is a magnetic WD and the donor is hydrogen-rich, but cold and faint. The absence of a detectable donor and the low inferred temperature (≲3500 K) disfavor an evolved donor scenario. Instead, the short period and the system’s halo-like kinematics suggest Gaia19bxc may be the first known metal-poor polar. Because metal-poor donors are more compact than solar-metallicity donors of the same mass, they can reach shorter minimum periods. Gaia19bxc is one of only a handful of known metal-poor CVs below the canonical period minimum and has the shortest period of any such magnetic system discovered to date.},
  author       = {Galiullin, Ilkham and Rodriguez, Antonio C. and El-Badry, Kareem and Caiazzo, Ilaria and Szkody, Paula and Nagarajan, Pranav and Whitebook, Samuel},
  issn         = {2041-8213},
  journal      = {The Astrophysical Journal Letters},
  number       = {2},
  publisher    = {IOP Publishing},
  title        = {{Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor}},
  doi          = {10.3847/2041-8213/adff82},
  volume       = {990},
  year         = {2025},
}

@article{21318,
  abstract     = {Matter waves have been observed in double-slit experiments with microscopic objects, such as atoms or molecules. The wave function describing the motion of these objects must extend over a distance comparable to the slit separation, much larger than the characteristic size of the objects. Preparing such states for more massive objects, such as mechanical oscillators, remains an outstanding challenge. Here we delocalize the quantum ground state of an optically levitated nanosphere by modulating the stiffness of the confining potential. We show a more than threefold increase of the initial coherence length, which corresponds to mechanical momentum squeezing of more than 7 dB. Our work is a stepping stone toward the generation of coherence lengths comparable to the object size, a crucial regime for macroscopic quantum experiments.},
  author       = {Rossi, M. and Militaru, Andrei and Carlon Zambon, N. and Riera-Campeny, A. and Romero-Isart, O. and Frimmer, M. and Novotny, L.},
  issn         = {1079-7114},
  journal      = {Physical Review Letters},
  number       = {8},
  publisher    = {American Physical Society},
  title        = {{Quantum delocalization of a levitated nanoparticle}},
  doi          = {10.1103/2yzc-fsm3},
  volume       = {135},
  year         = {2025},
}

@article{21321,
  abstract     = {The development of cost-effective and high-performance thermoelectric (TE) materials faces significant challenges, particularly in improving the properties of promising copper-based TE materials such as Cu3SbSe4, which are limited by their poor electrical conductivity. This study presents a detailed comparative analysis of three strategies to promote the electrical transport properties of Cu3SbSe4 through Sn doping: conventional Sn atomic doping, surface treatment with SnSe molecular complexes, and blending with SnSe nanocrystals to form nanocomposites, all followed by annealing and hot pressing under identical conditions. Our results reveal that a surface treatment using SnSe molecular complexes significantly enhances TE performance over atomic doping and nanocomposite formation, achieving a power factor of 1.1 mW·m−1·K−2 and a maximum dimensionless figure of merit zT value of 0.80 at 640 K, representing an excellent performance among Cu3SbSe4-based materials produced via solution-processing methods. This work highlights the effectiveness of surface engineering in optimizing the transport properties of nanostructured materials, demonstrating the versatility and cost-efficiency of solution-based technologies in the development of advanced nanostructured materials for application in the field of TE among others.},
  author       = {Xiao, Shanshan and Zhao, Mingjun and Li, Mingquan and Wan, Shanhong and Genç, Aziz and Huang, Lulu and Chen, Lei and Zhang, Yu and Ibáñez, Maria and Lim, Khak Ho and Hong, Min and Liu, Yu and Cabot, Andreu},
  issn         = {1998-0000},
  journal      = {Nano Research},
  number       = {1},
  publisher    = {Tsinghua University Press},
  title        = {{Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>}},
  doi          = {10.26599/nr.2025.94907072},
  volume       = {18},
  year         = {2025},
}

@article{21322,
  abstract     = {Habitat fragmentation poses a significant risk to population survival, causing both demographic stochasticity and genetic drift within local populations to increase, thereby increasing genetic load. Higher load causes population numbers to decline, which reduces the efficiency of selection and further increases load, resulting in a positive feedback that may drive entire populations to extinction. Here, we investigate this eco-evolutionary feedback in a metapopulation consisting of local demes connected via migration, with individuals subject to deleterious mutation at a large number of loci. We first analyze the determinants of load under soft selection, where population sizes are fixed, and then build on this to understand hard selection, where population sizes and load coevolve. We show that under soft selection, very little gene flow (less than one migrant per generation) is enough to prevent fixation of deleterious alleles. By contrast, much higher levels of migration are required to mitigate load and prevent extinction when selection is hard, with critical migration thresholds for metapopulation persistence increasing sharply as the genome-wide deleterious mutation rate becomes comparable to the baseline population growth rate. Moreover, critical migration thresholds are highest if deleterious mutations have intermediate selection coefficients but lower if alleles are predominantly recessive rather than additive (due to more efficient purging of recessive load within local populations). Our analysis is based on a combination of analytical approximations and simulations, allowing for a more comprehensive understanding of the factors influencing load and extinction in fragmented populations.},
  author       = {Olusanya, Oluwafunmilola O and Khudiakova, Kseniia and Sachdeva, Himani},
  issn         = {1537-5323},
  journal      = {The American Naturalist},
  number       = {6},
  pages        = {617--636},
  publisher    = {University of Chicago Press},
  title        = {{Genetic load, eco-evolutionary feedback, and extinction in metapopulations}},
  doi          = {10.1086/735562},
  volume       = {205},
  year         = {2025},
}

@inproceedings{21323,
  abstract     = {We present a unifying framework for proving the knowledge-soundness of KZG-like polynomial commitment schemes, encompassing both univariate and multivariate variants. By conceptualizing the proof technique of Lipmaa, Parisella, and Siim for the univariate KZG scheme (EUROCRYPT 2024), we present tools and falsifiable hardness assumptions that permit black-box extraction of the multivariate KZG scheme. Central to our approach is the notion of a canonical Proof-of-Knowledge of a Polynomial (PoKoP) of a polynomial commitment scheme, which we use to capture the extractability notion required in constructions of practical zk-SNARKs. We further present an explicit polynomial decomposition lemma for multivariate polynomials, enabling a more direct analysis of interpolating extractors and bridging the gap between univariate and multivariate commitments. Our results provide the first standard-model proofs of extractability for the multivariate KZG scheme and many of its variants under falsifiable assumptions.},
  author       = {Belohorec, Juraj and Dvořák, Pavel and Hoffmann, Charlotte and Hubáček, Pavel and Mašková, Kristýna and Pastyřík, Martin},
  booktitle    = {45th Annual International Cryptology Conference},
  isbn         = {9783032018861},
  issn         = {1611-3349},
  location     = {Santa Barbara, CA, United States},
  pages        = {584--616},
  publisher    = {Springer Nature},
  title        = {{On extractability of the KZG family of polynomial commitment schemes}},
  doi          = {10.1007/978-3-032-01887-8_19},
  volume       = {16005},
  year         = {2025},
}

@inproceedings{21325,
  abstract     = {Test-time training (TTT) methods explicitly update the weights of a model to adapt to the specific test instance, and they have found success in a variety of settings, including most recently language modeling and reasoning. To demystify this success, we investigate a gradient-based TTT algorithm for in-context learning, where we train a transformer model on the in-context demonstrations provided in the test prompt. Specifically, we provide a comprehensive theoretical characterization of linear transformers when the update rule is a single gradient step. Our theory (i) delineates the role of alignment between pretraining distribution and target task, (ii) demystifies how TTT can alleviate distribution shift, and (iii) quantifies the sample complexity of TTT including how it can significantly reduce the eventual sample size required for in-context learning. As our empirical contribution, we study the benefits of TTT for TabPFN, a tabular foundation model. In line with our theory, we demonstrate that TTT significantly reduces the required sample size for tabular classification (3 to 5 times fewer) unlocking substantial inference efficiency with a negligible training cost.},
  author       = {Gozeten, Halil Alperen and Ildiz, Muhammed Emrullah and Zhang, Xuechen and Soltanolkotabi, Mahdi and Mondelli, Marco and Oymak, Samet},
  booktitle    = {Proceedings of the 42nd International Conference on Machine Learning},
  issn         = {2640-3498},
  location     = {Vancouver, Canada},
  pages        = {20266--20295},
  publisher    = {ML Research Press},
  title        = {{Test-time training provably improves transformers as in-context learners}},
  volume       = {267},
  year         = {2025},
}

@inproceedings{21327,
  abstract     = {Proteins exist as a dynamic ensemble of multiple conformations, and these motions are often crucial for their functions. However, current structure prediction methods predominantly yield a single conformation, overlooking the conformational heterogeneity revealed by diverse experimental modalities. Here, we present a framework for building experiment-grounded protein structure generative models that infer conformational ensembles consistent with measured experimental data. The key idea is to treat stateof-the-art protein structure predictors (e.g., AlphaFold3) as sequence-conditioned structural priors, and cast ensemble modeling as posterior inference of protein structures given experimental measurements. Through extensive real-data experiments, we demonstrate the generality of our method to incorporate a variety of experimental measurements. In particular, our framework uncovers previously unmodeled conformational heterogeneity from crystallographic densities, and generates high-accuracy NMR ensembles orders of magnitude faster than the status quo. Notably, we demonstrate that our ensembles outperform AlphaFold3 (Abramson et al., 2024) and sometimes better fit experimental data than publicly deposited structures to the Protein Data Bank (PDB, Burley et al. (2017)). We believe that this approach will unlock building predictive models that fully embrace experimentally observed conformational diversity.},
  author       = {Maddipatla, Sai A and Sellam, Nadav E and Bojan, Meital I and Vedula, Sanketh and Schanda, Paul and Marx, Ailie and Bronstein, Alexander},
  booktitle    = {Proceedings of the 42nd International Conference on Machine Learning},
  issn         = {2640-3498},
  location     = {Vancouver, Canada},
  pages        = {42366 -- 42393},
  publisher    = {ML Research Press},
  title        = {{Inverse problems with experiment-guided AlphaFold}},
  volume       = {267},
  year         = {2025},
}

@inproceedings{21328,
  abstract     = {Multi-index models provide a popular framework to investigate the learnability of functions with low-dimensional structure and, also due to their connections with neural networks, they have been object of recent intensive study. In this paper, we focus on recovering the subspace spanned by the signals via spectral estimators – a family of methods routinely used in practice, often as a warm-start for iterative algorithms. Our main technical contribution is a precise asymptotic characterization of the performance of spectral methods, when sample size and input dimension grow proportionally and the dimension p of the space to recover is fixed. Specifically, we locate the top-p eigenvalues of the spectral matrix and establish the overlaps between the corresponding eigenvectors (which give the spectral estimators) and a basis of the signal subspace. Our analysis unveils a phase transition phenomenon in which, as the sample complexity grows, eigenvalues escape from the bulk of the spectrum and, when that happens, eigenvectors recover directions of the desired subspace. The precise characterization we put forward enables the optimization of the data preprocessing, thus allowing to identify the spectral estimator that requires the minimal sample size for weak recovery.},
  author       = {Kovačević, Filip and Yihan, Zhang and Mondelli, Marco},
  booktitle    = {Proceedings of 38th Conference on Learning Theory},
  issn         = {2640-3498},
  location     = {Lyon, France},
  pages        = {3354--3404},
  publisher    = {ML Research Press},
  title        = {{Spectral estimators for multi-index models: Precise asymptotics and optimal weak recovery}},
  volume       = {291},
  year         = {2025},
}

@article{21413,
  abstract     = {We present a general framework for applying learning algorithms and heuristical guidance to the verification of Markov decision processes (MDPs).
The primary goal of our techniques is to improve performance by avoiding an exhaustive exploration of the state space, instead focussing on particularly relevant areas of the system, guided by heuristics. Our work builds on the previous results of Br{á}zdil et al., significantly extending it as well as refining several details and fixing errors.
The presented framework focuses on probabilistic reachability, which is a core problem in verification, and is instantiated in two distinct scenarios.
The first assumes that full knowledge of the MDP is available, in particular precise transition probabilities. It performs a heuristic-driven partial exploration of the model, yielding precise lower and upper bounds on the required probability. The second tackles the case where we may only sample the MDP without knowing the exact transition dynamics. Here, we obtain probabilistic guarantees, again in terms of both the lower and upper bounds, which provides efficient stopping criteria for the approximation. In particular, the latter is an extension of statistical model-checking (SMC) for unbounded properties in MDPs. In contrast to other related approaches, we do not restrict our attention to time-bounded (finite-horizon) or discounted properties, nor assume any particular structural properties of the MDP.},
  author       = {Brázdil, Tomáš and Chatterjee, Krishnendu and Chmelik, Martin and Forejt, Vojtěch and Kretinsky, Jan and Kwiatkowska, Marta and Meggendorfer, Tobias and Parker, David and Ujma, Mateusz},
  issn         = {2751-4838},
  journal      = {TheoretiCS},
  publisher    = {TheoretiCS Foundation},
  title        = {{Learning algorithms for verification of Markov decision processes}},
  doi          = {10.46298/theoretics.25.10},
  volume       = {4},
  year         = {2025},
}

@article{21431,
  abstract     = {Several optical experiments have shown that in magnetic materials, the principal axes of response tensors can rotate as an odd function of an applied magnetic field. Here we offer a microscopic explanation of this effect, and we propose a closely related dc transport phenomenon—an off-diagonal symmetric conductivity, linear and odd in a magnetic field, which we refer to as linear magnetoconductivity (LMC). Although LMC has the same functional dependence on a magnetic field as the Hall effect, its origin is fundamentally different: LMC requires time-reversal symmetry to be broken even before a magnetic field is applied, and is therefore a sensitive probe of magnetism. We demonstrate LMC in three different ways: via a tight-binding toy model, a density functional theory calculation on MnPSe3, and a semiclassical treatment. The third approach identifies two distinct mechanisms yielding LMC: momentum-dependent band magnetization and Berry curvature. Finally, we propose an experimental geometry suitable for detecting LMC, and we demonstrate its applicability using Landauer-Büttiker simulations. Our results emphasize the importance of measuring the full conductivity tensor in magnetic materials, and they introduce LMC as a new transport probe of symmetry.},
  author       = {Sunko, Veronika and Liu, C. and Vila, M. and Na, I. and Tang, Y. and Kozii, V. and Griffin, S. M. and Moore, J. E. and Orenstein, J.},
  issn         = {2469-9969},
  journal      = {Physical Review B},
  number       = {13},
  publisher    = {American Physical Society},
  title        = {{Linear magnetoconductivity as a probe of time-reversal symmetry breaking}},
  doi          = {10.1103/33ns-8gwj},
  volume       = {112},
  year         = {2025},
}