Search papers, labs, and topics across Lattice.
7
0
10
16
Runtime for complex project-scheduling simulations can be slashed from over 1,200 seconds to under 200 seconds using agentic AI optimizations, saving researchers significant computational resources.
AI agents may ace endpoint identification but falter in delivering the evidence-based diagnostics essential for real-world telecom troubleshooting.
Pruning 75% of visual tokens without sacrificing performance could redefine efficiency benchmarks for VideoLLMs.
Leveraging resolution differences can yield significant performance gains in multimodal large language models without the need for external supervision or annotations.
Forget hand-tuning: AutoSG automatically conjures high-performing solvers for expensive optimization problems directly from task prompts.
Genetic programming can automatically discover lightweight, generalizable feature extractors for time series classification that outperform standard methods.
Combining heuristics with learned models for graph sparsification yields significantly sparser and more reliable candidate graphs for TSP solvers, outperforming purely heuristic or learned approaches, especially as problem size increases.
