AI & ML Papers
33K subscribers
7.11K photos
532 videos
24 files
7.78K links
Advancing research in Machine Learning – practical insights, tools, and techniques for researchers.

Admin: @HusseinSheikho || @Hussein_Sheikho
Download Telegram
Functional Continuous Decomposition

📝 Summary:
Functional Continuous Decomposition FCD is a new framework for parametric, continuous optimization of time-series data. It extracts M modes capturing local and global patterns, improving feature extraction. FCD features enhance machine learning models, leading to faster convergence and higher acc...

🔹 Publication Date: Published on Feb 24

🔹 Paper Links:
• arXiv Page: http://arxiv.org/abs/2602.20857
• PDF: https://arxiv.org/pdf/2602.20857
• Project Page: http://arxiv.org/abs/2602.20857
• Github: https://github.com/Tima-a/fcd

==================================

For more data science resources:
https://xn--r1a.website/DataScienceT

#FCD #TimeSeries #Optimization #FeatureExtraction #MachineLearning
MNN: A Universal and Efficient Inference Engine

📝 Summary:
MNN is an efficient deep learning inference engine for mobile devices. It addresses compatibility and resource limits through pre-inference, kernel optimization, and backend abstraction, outperforming other lightweight frameworks.

🔹 Publication Date: Published on Feb 27, 2020

🔹 Paper Links:
• arXiv Page: https://arxiv.org/abs/2002.12418
• PDF: https://arxiv.org/pdf/2002.12418
• Github: https://github.com/alibaba/MNN

==================================

For more data science resources:
https://xn--r1a.website/DataScienceT

#DeepLearning #MobileAI #EdgeAI #Optimization #MachineLearning
1
Cautious Weight Decay

📝 Summary:
Cautious Weight Decay CWD is an optimizer modification that selectively applies weight decay to parameters whose signs align with the optimizer update. It improves accuracy and loss in large-scale models without additional tuning, acting as a drop-in change for common optimizers.

🔹 Publication Date: Published on Oct 14, 2025

🔹 Paper Links:
• arXiv Page: https://arxiv.org/abs/2510.12402
• PDF: https://arxiv.org/pdf/2510.12402
• Project Page: https://elm.baulab.info
• Github: https://github.com/google-deepmind/simply

==================================

For more data science resources:
https://xn--r1a.website/DataScienceT

#WeightDecay #Optimization #DeepLearning #MachineLearning #AI
1
WorldCache: Accelerating World Models for Free via Heterogeneous Token Caching

📝 Summary:
WorldCache speeds up slow diffusion-based world models by addressing token heterogeneity and non-uniform dynamics. It uses curvature-guided prediction and chaotic-prioritized skipping. This achieves up to 3.7 times faster inference with 98 percent rollout quality.

🔹 Publication Date: Published on Mar 6

🔹 Paper Links:
• arXiv Page: https://arxiv.org/abs/2603.06331
• PDF: https://arxiv.org/pdf/2603.06331

==================================

For more data science resources:
https://xn--r1a.website/DataScienceT

#WorldModels #DiffusionModels #AI #MachineLearning #Optimization
Lost in Backpropagation: The LM Head is a Gradient Bottleneck

📝 Summary:
The softmax bottleneck in neural LMs is a critical optimization bottleneck, not just an expressivity issue. The rank-D output layer suppresses 95-99% of gradient norm, leading to suboptimal updates and inefficient training. This necessitates new LM head designs.

🔹 Publication Date: Published on Mar 10

🔹 Paper Links:
• arXiv Page: https://arxiv.org/abs/2603.10145
• PDF: https://arxiv.org/pdf/2603.10145

==================================

For more data science resources:
https://xn--r1a.website/DataScienceT

#LLM #DeepLearning #Optimization #NeuralNetworks #GradientBottleneck
Spend Less, Reason Better: Budget-Aware Value Tree Search for LLM Agents

📝 Summary:
The Budget-Aware Value Tree BAVT optimizes LLM agent reasoning by dynamically balancing exploration and exploitation based on remaining compute. It uses a budget-conditioned node selection and residual value predictor for efficient search, outperforming brute-force methods with 4x less resources.

🔹 Publication Date: Published on Mar 13

🔹 Paper Links:
• arXiv Page: https://arxiv.org/abs/2603.12634
• PDF: https://arxiv.org/pdf/2603.12634

==================================

For more data science resources:
https://xn--r1a.website/DataScienceT

#LLMAgents #AIResearch #Optimization #EfficientAI #ValueTreeSearch
2
SpectralSplats: Robust Differentiable Tracking via Spectral Moment Supervision

📝 Summary:
SpectralSplats resolves vanishing gradients in 3D Gaussian Splatting tracking by optimizing in the frequency domain using spectral moments. This creates a global gradient basin of attraction, ensuring robust tracking even with severe misalignment. A frequency annealing schedule guides precise ali...

🔹 Publication Date: Published on Mar 25

🔹 Paper Links:
• arXiv Page: https://arxiv.org/abs/2603.24036
• PDF: https://arxiv.org/pdf/2603.24036
• Project Page: https://avigailco.github.io/SpectralSplats/

==================================

For more data science resources:
https://xn--r1a.website/DataScienceT

#3DTracking #GaussianSplatting #ComputerVision #Optimization #DifferentiableRendering
Understanding the Challenges in Iterative Generative Optimization with LLMs

📝 Summary:
Generative optimization with LLMs is often brittle due to implicit design choices about artifact modification and learning evidence. These hidden decisions, such as starting artifact or batching, critically determine success across applications. Making these choices explicit is crucial for wider ...

🔹 Publication Date: Published on Mar 25

🔹 Paper Links:
• arXiv Page: https://arxiv.org/abs/2603.23994
• PDF: https://arxiv.org/pdf/2603.23994

==================================

For more data science resources:
https://xn--r1a.website/DataScienceT

#LLMs #GenerativeAI #Optimization #AIResearch #MachineLearning
What Makes an LLM a Good Optimizer? A Trajectory Analysis of LLM-Guided Evolutionary Search

📝 Summary:
LLM-guided evolutionary search shows that optimization success depends on search trajectory characteristics rather than initial problem-solving ability alone, with strong optimizers refining locally w...

🔹 Publication Date: Published on Apr 21

🔹 Paper Links:
• arXiv Page: https://arxiv.org/abs/2604.19440
• PDF: https://arxiv.org/pdf/2604.19440
• Project Page: https://xinhao-zhang.github.io/traj_evo_search/
• Github: https://github.com/XINHAO-ZHANG/LLMEvo_Eval

==================================

For more data science resources:
https://xn--r1a.website/DataScienceT

#LLM #Optimization #EvolutionaryAlgorithms #AI #MachineLearning
ViPO: Visual Preference Optimization at Scale

📝 Summary:
ViPO scales visual preference optimization using Poly-DPO for noisy data and constructing ViPO, a large high-quality dataset. This dual approach yields superior performance, emphasizing that algorithmic adaptability and data quality are crucial.

🔹 Publication Date: Published on Apr 29

🔹 Paper Links:
• arXiv Page: https://arxiv.org/abs/2604.24953
• PDF: https://arxiv.org/pdf/2604.24953
• Project Page: https://liming-ai.github.io/ViPO
• Github: https://liming-ai.github.io/ViPO

==================================

For more data science resources:
https://xn--r1a.website/DataScienceT

#VisualAI #MachineLearning #DeepLearning #Optimization #DataScience