Publications

Many of the important phases observed in twisted transition metal dichalcogenide homobilayers are driven by short-range interactions, which should be captured by a local tight binding description since no Wannier obstruction exists for these systems. Yet, published theoretical descriptions have been mutually inconsistent, with honeycomb lattice tight binding models adopted for some twist angles, triangular lattice models adopted for others, and with tight binding models forsaken in favor of band projected continuum models in many numerical simulations. Here, we derive and study a minimal model containing both honeycomb orbitals and a triangular site that represents the band physics across a wide range of twist angles. The model provides a natural basis to study the interplay of interaction and topology in these heterostructures. It elucidates from generic features of the bilayer the sequence of Chern numbers occurring as twist angle is varied, and the microscopic origin of the magic angle at which flat-band physics occurs. At integer filling, the model successfully captures the Chern ferromagnetic and van-Hove driven antiferromagnetic insulators experimentally observed for small and large angles, respectively, and allows a straightforward calculation of the magneto-electric properties of the system.

Many of the important phases observed in twisted transition metal dichalcogenide homobilayers are driven by short-range interactions, which should be captured by a local tight binding description since no Wannier obstruction exists for these systems. Yet, published theoretical descriptions have been mutually inconsistent, with honeycomb lattice tight binding models adopted for some twist angles, triangular lattice models adopted for others, and with tight binding models forsaken in favor of band projected continuum models in many numerical simulations. Here, we derive and study a minimal model containing both honeycomb orbitals and a triangular site that represents the band physics across a wide range of twist angles. The model provides a natural basis to study the interplay of interaction and topology in these heterostructures. It elucidates from generic features of the bilayer the sequence of Chern numbers occurring as twist angle is varied, and the microscopic origin of the magic angle at which flat-band physics occurs. At integer filling, the model successfully captures the Chern ferromagnetic and van-Hove driven antiferromagnetic insulators experimentally observed for small and large angles, respectively, and allows a straightforward calculation of the magneto-electric properties of the system.

The Anderson overlap catastrophe (AOC) is a many-body effect arising as a result of a shakeup of a Fermi sea due to an abrupt change of a local potential, leading to a power-law dependence of the density of states on energy. Here we demonstrate that a standard quantum-dot detector can be employed as a highly tuneable probe of the AOC, where the power law can be continuously modified by a gate voltage. We show that signatures of the AOC have already appeared in previous experiments, and give explicit predictions allowing to tune and pinpoint their non-perturbative aspects.

Including the effect of lattice anharmonicity on electron-phonon interactions has recently garnered attention due to its role as a necessary and significant component in explaining various phenomena, including superconductivity, optical response, and temperature dependence of mobility. This study focuses on analytically treating the effects of anharmonic electron-phonon coupling on the polaron self-energy, combined with numerical Diagrammatic Monte Carlo data. Specifically, we incorporate a quadratic interaction into the method of squeezed phonon states, which has proven effective for analytically calculating the polaron parameters. Additionally, we extend this method to nonparabolic finite-width conduction bands while maintaining the periodic translation symmetry of the system. Our results are compared with those obtained from Diagrammatic Monte Carlo, partially reported in a recent study [S. Ragni et al., Phys. Rev. B 107, L121109(2023)], covering a wide range of coupling strengths for the nonlinear interaction. Remarkably, our analytic method predicts the same features as the Diagrammatic Monte Carlo simulation.

Biomolecules undergo conformational changes to perform their function. Cryo-electron microscopy (cryo-EM) can capture snapshots of biomolecules in various conformations. However, these images are noisy and display the molecule in unknown orientations, making it difficult to separate conformational differences from differences due to noise or projection directions. Here, we introduce cryo-EM simulation-based inference (cryoSBI) to infer the conformations of biomolecules and the uncertainties associated with the inference from individual cryo-EM images. CryoSBI builds on simulation-based inference, a combination of physics-based simulations and probabilistic deep learning, allowing us to use Bayesian inference even when likelihoods are too expensive to calculate. We begin with an ensemble of conformations, which can be templates from molecular simulations or modelling, and use them as structural hypotheses. We train a neural network approximating the Bayesian posterior using simulated images from these templates, and then use it to accurately infer the conformations of biomolecules from experimental images. Training is only done once, and after that, it takes just a few milliseconds to make inference on an image, making cryoSBI suitable for arbitrarily large datasets. CryoSBI eliminates the need to estimate particle pose and imaging parameters, significantly enhancing the computational speed in comparison to explicit likelihood methods. We illustrate and benchmark cryoSBI on synthetic data and showcase its promise on experimental single-particle cryo-EM data.

