Model Casting Sparsifies Feed-Forward Network Activations
A new mid-training recipe could make feed-forward layers in neural networks far more sparsely activated at inference time.
Preprints and papers, rewritten in plain English.
A new mid-training recipe could make feed-forward layers in neural networks far more sparsely activated at inference time.
A new arXiv preprint proposes a method to balance acquiring new manipulation skills and retaining previously learned ones in vision-language-action models.
A proposed graph-based distribution matching approach could improve multi-property control while preserving chemical validity.
A proposed evaluation method, TRIAGE, aims to better assess how well large language models remove targeted knowledge without losing other capabilities.
A new arXiv paper proposes a method to make counterfactual prediction tractable despite the fundamental identifiability problem in observational data.
A new method accounts for how updates to unfrozen layers alter inputs to frozen ones, preserving performance during fine-tuning.
A new framework proposes adding formal certification to neural-network results in mathematics, addressing their lack of exactness.
A new arXiv preprint proposes an ordered representation curriculum for physics-informed neural networks to improve performance.
A new method adapts financial language models to use only information available at the time of prediction, reducing look-ahead bias in backtests.
A new arXiv paper proposes a strategic approach to self-consistency, aiming to improve how large language models select answers from multiple reasoning paths.
A new arXiv study proposes graph networks to recover unobserved mechanical forces from discretely sampled trajectories.
A new arXiv study applies geospatial artificial intelligence to select EV charging locations, shifting focus from cost minimization to broader siting criteria.
A new pruning method targets replaceable experts in mixture-of-experts LLMs to cut storage while preserving output behaviour.
A new arXiv paper argues that training Transformers with Q-targets instead of behavior cloning gives in-context reinforcement learning stronger theoretical guarantees and less dependence on data quality.
Researchers frame LLM selection as a multi-armed bandit problem that accounts for differing query costs, not just accuracy.
A new composable tensor design targets the computational cost of dense batching for variable-size inputs.
A new arXiv paper proposes shifting recommender systems from platform control to user side using LLM agents.
A new paper proposes a lightweight causal steering method to help large language models adapt to interacting values without retraining.