Search papers, labs, and topics across Lattice.
100 papers published across 7 labs.
G-QKANFWP outperforms traditional LSTMs in traffic forecasting while using a fraction of the resources, redefining efficiency in network control.
Embedding magnitudes, often ignored in contrastive models, actually encode critical semantic information that can enhance retrieval tasks.
ITSPACE achieves faster convergence to optimal covariance alignment, outperforming traditional methods even under strict computational constraints.
Muon achieves rapid convergence in matrix factorization by avoiding slow saddle dynamics and enabling high learning rates, aligning weights in just two steps.
Estimating valid transport maps can be as hard as optimal transport, but under certain conditions, alternative maps can be learned with significantly higher accuracy.
Embedding magnitudes, often ignored in contrastive models, actually encode critical semantic information that can enhance retrieval tasks.
ITSPACE achieves faster convergence to optimal covariance alignment, outperforming traditional methods even under strict computational constraints.
Muon achieves rapid convergence in matrix factorization by avoiding slow saddle dynamics and enabling high learning rates, aligning weights in just two steps.
Estimating valid transport maps can be as hard as optimal transport, but under certain conditions, alternative maps can be learned with significantly higher accuracy.
Local linear convergence in homogeneous deep networks can be achieved even when global convergence fails, reshaping our understanding of continual learning dynamics.
Clustering clients based on local novelty signals can revolutionize federated learning by enabling efficient and autonomous collaboration without the need for extensive computational resources.
CWGD-Cosine can halve the optimization error floor compared to standard methods, revolutionizing how we approach learning rate schedules in SGD.
Scalar embeddings reveal that neural network training dynamics can be effectively summarized, preserving critical features like sensitivity to initial conditions and decorrelation times.
DRIFT not only sets a new state-of-the-art in self-improvement for language models but also redefines how we can dynamically adapt learning strategies based on problem difficulty.
autonugget achieves superior accuracy in solving ill-conditioned linear systems by intelligently combining multiple linear solves, making it a game-changer for rapid algorithm prototyping.
Grokking isn't just a quirk—it's a structured phenomenon rooted in the topological properties of solution spaces shaped by optimization dynamics.
Injecting domain-specific knowledge into small tabular models can lead to substantial performance gains in niche applications, highlighting the importance of tailored fine-tuning strategies.
A new DRO framework that tailors uncertainty modeling to the data-acquisition process significantly boosts robustness and interpretability in learned reconstructions.
SGD stabilizes training dynamics while Adam's reorganization of eigenvectors reveals a surprising localization effect, highlighting stark differences in optimizer behavior.
Memory management, not learned policies, is the key to achieving near-zero forgetting in continual learning.
GAIA redefines online data selection for LLM instruction tuning, achieving superior performance by dynamically prioritizing high-utility samples across the entire semantic space.
T3R achieves a remarkable 9.37% relative improvement in classification tasks by enabling deeper adaptation of GNNs at test time, even with unlabeled data.
Pretrained time-series models can significantly enhance EEG analysis, even when used as frozen feature extractors.
ACPO achieves joint policy optimization in MARL by enabling independent agent updates that effectively coordinate through a belief mechanism, outperforming traditional methods as agent numbers grow.
Inoculation adapters can suppress undesired traits in AI models while introducing fewer unexpected vulnerabilities compared to traditional inoculation prompting methods.
HRL-IM/CBS achieves competitive performance in StarCraft micromanagement while significantly enhancing sample efficiency and interpretability compared to traditional deep RL methods.
Transformer models in genomics may not always deliver the expected performance gains relative to their pretraining costs, challenging the status quo in DNA sequence analysis.
Achieving a 46.2% reduction in computational cost for CNNs without retraining could revolutionize how we deploy deep learning on edge devices.
Unlocking the latent potential of timestep embeddings allows for a parameter-free, single-model approach to multi-task learning that rivals traditional, heavier methods.
Lightweight CNNs can achieve real-time steering predictions while reducing model size and complexity through automated hyperparameter optimization.
Achieving an 18% boost in energy-tardiness efficiency, SMART-MIG redefines GPU scheduling for energy-conscious machine learning applications.
OOD inputs show larger Hessian curvature than ID data, leading to a novel and efficient detection method that outperforms traditional approaches.
DOPD reveals that intelligently routing supervision based on advantage gaps can significantly enhance capability transfer in distillation, outperforming conventional methods.
Asynchronous pipeline parallelism can match synchronous training performance if the right optimizer is chosen, debunking myths about gradient delay instability.
FlashMorph reveals that optimizing layer selection in hybrid attention models can drastically improve efficiency while maintaining performance, outperforming existing heuristic methods.
Firms with high AI beta earn significantly higher returns, revealing a substantial and heterogeneous AI premium across industries.
Transforming probabilistic programs into dynamic graphs can drastically cut down on computation time, enabling faster and more precise MCMC inference.
Achieving a 1.41x speedup in shallow neural network training demonstrates the transformative potential of memory-access optimizations in GPU implementations.
SpikON slashes training latency and energy use for spiking neural networks while boosting throughput by over 7x compared to conventional edge accelerators.
TriageRA-CCF reveals that leveraging source-side clinical signals can significantly enhance the performance of medical LLMs by optimizing rank budgeting dynamically.
Unused AI computation at the edge can be harnessed to boost performance in traditional tasks without sacrificing the efficiency of primary workloads.
Training updates that improve performance in LLMs can actually degrade inference quality—unless you use the new Monotonic Inference Policy Update framework.
G-QKANFWP outperforms traditional LSTMs in traffic forecasting while using a fraction of the resources, redefining efficiency in network control.
Achieving R² scores over 0.99 for damage sizing, this framework redefines the potential of deep learning in structural health monitoring with minimal experimental data.
Solving Blackwell approachability problems via Gradient Equilibrium oracles reveals a deep connection between these two seemingly distinct optimization frameworks.
CARVE achieves state-of-the-art performance with 19% fewer parameters while maintaining competitive perplexity, reshaping expectations for recurrent model efficiency.
Low-rank correlations can significantly boost the learnability of GANs, but too much correlation may lead to instability in recovery.
DMuon slashes training time for large models, achieving up to 163x faster optimizer steps while maintaining the benefits of matrix-aware updates.
Tiling momentum-gradient matrices can cut optimization costs significantly while preserving training performance, challenging the need for full-matrix updates.
Tuning preprocessing techniques can close the accuracy gap in time-series forecasting without the need for larger models, revealing surprising insights about optimal lookback periods and normalization strategies.
Auxiliary gradient-prediction models can drastically reduce stochastic gradient noise, leading to faster convergence and better generalization in deep learning.
Heavy-ball Q-learning can converge faster than traditional methods, offering a new lens on acceleration in reinforcement learning.
CIRCLE achieves state-of-the-art performance in cold-start continual learning without ever fitting a backbone to image data, revolutionizing the approach to class-incremental learning.
An XMSE-aware estimator adapts between maximum likelihood and empirical Bayes, ensuring optimal performance even under kernel misspecification.
Injecting noise just once into a low-dimensional representation can significantly enhance model utility in differentially private learning.
Tapering Transformer width with depth can significantly enhance efficiency, reducing latency while preserving performance metrics.
A safe transfer learning framework that boosts autonomous lane changing performance by over 52% in safety while enhancing learning efficiency.
Recovering over 95% of individual-expert performance from a single merged model could revolutionize multi-task learning efficiency.
MinGram achieves better compression than BPE while simplifying the training process, making it a game-changer for tokenizer efficiency.
Existing fault diagnosis techniques miss a critical 0.190 accuracy gap when applied to unseen deep learning programs, revealing a fundamental flaw in current evaluation strategies.
A single hypernetwork can replace complex optimization processes in texture compression, achieving high-quality results while enabling simultaneous decoder inference and super-resolution.
A training-free self-guidance method can dramatically enhance output diversity in flow models without the overhead of external reward systems.
KANs show promise in aerodynamic prediction but struggle with stability and hyperparameter sensitivity compared to MLPs and GNNs.
GGR transforms the landscape of open-set semi-supervised learning by ensuring that auxiliary gradients enhance rather than conflict with supervised updates.
CAT-Q quantizes large language models with unprecedented efficiency, achieving superior performance while slashing training token requirements by 100,000X.
LISA accelerates training and enhances output quality in visual-condition generation by aligning side network features with likelihood scores, all without extra inference costs.
iLLaDA's fully bidirectional diffusion training outperforms traditional autoregressive models, achieving remarkable gains across key language benchmarks.
Separating the magnitude and direction of weight vectors can lead to more predictable training dynamics and significant performance gains across various neural network architectures.
Small models can achieve competitive performance with innovative data generation and distillation techniques, challenging the notion that bigger is always better in model training.
Tensorion achieves superior convergence and stability in optimizing tensor-based models, outperforming traditional methods like Adam.
Student models can guide the creation of complex teacher models, yielding unexpected computational efficiencies and improved performance.
Training digital twins for decision-making can drastically improve policy ranking and reduce regret, even with limited model capacity.
A new initialization strategy for zero prior mean DGPs effectively prevents posterior collapse and enhances optimization stability, challenging the reliance on linear prior means.
MiniOpt achieves the highest solving accuracy for compact models while requiring significantly fewer training resources than traditional methods.
Hybrid optimizers that blend black-box methods can significantly enhance performance and robustness in optimization tasks, outperforming traditional approaches.
Hyperparameter selection can now be backed by formal statistical guarantees, transforming a traditionally heuristic process into a reliable, principled approach.
Clipping advantage fluctuations can lead to stable convergence in cooperative multi-agent reinforcement learning, outperforming traditional methods.
IF-Beta allows student models to achieve superior performance with significantly less data and compute, challenging the traditional reliance on full datasets in knowledge distillation.
Achieving 40% more retain-accuracy with only 13% of the data samples, DFMU revolutionizes the efficiency of machine unlearning.
Stagnant neurons in MARL can cripple learning, but KNIFE revitalizes them, leading to substantial performance gains in complex environments.
Achieving a staggering 2800x reduction in decision latency while simultaneously lowering fulfillment costs by over 10% could revolutionize real-time order fulfillment systems.
A single elastic model can adapt to multiple sparsity configurations without re-optimization, revolutionizing LLM deployment efficiency.
A lightweight, input-conditioned initialization method boosts CNN performance without additional training costs, achieving significant accuracy gains across multiple datasets.
COMAD expands the skill library of agents in real-time, dramatically improving their ability to adapt and reuse coordination skills without suffering from interference or forgetting.
Lightweight PCGAE-Net achieves superior CSI prediction accuracy with 58% fewer parameters than the leading model, revolutionizing efficiency in 5G systems.
Rapidly adapting control systems can now leverage a shared Lyapunov network to maintain stability despite significant parameter shifts.
EmuGEMM achieves up to 5.5x speedup over cuBLAS ZGEMM while maintaining accuracy, revolutionizing low-precision matrix multiplication on modern GPUs.
TL++ outperforms conventional federated learning methods by over 12 percentage points in accuracy while slashing communication costs by 13.1-fold.
Uninformative mode probabilities in trajectory forecasting can be transformed into robust predictions with simple post-hoc adjustments, enhancing model performance without retraining.
FORCE achieves a remarkable 79% increase in success rates for VLA models while eliminating the need for costly human interventions during training.
Achieving up to 95% storage savings in multi-task robotics without sacrificing performance could revolutionize how we deploy specialized policies in memory-constrained environments.
Static low-bit gradient communication can destabilize training, but NEURON-Fabric ensures accuracy is preserved while slashing communication costs.
Achieving 51% higher throughput with low-precision arithmetic while maintaining accuracy could redefine efficiency benchmarks in semiconductor simulations.
SOLAR achieves zero observed violations in Speed-of-Light performance analysis, transforming how we approach deep learning optimizations.
BluTrain outpaces PyTorch in both speed and memory efficiency, setting a new standard for AI training frameworks.
Achieving a 30% reduction in Equal Error Rate, EERLoss revolutionizes how deep biometric models are trained by aligning training objectives with evaluation metrics.
H-Res achieves a 26% improvement in associative retrieval tasks by steering token trajectories without altering the model's global equilibrium.
Partial data augmentation can match the statistical benefits of full augmentation, challenging the notion that complete symmetry is necessary for optimal learning.
Inertia in Dirac-Frenkel dynamics significantly enhances parameter evolution stability, making it a game-changer for training complex models like neural networks.
Blockwise policy-drift gating boosts on-policy distillation performance, increasing solve rates by effectively managing policy drift without changing teacher signals.
Classic value investing principles can outperform complex AI models by providing a crucial risk management framework in volatile markets.
Achieving high accuracy in FinFET modeling with minimal training data could revolutionize device characterization and circuit simulation.
Decentralized training can rival centralized models, achieving competitive performance while democratizing access to AI development resources.
Learnable filter shapes in RF-KAN yield a performance boost that outstrips conventional convolutional approaches while slashing parameter counts by over 80%.
InterAligner achieves a remarkable reduction in word error rates, especially for long utterances, by progressively forming alignment across the model's depth.