This work quantifies functional degeneracy through the behavioral recovery rank, defined as the number of leading behavioral-Hessian eigendirections required to recover a trained model's performance, and finds that structural and magnitude pruning retain more degrees of freedom, even after the task is saturated.
M. Matveev, P. Esser, Ayush Bharadwaj et al.· 0 citations
E-Commerce Bench is introduced, the first open-source benchmark that integrates multi-round counterpart negotiation and dynamic events into a year-long business operation, and it is found that no single model dominates.
Wei Fan, Xin-Jie Shen, Xu-Dong Guo et al.· 0 citations
This work releases BAITBENCH, a suite of three synthetic tabular ML tasks that each contain a shortcut that allows agents to inflate the public test score but fail on a hidden test set, and releases an annotated dataset of transcripts containing reward hacks as a testbed for evaluating reward-hacking mitigations head-to-head.
Pradyumna Shyama Prasad, M. Anto, Leon Eshuijs et al.· 1 citation
Representational similarity is foundational to analyses of deep networks, yet distances between point-valued representations are not intrinsically tied to downstream function: nearby states may produce different behaviors, while distant states may behave similarly. We instead give representations volume, turning similarity into statistical distinguishability. Overlapping stochastic representations necessarily induce overlapping downstream distributions, grounding latent comparison in model function and bringing it under information-theoretic tools such as the data-processing inequality. We realize this idea in pretrained transformers through a light-touch modification to LayerNorm: at each residual-stream read, we normalize the state, add isotropic Gaussian noise, and renormalize. During distillation fine-tuning, one learned allocation parameter per residual-stream read distributes a fixed global rate budget across the processing stack. The resulting model can be viewed as transformer blocks reading the residual stream with learned finite precision under a shared global rate budget. Using the Bhattacharyya coefficient, we trace which counterfactual distinctions are preserved through MLP blocks or selectively exposed to the query, key, and value computations of individual attention heads. Experiments on ViT-S and GPT-2 small reveal the depthwise propagation of continuous visual perturbations and head-specific sensitivity to token distinctions aligned with known attention motifs. These results establish distinguishability as a functionally grounded lens on transformer computation that complements existing interpretability approaches.
Kieran A. Murphy· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
This paper provides an explicit, self-contained, and constructive proof of an approximate representation using fixed, piecewise linear inner functions and employs a single outer function that remains invariant for all summands and is independent of the specific adversarial translation.
DyTrim is proposed, a principle-based dynamic pruning framework that reallocates gradient budget through class-aware pruning on labeled data and confidence-based soft pruning on unlabeled data and provides theoretical guarantees that DyTrim reduces class bias and improves generalization.
Yue Cheng, Jia-Jun Zhang, Xiao-Hui Gao et al.· 1 citation
This work proposes Liquid Gated Attention (LGA), a solver-free parallel temporal operator that introduces a continuous-time inductive bias and formulates hidden state evolution as a fast-weight associative memory, enabling parallel computation across the temporal dimension.
Learning materials properties from scarce labels and unlabeled crystals is a central challenge for data-driven materials discovery. We present SemiMat, a controlled benchmark for semi-supervised materials property regression, and MatRank, a reliability-weighted objective for continuous pseudo-label uncertainty. SemiMat fixes labeled and unlabeled crystal inputs, graph-backbone interfaces, validation-only checkpoint selection, held-out test reporting, normalized MAE (NMAE), and method-rank summaries across six scarce-label tasks, four graph backbones, and five predefined split runs. MatRank builds pseudo-targets from labeled anchors, weights them by local reliability and weak-prediction agreement, trains weak and strong graph views consistently, and adds ranking signals so that unlabeled crystals shape both values and candidate order. Across the retained 24 backbone-task blocks, one fixed MatRank objective gives the lowest aggregate held-out test NMAE (0.896) and best average method rank (2.208). The component, OOD, and generated-pool diagnostics identify where the gain is reliable and where further screening evaluation remains necessary. Code is available at https://github.com/littlepeachs/SemiMat.
Wen-Tao Li, Yi-Zhe Chen, Jiang-Jie Qiu et al.· 0 citations
CoMPASS is presented, a retrieval-calibrated framework for small-large model collaboration that retains a graph attention network as the predictive anchor, retrieves locally relevant training molecules, provides attention-grounded evidence to an LLM, and converts its proposal into a bounded correction through an agreement-aware gate.
Wen-Tao Li, Jiang-Jie Qiu, Yi-Jun Li et al.· 0 citations
A hybrid Convolutional-Transformer forecasting framework that combines convolutional encoding for spatial feature extraction with factorised self-attention for spatio-temporal dependency modelling and introduces two seasonal prior mechanisms.
Dan-Yang Li, John A. Taylor, Thang D. Bui et al.· 0 citations
This work extends contrastive reinforcement learning (CRL), a prototypical self-supervised method, to operate over action chunks, and finds that this results in large, pervasive gains across established offline and online benchmarks: +31.7% and +93.1% across 18 and 11 environments respectively.
Michal Korniak, Kamil Dybek, Benjamin Eysenbach et al.· 0 citations
A new graph neural network architecture with built-in meaningful per-atom attributions that produces attributions that are more faithful to chemical properties than other interpretability methods because the auxiliary loss in MolLedger anchors the atom scores to chemical properties.
A weeklong summer workshop brought higher education faculty to campus to explore how AI and machine learning materials can be adapted for their classrooms.
Adaptive AI agents can help make BIM data more machine-readable by navigating IFC models, interpreting inconsistent information, and mapping it to defined standards. In this blog, Alok Rawat shares findings from a real-world pilot in construction workflows. The post Adaptive AI Agents in Construction Workflows appeared first on GPT-Lab.