Track new results across pure and applied mathematics.
Search papers, labs, and topics across Lattice.
3
0
6
Pruning LLMs while preserving their influence functions is now over 28x faster and more effective, unlocking better data selection for downstream tasks.
Exact robust regression at scale is now possible: a new algorithm solves the NP-hard Least Trimmed Squares problem orders of magnitude faster than existing methods.
DuaLip-GPU achieves a 10x speedup over CPU-based DuaLip for large-scale linear programs by redesigning the solver architecture for GPU execution and introducing novel GPU execution techniques tailored to sparse matching constraints.