Related papers: Tuning and jamming reduced to their minima
The requirement to repeatedly move large feature maps off- and on-chip during inference with convolutional neural networks (CNNs) imposes high costs in terms of both energy and time. In this work we explore an improved method for…
In this work, we investigate the unjamming transition in a three-dimensional granular system composed of frictional spheres, in which the packing fraction is systematically reduced by random particle extractions. Using Discrete Element…
Theoretical studies of stretching proteins with slipknots reveal a surprising growth of their unfolding times when the stretching force crosses an intermediate threshold. This behavior arises as a consequence of the existence of alternative…
The evaluation of partition functions is a central problem in statistical physics. For lattice systems and other discrete models the partition function may be expressed as the contraction of a tensor network. Unfortunately computing such…
The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. A central challenge in this setting is backpropagation through the solution of an…
Colloidal and other granular media experience a transition to rigidity known as jamming if the fill fraction is increased beyond a critical value. The resulting jammed structures are locally disordered, bear applied loads inhomogenously,…
Meter measurements in the power grid are susceptible to manipulation by adversaries, that can lead to errors in state estimation. This paper presents a general framework to study attacks on state estimation by adversaries capable of…
Pretrained foundation models learn embeddings that can be used for a wide range of downstream tasks. These embeddings optimise general performance, and if insufficiently accurate at a specific task the model can be fine-tuned to improve…
We study the problem of finding a maximum matching in a graph given by an input stream listing its edges in some arbitrary order, where the quantity to be maximized is given by a monotone submodular function on subsets of edges. This…
Model merging offers an efficient way to combine pre-trained neural networks but often suffers from inconsistent performance, especially when merging models with different initializations. We identify the ``vanishing feature'' phenomenon,…
The role of friction coefficient, $\mu$, on the jamming properties of disordered, particle packings is studied using computer simulations. Compressed, soft-sphere packings are brought towards the jamming transition - the point where a…
We propose a scaling ansatz for the elastic energy of a system near the critical jamming transition in terms of three relevant fields: the compressive strain $\Delta \phi$ relative to the critical jammed state, the shear strain $\epsilon$,…
Jammed states of frictional granular systems can be induced by shear strain at densities below the isostatic jamming density ($\phi_c$). It remains unclear, however, how much friction affects this so-called shear-jamming. Friction appears…
The Thomson Problem, arrangement of identical charges on the surface of a sphere, has found many applications in physics, chemistry and biology. Here we show that the energy landscape of the Thomson Problem for $N$ particles with $N=132,…
We show that the error of iteratively magnitude-pruned networks empirically follows a scaling law with interpretable coefficients that depend on the architecture and task. We functionally approximate the error of the pruned networks,…
Foundation multi-modal models are often designed by stitching of multiple existing pretrained uni-modal models: for example, an image classifier with an text model. This stitching process is performed by training a connector module that…
We consider decentralized optimization problems in which a number of agents collaborate to minimize the average of their local functions by exchanging over an underlying communication graph. Specifically, we place ourselves in an…
Parallel machine scheduling has been extensively studied in the past decades, with applications ranging from production planning to job processing in large computing clusters. In this work we study some of these fundamental optimization…
The folding pathway and rate coefficients of the folding of a knotted protein are calculated for a potential energy function with minimal energetic frustration. A kinetic transition network is constructed using the discrete path sampling…
The drainage of particulate foams is studied under conditions where the particles are not trapped individually by constrictions of the interstitial pore space. The drainage velocity decreases continuously as the particle volume fraction…