Loading history and window geometry bound compact-state slip ranking during granular shear startup
Ruixin ZhouBoliang Yu
Oct 2026
Machine Learning
Abstract
Granular slip forecasting can conflate material state, loading progress, and the geometry of event-centered sampling. We separated these contributions in slowly sheared two-dimensional frictional disks using a compact neural score of stress, pressure, coordination, non-affine motion, and force-network observables. The model was developed on 36 trajectories and frozen efore testing on 18 new trajectories under two nested stress-drop definitions. Inspection of held-out results revealed post-event sampling asymmetry; recovery-aware analyses are therefore descriptive. With trajectories weighted equally, the compact score ranked near-slip windows above both prevalence and within-trajectory circular-phase controls under both definitions (representative average precision 0.310 versus prevalence 0.173; phase-null upper bound 0.257). Loading-history coordinates ranked more strongly, reaching 0.534 for causal elapsed strain. The recovery-aware rule retained 78.4\% of activity-gated events and preferentially selected longer preceding intervals; ranking by time since the previous catalogued event remained compatible with a count-conditioned geometry null. Compact observables thus contain temporally aligned slip information, but stronger loading-history baselines and window-geometry sensitivity bound that evidence. These startup data do not isolate a state-specific short-horizon precursor beyond loading history or support a renewal interpretation of elapsed-strain ranking.
This paper investigates developing real-world perception for active agents, proposes Gibson Environment for this purpose, and showcases a set of perceptual tasks learned therein.
F. Xia, Amir Zamir, Zhi-Yang He et al.· 2018 IEEE/CVF Conference on...· 1,069 citations· ⚡112
The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.
Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al.· Information and Software Tec...· 394 citations· ⚡54
The possibility of inferring high-dimensional data inference in a model that consists of a prior and an auxiliary differentiable constraint given some additional information is considered, thereby allowing a range of potential applications in adapting models to new domains and tasks.
Alexandros Graikos, Esmeralda S. Whitammer, N. Jojic et al.· Neural Information Processin...· 316 citations· ⚡15
It is proved that any global minimizer of the trajectory balance objective can define a policy that samples exactly from the target distribution, and empirically demonstrate the benefits of the trajectories balance objective for GFlowNet convergence, diversity of generated samples, and robustness to long action sequenc...
Esmeralda S. Whitammer, Moksh Jain, Emmanuel Bengio et al.· Neural Information Processin...· 302 citations· ⚡60
An algorithm is proposed which leverages disentangled semantic factors to generate adversarial perturbation by altering controlled semantic attributes to fool the learner towards various "adversarial" targets.
Haonan Qiu, Chaowei Xiao, Lei Yang et al.· arXiv.org· 208 citations· ⚡17
This work proposes a HALO that directly maximizes the utility of generations instead of maximizing the log-likelihood of preferences, and suggests that the best loss depends on the inductive biases most appropriate for a given setting, an oft-overlooked consideration.
Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.