@article{22712, abstract = {Ginseng (Panax ginseng) derives its renowned therapeutic properties from ginsenoside metabolites. However, the long cultivation cycle and susceptibility to diseases hinder the advancement of the ginseng industry. Here, we demonstrate that the embryonic protoderm of ginseng can efficiently produce ginsenosides. Single-cell transcriptome and mass spectrometry imaging analyses reveal that ginsenosides accumulate in the protoderm of ginseng embryonic callus (EC) at levels comparable to those in forest ginseng. Epigenetic analyses indicate that elevated histone acetylation and enhanced chromatin accessibility at regeneration- and ginsenoside metabolism-related gene loci are associated with the ginsenoside-producing capacity of EC. Increasing histone acetylation levels or overexpressing the regeneration-related WUSCHEL-RELATED HOMEOBOX11 (WOX11) gene further enhances ginsenoside production in EC. Our findings suggest that the protoderm of EC could serve as an in situ biological compartment for high-efficiency ginsenoside producion, offering a complementary approach to traditional ginseng cultivation.}, author = {Liu, Juan and Zhai, Ning and Zhang, Shiyi and Tamada, Yosuke and Li, Tonghui and Zhang, Linfan and Chen, Tong and Wang, Chenglin and Yang, Jian and Gao, Jiaqi and Li, Xiang and Zhou, Junhui and Zhang, Yonghong and Liu, Yu and Wang, Yuan and Friml, Jiří and Benková, Eva and Li, Chen and Xu, Lin and Huang, Luqi}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Single-cell analyses identify the ginseng embryonic protoderm as a native compartment for high-efficiency ginsenoside production}}, doi = {10.1038/s41467-026-74881-5}, volume = {17}, year = {2026}, } @article{22711, abstract = {When charge flows through a molecular circuit, it induces a magnetic field that allows the circuit to behave as a nanoscale electromagnet. However, in single-molecule circuits this magnetic field is usually weak. Here we show that radially π-conjugated carbon structures can support amplified circulating currents that generate local magnetic fields. Within tight-binding and density functional theory (DFT) frameworks, we first study cycloparaphenylene (CPP) junctions where both electrodes are attached to the same phenylene unit on the nanohoop. We observe an energy-dependent ring current component that traverses the whole macrocycle by mapping the local current density. Importantly, we find that destructive interference near degenerate resonances can reverse the ring current direction and amplify it strongly relative to the source–drain current. We show that this interference-driven design principle is general, and also carries over to C60 junctions. In fullerene, lower-lying degenerate resonances are more easily accessible through electrostatic gating, reaching a magnetic field of 14.2 mT under a 100 mV source–drain bias. This work thus provides new insights into ring currents in radially π-conjugated carbon structures and highlights their potential as design platforms for single-molecule electromagnets.}, author = {Shi, Wanzhuo and Korytár, Richard and Evers, Ferdinand and Tovar, John D. and Venkataraman, Latha}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Designing effective single-molecule electromagnets with radially π-conjugated carbon structures}}, doi = {10.1038/s41467-026-74365-6}, volume = {17}, year = {2026}, } @misc{22687, abstract = {Understanding enzyme function requires characterizing not only static structure but also dynamics and ligand interactions. NMR spectroscopy provides this insight at atomic resolution, yet for large proteins the difficulty of resonance assignment has largely confined such studies to systems below ∼50 kDa, or to observing only methyl groups. Here we present an integrated magic-angle spinning (MAS) and solution NMR study of the 134 kDa tetrameric malate dehydrogenase from Ignicoccus islandicus (IiMDH), an enzyme of particular interest as an evolutionary intermediate between allosteric lactate dehydrogenases and non-allosteric malate dehydrogenases. By combining high-dimensional (up to 4D) MAS NMR experiments on sedimented protein with solution NMR, we achieved 92% backbone heavy- atom assignment and 91% assignment of all Ile-δ1, Leu-δ1/-δ2, Val-γ1/-γ2, Met-ε and Thr-γ methyl groups. Building on these assignments, we use various probes of backbone and sidechain dynamics: elevated MAS NMR 15N rotating-frame relaxation (R1ρ) points to microsecond motions in functionally critical regions, including the catalytic loop and the mobile surface loop. Complementary methyl-axis order parameters from solution NMR identified additional flexible sites in the hydrophobic core. Chemical shift perturbation experiments upon addition of the substrate analogue oxamate, monitored via backbone 1H-15N TROSY, revealed both active-site contacts and responses in helices α2F and α3G, regions implicated in allosteric signal transmission. The integrated approach demonstrated here exploits the distinct strengths of MAS and solution NMR, and provides a comprehensive view of structure, dynamics, and substrate interactions in a large oligomeric enzyme that would not be accessible by either technique alone.}, author = {Schanda, Paul and Napoli, Federico}, publisher = {Institute of Science and Technology Austria}, title = {{Data and scripts for: "Integrated solid/solution NMR assignment allows mapping dynamics and ligand binding in a 134 kDa enzyme"}}, doi = {10.15479/AT-ISTA-22687}, year = {2026}, } @article{21746, abstract = {As vertebrates transitioned from water to land, locomotion shifted from undulatory swimming to limb-based movement. How spinal circuits and their cell types evolved to support this transition remains unclear. We leverage frog metamorphosis, which recapitulates this transition within a single organism, to define how spinal circuits generate aquatic versus terrestrial motor patterns. At swim stages, spinal architecture is uniform, with a transcriptionally and anatomically homogeneous motor and interneurons. As limbs develop and their movement complexifies, spinal circuits expand in neuron number and subtype diversity. This expansion is most pronounced for V1 inhibitory neurons, which increase ∼70-fold and diversify into transcriptionally distinct subtypes. Disrupting transcription factors defining emerging motor and V1 populations reveals molecular segregation between swim and limb circuits, highlighting the role of subtype diversity in motor coordination. A multifold increase in inhibitory neuron diversity thus underlies the tail-to-limb locomotor transition, providing a framework for spinal circuit adaptation during vertebrate evolution.}, author = {Vijatovic, David and Toma, Florina Alexandra and Ignatyev, Y and Harrington, Zoe P and Sommer, Christoph M and Hauschild, Robert and Smits, Matthijs Geert and Dalla Vecchia, Marco and Trevisan, Alexandra J. and Chapman, Phillip and Julseth, Mara and Brenner-Morton, Susan and Gabitto, Mariano I. and Dasen, Jeremy S. and Bikoff, Jay B. and Sweeney, Lora Beatrice Jaeger}, issn = {2211-1247}, journal = {Cell Reports}, number = {4}, publisher = {Elsevier}, title = {{Multifold increase in spinal inhibitory cell types with emergence of limb movement}}, doi = {10.1016/j.celrep.2026.117227}, volume = {45}, year = {2026}, } @phdthesis{22664, abstract = {The widespread adoption of apps like Whatsapp and Signal has translated into billions of people all around the world communicating on a regular basis by making use of services that offer end-to-end encryption and even provide security guarantees when a user's device is compromised. This was made possible by the introduction of the Double Ratchet Algorithm~\cite{double_ratchet}, which was designed for a setting where communication takes place between two parties. However, in practice, many apps offer the possibility of creating groups. The protocols they use to secure communication are inefficient for large group which has the undesireable consequence that the aforementioned apps have established limits on the group size of roughly 1000 users. This has motivated the introduction of the Messaging Layer Security (MLS) standard~\cite{rfc9420} by the IETF which is based on a primitive called Continuous Group Key Agreement (CGKA)~\cite{C:ACDT20}. This primitive allows a group of users to maintain a shared secret key that is frequently rotated by the group members in order to change group membership, achieve forward secrecy (FS) and post compromise security (PCS). Most protocols are based on binary trees where the nodes are associated to a pair formed by public key and a secret key. Each leaf corresponds to one of the group members and a user knows the secret keys associated to nodes along the path from their leaf to the root. When a user wants to update their key material they have to change $ \log(N) $ many keys. This requires uploading $ \log(N) $ many ciphertexts to communicate the new keys to the rest of the group members in a way that respects the tree structure. In this thesis we study how much communication between group members is required in order to add and remove users from a group as well as in order to provide PCS when we consider CGKAs built using standard cryptographic primitives like pseudo-random functions and public-key encryption. Furthermore, we also consider the case of MLS and provide the first lower bound showing that its communication complexity is much worse than previously believed, i.e., it is very far from $ \log(N) $. Finally, we also propose a variant of MLS which provably achieves the same security properties with a much lower communication cost.}, author = {Cueto Noval, Miguel}, isbn = { 978-3-99078-087-9}, issn = {2663-337X}, pages = {187}, publisher = {Institute of Science and Technology Austria}, title = {{Towards efficient secure group messaging}}, doi = {10.15479/AT-ISTA-22664}, year = {2026}, } @phdthesis{22694, abstract = {We develop and employ techniques from equivariant algebraic K-theory and related invariants in the context of geometric representation theory, in both arithmetic and topological situations. We showcase the use of such techniques on the affine Grassmannian Gr, a space of fundamental interest in the geometric Langlands program. It is a deep development of mathematics of the last century that many concrete, yet combina- torially complex algebraic problems may be effectively studied through the lens of algebraic geometry. The objects of interest can be often realized as cohomological invariants of algebraic varieties, and good understanding of their geometry sheds light into the original questions. Such techniques have seen immense applications in the Langlands program, where they go under the label of geometric representation theory. One source of powerful invariants in algebraic geometry comes from algebraic K-theory, Hochschild homology, and their relatives. These localizing invariants contain large amount of information, but are quite hard to compute. For this reason, their usage in geometric representation theory has been limited. The aim of this thesis is to showcase how to control such invariants in the situations of interest and use them to obtain new insights. We start by reinterpreting equivariant Hochschild homology in terms of functions on certain fixed-point schemes, which are of independent interest. We compare it to equivariant K-theory via the trace map. We give new computations and comparisons of such invariants of affine Schubert varieties in Gr, including arithmetic situations. We show that they behave much better than expected. We finally utilize this circle of ideas in a purely topological setting. We describe the varying fixed points of the extended torus action on the affine Grassmannian, and use it to compute its equivariant topological K-theory ring. The answer is nontrivial and verifies an outstanding conjecture in the subject. We compare, partly conjecturally, the resulting K-theory ring to the completed center of an integral even hybrid quantum group and its deformed quantum category O. This gives a genuine application of our computations in pure representation theory.}, author = {Löwit, Jakub}, issn = {2663-337X}, pages = {185}, publisher = {Institute of Science and Technology Austria}, title = {{Equivariant K-theory of affine Grassmannians in representation theory and arithmetic}}, doi = {10.15479/AT-ISTA-22694}, year = {2026}, } @article{21751, abstract = {We define a certain class of simple varieties over a field k by a constructive recipe and show how to control their (equivariant) truncating invariants. Consequently, we prove that on simple varieties: (i) if k = k and char k = p, the p-adic cyclotomic trace is an equivalence; (ii) if k = Q, the Goodwillie–Jones trace is an isomorphism in degree zero; (iii) we can control homotopy invariant K-theory KH, which is equivariantly formal and determined by its topological counterparts. Simple varieties are quite special, but encompass important singular examples appearing in geometric representation theory. We, in particular, show that both finite and affine Schubert varieties for GLn lie in this class, so all the above results hold for them. }, author = {Löwit, Jakub}, issn = {1687-0247}, journal = {International Mathematics Research Notices}, number = {7}, publisher = {Oxford University Press}, title = {{Equivariant localizing invariants of simple varieties}}, doi = {10.1093/imrn/rnag058}, volume = {2026}, year = {2026}, } @article{22693, abstract = {We study torus-equivariant algebraic K-theory of affine Schubert varieties in the perfect affine Grassmannians over Fp. We further compare it to the torus-equivariant Hochschild homology of perfect complexes, which has a geometric description in terms of global functions on certain fixed-point schemes. We prove that Fp-linearly, this comparison is an isomorphism. Our approach is quite constructive, resulting in new computations of these K-theory rings. We establish various structural results for equivariant perfect algebraic K-theory on the way; we believe these are of independent interest.}, author = {Löwit, Jakub}, issn = {1431-0643}, journal = {Documenta Mathematica}, keywords = {equivariant algebraic K-theory, perfection in positive characteristic, affine Grassmannian, affine Schubert varieties, Dennis trace map, equivariant Hochschild homology, fixed-point schemes, toric varieties}, publisher = {EMS Press}, title = {{Equivariant K-theory, affine Grassmannian and perfection}}, doi = {10.4171/dm/1064}, year = {2026}, } @phdthesis{22684, abstract = {Contact electrification (CE) is a simple yet elusive phenomenon that occurs when two materials come into contact and separate, leaving behind net electrical charge. Despite its ubiquity, the microscopic origin of CE remains unclear. In this thesis, we investigate CE from three complementary perspectives: developing a quantitative method to measure charge at the nanoscale, exploring the dynamic behavior of charge on insulating surfaces, and uncovering the role of mechanical history in forming a triboelectric series. In the first part, we establish a rigorous framework for converting qualitative Kelvin probe force microscopy (KPFM) voltage maps into quantitative charge density distributions. Using finite element method (FEM) simulations, we determine the point-spread function of the KPFM tip–sample geometry and demonstrate that the true surface charge can be reconstructed by numerical deconvolution. This procedure enables the recovery of both the magnitude and sign of charge density with high fidelity, resolving nanoscale features that are otherwise obscured. Applying the method to contact-charged SiO$_2$ surfaces, we show that existing analytical approximations, such as parallel plate or spherical models, can miscalculate charge magnitude by orders of magnitude. Our hybrid FEM/KPFM approach therefore provides a fast and general method to convert qualitative KPFM signals into quantitative charge data, enabling nanoscale charge mapping under realistic experimental conditions. In the second part, we study the temporal stability of CE-induced charges and identify the key material factors that determine whether KPFM can capture meaningful charge patterns. Through time-resolved experiments combining a custom-built transfer system with both microscopic and macroscopic measurements, we demonstrate that only the best insulators, such as SiO$_2$, preserve CE charge long enough for stationary imaging. For less conductive polymers, such as PDMS, charge decays within the duration of a single KPFM scan due to bulk conduction. Using a simple capacitor-based model, we reproduce the observed decay dynamics and confirm that the transferred charge decays characteristic to the sample's bulk conductivity. Further, we always observe homogeneous charge transfer. In the third part, we address the question: can we form a triboelectric series with identical materials? Using controlled repetitive contact experiments, we show that nominally identical materials can progressively order themselves into a triboelectric series, where surfaces with more contact history charge negatively relative to fresher ones. By constructing a minimal model based on this ``contact bias'', we replicate the evolution from random to ordered charging observed in experiments. Supporting surface analyses, including atomic force microscopy, reveal that repeated contact induces nanoscale morphological changes, suggesting a mechanism tightly coupled to mechanical strain. These results highlight the crucial role of surface history and nanoscale mechanics in dictating charge transfer, motivating further exploration of mechanisms such as mechanochemical bond cleavage and flexoelectric polarization.}, author = {Pertl, Felix}, isbn = {978-3-99078-083-1}, issn = {2663-337X}, pages = {107}, publisher = {Institute of Science and Technology Austria}, title = {{Experimental probing of nanoscale charge features and surface morphology changes during tribocharging}}, doi = {10.15479/AT-ISTA-22684}, year = {2026}, } @phdthesis{22745, author = {Michalik, David}, issn = {2663-337X}, pages = {182}, publisher = {Institute of Science and Technology Austria}, title = {{Mechanistic insights into MDA5 selectivity and regulation}}, doi = {10.15479/AT-ISTA-22745}, year = {2026}, } @phdthesis{22735, author = {Lin, Peipeng}, isbn = {978-3-99078-088-6}, issn = {2663-337X}, pages = {88}, publisher = {Institute of Science and Technology Austria}, title = {{Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses}}, doi = {10.15479/AT-ISTA-22735}, year = {2026}, } @article{21762, abstract = {Bacteria, like eukaryotes, use conserved cytoskeletal systems for intracellular organization. The plasmid-encoded ParMRC system forms actin-like filaments that segregate low–copy number plasmids. In multicellular cyanobacteria such as Anabaena sp., we found that a chromosomally encoded ParMR system has evolved into a cytoskeletal system named CorMR with a function in cell shape control rather than DNA segregation. Live-cell imaging, in vitro reconstitution, and cryo–electron microscopy revealed that CorM formed dynamically unstable, antiparallel double-stranded filaments that were recruited to the membrane by CorR through an amphipathic helix conserved in multicellular cyanobacteria. CorMR filaments were regulated by MinC, which excluded them from the poles and division plane. Comparative genomics indicated that the repurposing of ParMR and Min systems coevolved with cyanobacterial multicellularity, highlighting the evolutionary plasticity of cytoskeletal systems in bacteria.}, author = {Springstein, Benjamin L and Javoor, Manjunath and Megrian, Daniela and Hajdu, Roman and Hanke, Dustin M. and Zens, Bettina and Weiss, Gregor L. and Schur, Florian Km and Loose, Martin}, issn = {1095-9203}, journal = {Science}, number = {6795}, publisher = {AAAS}, title = {{Repurposing of a DNA segregation machinery into a cytoskeletal system controlling cell shape}}, doi = {10.1126/science.aea6343}, volume = {392}, year = {2026}, } @phdthesis{22744, author = {Javoor, Manjunath}, isbn = {978-3-99078-090-9 }, issn = {2663-337X}, keywords = {Actin cytoskeleton, Cell migration, cryo-electron tomography}, pages = {121}, publisher = {Institute of Science and Technology Austria }, title = {{Large-scale imaging of cellular actin networks at single filament resolution using montage cryo-electron tomography}}, doi = {10.15479/AT-ISTA-22744}, year = {2026}, } @phdthesis{22667, author = {Vijatovic, David}, isbn = {978-3-99078-082-4}, issn = {2663-337X}, pages = {172}, publisher = {Institute of Science and Technology Austria}, title = {{Dissecting the molecular and functional basis of motor control in the frog Xenopus laevis}}, doi = {10.15479/AT-ISTA-22667}, year = {2026}, } @misc{22777, author = {Tong, Xin}, publisher = {Institute of Science and Technology Austria}, title = {{Towards a deeper understanding of meroblastic cleavage - supplementary movies}}, doi = {10.15479/AT-ISTA-22777}, year = {2026}, } @article{18706, abstract = {We prove discrete-to-continuum convergence for dynamical optimal transport on Zd -periodic graphs with cost functional having linear growth at infinity. This result provides an answer to a problem left open by Gladbach, Kopfer, Maas, and Portinale (Calc Var Partial Differential Equations 62(5), 2023), where the convergence behaviour of discrete boundary-value dynamical transport problems is proved under the stronger assumption of superlinear growth. Our result extends the known literature to some important classes of examples, such as scaling limits of 1 -Wasserstein transport problems. Similarly to what happens in the quadratic case, the geometry of the graph plays a crucial role in the structure of the limit cost function, as we discuss in the final part of this work, which includes some visual representations.}, author = {Portinale, Lorenzo and Quattrocchi, Filippo}, issn = {1469-4425}, journal = {European Journal of Applied Mathematics}, keywords = {optimal transport, discrete-to-continuum, homogenisation, linear growth, gamma-convergence}, number = {3}, pages = {614--642}, publisher = {Cambridge University Press}, title = {{Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs}}, doi = {10.1017/s0956792524000810}, volume = {37}, year = {2026}, } @inproceedings{22007, abstract = {Truncation of cryptographic outputs is a technique that was recently introduced in Baldimtsi et al. [Foteini Baldimtsi et al., 2022]. The general idea is to try out many inputs to some cryptographic algorithm until the output (e.g. a public-key or some hash value) falls into some sparse set and thus can be compressed: by trying out an expected 2^k different inputs one will find an output that starts with k zeros. Using such truncation one can for example save substantial gas fees on Blockchains where storing values is very expensive. While [Foteini Baldimtsi et al., 2022] show that truncation preserves the security of the underlying primitive, they only consider a setting without preprocessing. In this work we show that lower bounds on the time-space tradeoff for inverting random functions and permutations also hold with truncation, except for parameters ranges where the bound fails to hold for "trivial" reasons. Concretely, it’s known that any algorithm that inverts a random function or permutation with range N making T queries and using S bits of auxiliary input must satisfy S⋅ T ≥ Nlog N. This lower bound no longer holds in the truncated setting where one must only invert a challenge from a range of size N/2^k, as now one can simply save the replies to all N/2^k challenges, which requires S = log N⋅ N /2^k bits and allows to invert with T = 1 query. We show that with truncation, whenever S is somewhat smaller than the log N⋅ N /2^k bits required to store the entire truncated function table, the known S⋅ T ≥ Nlog N lower bound applies.}, author = {Pietrzak, Krzysztof Z and Wang, Pengxiang}, booktitle = {6th Conference on Information-Theoretic Cryptography}, isbn = {9783959773850}, issn = {1868-8969}, keywords = {Time-Space Lower Bounds, Blockchains}, location = {Santa Barbara, CA, United States}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Time-space tradeoffs of truncation with preprocessing}}, doi = {10.4230/LIPIcs.ITC.2025.4}, volume = {343}, year = {2025}, } @article{12662, abstract = {Modern machine learning tasks often require considering not just one but multiple objectives. For example, besides the prediction quality, this could be the efficiency, robustness or fairness of the learned models, or any of their combinations. Multi-objective learning offers a natural framework for handling such problems without having to commit to early trade-offs. Surprisingly, statistical learning theory so far offers almost no insight into the generalization properties of multi-objective learning. In this work, we make first steps to fill this gap: We establish foundational generalization bounds for the multi-objective setting as well as generalization and excess bounds for learning with scalarizations. We also provide the first theoretical analysis of the relation between the Pareto-optimal sets of the true objectives and the Pareto-optimal sets of their empirical approximations from training data. In particular, we show a surprising asymmetry: All Pareto-optimal solutions can be approximated by empirically Pareto-optimal ones, but not vice versa.}, author = {Súkeník, Peter and Lampert, Christoph}, issn = {1433-3058}, journal = {Neural Computing and Applications}, pages = {24669–24683}, publisher = {Springer Nature}, title = {{Generalization in multi-objective machine learning}}, doi = {10.1007/s00521-024-10616-1}, volume = {37}, year = {2025}, } @inproceedings{20820, abstract = {The high computational costs of large language models (LLMs) have led to a flurry of research on LLM compression, via methods such as quantization, sparsification, or structured pruning. A new frontier in this area is given by dynamic, non-uniform compression methods, which adjust the compression levels (e.g., sparsity) per-block or even per-layer in order to minimize accuracy loss, while guaranteeing a global compression threshold. Yet, current methods rely on estimating the "importance" of a given layer, implicitly assuming that layers contribute independently to the overall compression error. We begin from the motivating observation that this independence assumption does not generally hold for LLM compression: pruning a model further may even significantly recover performance. To address this, we propose EvoPress, a novel evolutionary framework for dynamic LLM compression. By formulating dynamic compression as a general optimization problem, EvoPress identifies optimal compression profiles in a highly efficient manner, and generalizes across diverse models and compression techniques. Via EvoPress, we achieve state-of-the-art performance for dynamic compression of Llama, Mistral, and Phi models, setting new benchmarks for structural pruning (block/layer dropping), unstructured sparsity, and quantization with dynamic bitwidths.}, author = {Sieberling, Oliver and Kuznedelev, Denis and Kurtic, Eldar and Alistarh, Dan-Adrian}, booktitle = {42nd International Conference on Machine Learning}, issn = {2640-3498}, location = {Vancouver, Canada}, pages = {55556--55590}, publisher = {ML Research Press}, title = {{EvoPress: Accurate dynamic model compression via evolutionary search}}, volume = {267}, year = {2025}, } @inproceedings{20821, abstract = {Modern deep neural networks exhibit heterogeneity across numerous layers of various types such as residuals, multi-head attention, etc., due to varying structures (dimensions, activation functions, etc.), distinct representation characteristics, which impact predictions. We develop a general layer-wise quantization framework with tight variance and code-length bounds, adapting to the heterogeneities over the course of training. We then apply a new layer-wise quantization technique within distributed variational inequalities (VIs), proposing a novel Quantized Optimistic Dual Averaging (QODA) algorithm with adaptive learning rates, which achieves competitive convergence rates for monotone VIs. We empirically show that QODA achieves up to a 150% speedup over the baselines in end-to-end training time for training Wasserstein GAN on 12+GPUs.}, author = {Nguyen, Anh Duc and Markov, Ilia and Wu, Frank Zhengqing and Ramezani-Kebrya, Ali and Antonakopoulos, Kimon and Alistarh, Dan-Adrian and Cevher, Volkan}, booktitle = {42nd International Conference on Machine Learning}, issn = {2640-3498}, location = {Vancouver, Canada}, pages = {46026--46072}, publisher = {ML Research Press}, title = {{Layer-wise quantization for quantized optimistic dual averaging}}, volume = {267}, year = {2025}, }