Recent developments in parallel Markov chain Monte Carlo (MCMC) algorithms allow us to run thousands of chains almost as quickly as a single chain, using hardware accelerators such as GPUs. While each chain still needs to forget its initial point during a warmup phase, the subsequent sampling phase can be shorter than in classical settings, where we run only a few chains. To determine if the resulting short chains are reliable, we need to assess how close the Markov chains are to their stationary distribution after warmup. The potential scale reduction factor Rˆ is a popular convergence diagnostic but unfortunately can require a long sampling phase to work well. We present a nested design to overcome this challenge and a generalization called nested Rˆ. This new diagnostic works under conditions similar to Rˆ and completes the workflow for GPU-friendly samplers. In addition, the proposed nesting provides theoretical insights into the utility of Rˆ, in both classical and short-chains regimes.

Training a modern machine learning architecture on a new task requires extensive learning-rate tuning, which comes at a high computational cost. Here we develop new Polyak-type adaptive learning rates that can be used on top of any momentum method, and require less tuning to perform well. We first develop MoMo, a Momentum Model based adaptive learning rate for SGD-M (stochastic gradient descent with momentum). MoMo uses momentum estimates of the batch losses and gradients sampled at each iteration to build a model of the loss function. Our model also makes use of any known lower bound of the loss function by using truncation, e.g. most losses are lower-bounded by zero. The models is then approximately minimized at each iteration to compute the next step. We show how MoMo can be used in combination with any momentum-based method, and showcase this by developing MoMo-Adam - which is Adam with our new model-based adaptive learning rate. We show that MoMo attains a $\mathcal{O}(1/\sqrt{K})$ convergence rate for convex problems with interpolation, needing knowledge of no problem-specific quantities other than the optimal value. Additionally, for losses with unknown lower bounds, we develop on-the-fly estimates of a lower bound, that are incorporated in our model. We demonstrate that MoMo and MoMo-Adam improve over SGD-M and Adam in terms of robustness to hyperparameter tuning for training image classifiers on MNIST, CIFAR, and Imagenet, for recommender systems on the Criteo dataset, for a transformer model on the translation task IWSLT14, and for a diffusion model.

Active fluids display spontaneous turbulent-like flows known as active turbulence. Recent work revealed that these flows have universal features, independent of the material properties and of the presence of topological defects. However, the differences between defect-laden and defect-free active turbulence remain largely unexplored. Here, by means of large-scale numerical simulations, we show that defect-free active nematic turbulence can undergo dynamical arrest. We find that flow alignment -- the tendency of nematics to reorient under shear -- enhances large-scale jets in contractile rodlike systems while promoting arrested flow patterns in extensile systems. Our results reveal a mechanism of labyrinthine pattern formation produced by an emergent topology of nematic domain walls that partially suppresses chaotic flows. Taken together, our findings call for the experimental realization of defect-free active nematics, and suggest that topological defects enable turbulence by preventing dynamical arrest.

Most variance reduction methods require multiple times of full gradient computation, which is time-consuming and hence a bottleneck in application to distributed optimization. We present a single-loop variance-reduced gradient estimator named SILVER (SIngle-Loop VariancE-Reduction) for the finite-sum non-convex optimization, which does not require multiple full gradients but nevertheless achieves the optimal gradient complexity. Notably, unlike existing methods, SILVER provably reaches second-order optimality, with exponential convergence in the Polyak-Łojasiewicz (PL) region, and achieves further speedup depending on the data heterogeneity. Owing to these advantages, SILVER serves as a new base method to design communication-efficient federated learning algorithms: we combine SILVER with local updates which gives the best communication rounds and number of communicated gradients across all range of Hessian heterogeneity, and, at the same time, guarantees second-order optimality and exponential convergence in the PL region.

This work focuses on the training dynamics of one associative memory module storing outer products of token embeddings. We reduce this problem to the study of a system of particles, which interact according to properties of the data distribution and correlations between embeddings. Through theory and experiments, we provide several insights. In overparameterized regimes, we obtain logarithmic growth of the “classification margins.” Yet, we show that imbalance in token frequencies and memory interferences due to correlated embeddings lead to oscillatory transitory regimes. The oscillations are more pronounced with large step sizes, which can create benign loss spikes, although these learning rates speed up the dynamics and accelerate the asymptotic convergence. We also find that underparameterized regimes lead to suboptimal memorization schemes. Finally, we assess the validity of our findings on small Transformer models.