<?xml version="1.0" encoding="UTF-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>MLLog.dev — EN</title><description>MLLog.dev is a machine learning log: in-depth breakdowns of the latest ML and AI papers, hands-on tutorials, experiments and projects.</description><link>https://mllog.dev/</link><language>en-US</language><managingEditor>Maciej Myszkiewicz</managingEditor><atom:link href="https://mllog.dev/en/rss.xml" rel="self" type="application/rss+xml"/><item><title>Orca: What If Next-Token, Next-Frame, and Next-Action Are the Same Task?</title><link>https://mllog.dev/en/posts/orca-world-foundation-model-next-state-prediction/</link><guid isPermaLink="true">https://mllog.dev/en/posts/orca-world-foundation-model-next-state-prediction/</guid><description>Orca (BAAI) replaces next-token, next-frame, and next-action prediction with a single Next-State-Prediction objective. A frozen 4B backbone pre-trained on 12.5K hours of video — with zero action labels — feeds three lightweight readouts, and the action readout, trained on just 200 trajectories per task, beats π0.5 on OOD robot manipulation (32.4 vs 29.4).</description><pubDate>Sun, 05 Jul 2026 07:00:00 GMT</pubDate><category>world-models</category><category>next-state-prediction</category><category>representation-learning</category><category>robotics</category><category>multimodal</category></item><item><title>SWE-Explore: The Benchmark That Finally Asks — Did Your Coding Agent Read the Right Code?</title><link>https://mllog.dev/en/posts/swe-explore-benchmarking-coding-agents-repository-exploration/</link><guid isPermaLink="true">https://mllog.dev/en/posts/swe-explore-benchmarking-coding-agents-repository-exploration/</guid><description>SWE-Explore isolates repository exploration from patch generation, revealing that coding agents find the right files ~65% of the time but recall only ~15-19% of the lines that actually matter — and that context efficiency predicts downstream resolve rate with Pearson r = 0.950.</description><pubDate>Tue, 09 Jun 2026 07:00:00 GMT</pubDate><category>coding-agents</category><category>benchmarks</category><category>code-localization</category><category>software-engineering</category><category>repository-exploration</category></item><item><title>SkillOpt: Training Agent Skills Like Neural Network Weights - Without Touching the Model</title><link>https://mllog.dev/en/posts/skillopt-text-space-optimizer-agent-skills/</link><guid isPermaLink="true">https://mllog.dev/en/posts/skillopt-text-space-optimizer-agent-skills/</guid><description>SkillOpt applies deep-learning-style optimization - bounded edit budgets, validation gating, rejected-edit memory - to natural-language skill documents, improving frozen LLMs by up to +39 points across 52/52 evaluated cells without changing a single model weight.</description><pubDate>Fri, 29 May 2026 07:00:00 GMT</pubDate><category>agents</category><category>prompt-optimization</category><category>llm</category><category>skill-learning</category><category>text-space-training</category></item><item><title>MolmoAct2: The First Fully Open Robot Controller That Beats Closed-Source Giants</title><link>https://mllog.dev/en/posts/molmoact2-action-reasoning-real-world-deployment/</link><guid isPermaLink="true">https://mllog.dev/en/posts/molmoact2-action-reasoning-real-world-deployment/</guid><description>MolmoAct2 is a fully open vision-language-action model that outperforms π0.5 and matches Gemini Robotics ER, achieving 97.2% on LIBERO and 87.1% real-world success via per-layer KV-cache conditioning and adaptive depth reasoning.</description><pubDate>Sun, 10 May 2026 11:00:00 GMT</pubDate><category>robotics</category><category>VLA</category><category>embodied-reasoning</category><category>flow-matching</category><category>open-source</category></item><item><title>RecursiveMAS: What If Your Multi-Agent System Was Just One Big Recursive Neural Network?</title><link>https://mllog.dev/en/posts/recursive-multi-agent-systems/</link><guid isPermaLink="true">https://mllog.dev/en/posts/recursive-multi-agent-systems/</guid><description>RecursiveMAS treats an entire multi-agent system as a single recursive computation in latent space, adding only 0.31% trainable parameters while achieving +8.3% accuracy, 2.4x speedup, and 75.6% token reduction over text-based multi-agent baselines.</description><pubDate>Sat, 02 May 2026 00:00:00 GMT</pubDate><category>AI</category><category>multi-agent-systems</category><category>recursive-computation</category><category>latent-space</category><category>llm-collaboration</category></item><item><title>Tstars-Tryon 1.0: Virtual Try-On as Multi-Image Editing at Taobao Scale</title><link>https://mllog.dev/en/posts/2026-04-26-tstars-tryon-virtual-try-on-mmdit/</link><guid isPermaLink="true">https://mllog.dev/en/posts/2026-04-26-tstars-tryon-virtual-try-on-mmdit/</guid><description>How a unified 5B MMDiT trained with multi-reward RL and step distillation reframes virtual try-on as multi-image editing — and runs in under 4 seconds in production.</description><pubDate>Sun, 26 Apr 2026 00:00:00 GMT</pubDate><category>AI</category><category>diffusion</category><category>virtual-try-on</category><category>MMDiT</category><category>image-editing</category><category>deployment</category></item><item><title>ClawGUI: A Full-Stack Open-Source Pipeline for GUI Agents</title><link>https://mllog.dev/en/posts/2026-04-15-clawgui-unified-framework-gui-agents/</link><guid isPermaLink="true">https://mllog.dev/en/posts/2026-04-15-clawgui-unified-framework-gui-agents/</guid><description>ClawGUI unifies online RL training, reproducible evaluation, and real-device deployment of GUI agents into one open-source pipeline — and shows a 2B model trained inside it can beat 72B untrained baselines on MobileWorld.</description><pubDate>Wed, 15 Apr 2026 09:00:00 GMT</pubDate><category>gui-agents</category><category>reinforcement-learning</category><category>benchmarking</category><category>deployment</category><category>process-reward-model</category></item><item><title>SkillClaw: Making LLM Agent Skills Evolve Collectively</title><link>https://mllog.dev/en/posts/2026-04-12-skillclaw-collective-skill-evolution-llm-agents/</link><guid isPermaLink="true">https://mllog.dev/en/posts/2026-04-12-skillclaw-collective-skill-evolution-llm-agents/</guid><description>SkillClaw is a framework for collective skill evolution in multi-user LLM agent ecosystems. Instead of static skill libraries, the system automatically learns from interactions across users and propagates improvements to everyone.</description><pubDate>Sun, 12 Apr 2026 00:00:00 GMT</pubDate><category>llm-agents</category><category>skill-evolution</category><category>multi-user</category><category>self-improvement</category><category>agent-systems</category></item><item><title>TAPS: Why Your Draft Model&apos;s Training Data Matters More Than Its Architecture</title><link>https://mllog.dev/en/posts/taps-task-aware-speculative-decoding/</link><guid isPermaLink="true">https://mllog.dev/en/posts/taps-task-aware-speculative-decoding/</guid><description>TAPS shows draft training data drives speculative decoding: merged-tree verification of math and chat specialists hits 5.11 acceptance length, weight averaging 2.59.</description><pubDate>Sat, 28 Mar 2026 00:00:00 GMT</pubDate><category>AI</category><category>NLP</category><category>LLM</category><category>Speculative Decoding</category><category>Inference Optimization</category><category>EAGLE</category><category>HASS</category></item><item><title>Demystifying Video Reasoning: Models Don&apos;t Think in Frames - They Think in Denoising Steps</title><link>https://mllog.dev/en/posts/demystifying-video-reasoning-chain-of-steps/</link><guid isPermaLink="true">https://mllog.dev/en/posts/demystifying-video-reasoning-chain-of-steps/</guid><description>Chain-of-Steps shows video diffusion models reason across denoising steps, not frames, exploring and self-correcting before converging on a single answer.</description><pubDate>Tue, 17 Mar 2026 00:00:00 GMT</pubDate><category>AI</category><category>Computer Vision</category><category>Video Generation</category><category>Diffusion Models</category><category>Reasoning</category><category>Diffusion Transformer</category></item><item><title>Seoul World Model: AI That Generates Video of Real Cities From Street Photos</title><link>https://mllog.dev/en/posts/seoul-world-model-city-scale-video-generation/</link><guid isPermaLink="true">https://mllog.dev/en/posts/seoul-world-model-city-scale-video-generation/</guid><description>Seoul World Model generates photorealistic city video from street-view photos, cutting FID on unseen Busan to 28.4 from 62.1 via cross-temporal reference pairing.</description><pubDate>Mon, 16 Mar 2026 00:00:00 GMT</pubDate><category>AI</category><category>Computer Vision</category><category>Video Generation</category><category>World Models</category><category>Autonomous Driving</category><category>Diffusion Transformer</category></item><item><title>Lost in Stories: How LLMs Lose the Thread in Long Narratives</title><link>https://mllog.dev/en/posts/constory-consistency-bugs-long-stories-llm/</link><guid isPermaLink="true">https://mllog.dev/en/posts/constory-consistency-bugs-long-stories-llm/</guid><description>ConStory-Bench measures consistency in 10,000-word stories: GPT-5-Reasoning leads with 0.113 errors per 10k words, and its checker finds 3.2x more bugs than experts.</description><pubDate>Mon, 09 Mar 2026 00:00:00 GMT</pubDate><category>AI</category><category>LLM</category><category>NLP</category><category>Benchmark</category><category>Text Generation</category><category>Narrative Consistency</category><category>Evaluation</category></item><item><title>Utonia: One Encoder For All Point Clouds</title><link>https://mllog.dev/en/posts/utonia-one-encoder-all-point-clouds/</link><guid isPermaLink="true">https://mllog.dev/en/posts/utonia-one-encoder-all-point-clouds/</guid><description>Utonia trains one 137M encoder for indoor, LiDAR, satellite, CAD and video point clouds. Stripped of color it scores 77.0% mIoU on ScanNet vs Concerto&apos;s 36.8%.</description><pubDate>Sat, 07 Mar 2026 00:00:00 GMT</pubDate><category>AI</category><category>3D</category><category>Point Clouds</category><category>Self-Supervised Learning</category><category>Robotics</category><category>Autonomous Vehicles</category><category>Vision Transformer</category></item><item><title>SAGE: Your Reasoning Model Knows When to Stop Thinking — You Just Won&apos;t Let It</title><link>https://mllog.dev/en/posts/sage-reasoning-model-knows-when-to-stop-thinking/</link><guid isPermaLink="true">https://mllog.dev/en/posts/sage-reasoning-model-knows-when-to-stop-thinking/</guid><description>SAGE scores reasoning paths by cumulative log-probability instead of next-token probability, letting models stop thinking 40-50% earlier at equal or better accuracy.</description><pubDate>Mon, 23 Feb 2026 00:00:00 GMT</pubDate><category>AI</category><category>LLM</category><category>Reasoning</category><category>Reinforcement Learning</category><category>Optimization</category><category>Chain-of-Thought</category><category>Efficiency</category></item><item><title>When GPT Discovers Physics: A Breakthrough in Gluon Theory</title><link>https://mllog.dev/en/posts/gpt-discovers-physics-gluon-amplitudes/</link><guid isPermaLink="true">https://mllog.dev/en/posts/gpt-discovers-physics-gluon-amplitudes/</guid><description>GPT-5.2 Pro proposed the formula showing single-minus gluon amplitudes are nonzero in Klein space, valued only in -1, 0 or 1; it passed five consistency tests.</description><pubDate>Sun, 15 Feb 2026 00:00:00 GMT</pubDate><category>AI</category><category>GPT</category><category>Physics</category><category>OpenAI</category><category>Scientific Discovery</category><category>Gluons</category><category>Field Theory</category></item><item><title>OPUS: How to Train LLMs 6x Faster by Choosing the Right Data</title><link>https://mllog.dev/en/posts/opus-efficient-data-selection-llm-pretraining/</link><guid isPermaLink="true">https://mllog.dev/en/posts/opus-efficient-data-selection-llm-pretraining/</guid><description>OPUS scores every sample by alignment minus redundancy in optimizer update space; on Qwen3-8B it beat full 3B-token training using 0.5B, at 4.7% extra compute.</description><pubDate>Fri, 13 Feb 2026 00:00:00 GMT</pubDate><category>AI</category><category>LLM</category><category>Machine Learning</category><category>Deep Learning</category><category>Data Selection</category><category>Pretraining</category><category>Optimization</category></item><item><title>Green-VLA: One AI Brain for All Robots</title><link>https://mllog.dev/en/posts/green-vla-staged-vision-language-action-generalist-robots/</link><guid isPermaLink="true">https://mllog.dev/en/posts/green-vla-staged-vision-language-action-generalist-robots/</guid><description>Green-VLA trains one policy for humanoids, mobile manipulators and fixed arms across five stages and 3,000 hours of demos, hitting state of the art on CALVIN ABC-D.</description><pubDate>Sun, 08 Feb 2026 00:00:00 GMT</pubDate><category>AI</category><category>Robotics</category><category>VLA</category><category>Machine Learning</category><category>Deep Learning</category><category>Reinforcement Learning</category><category>Vision-Language Models</category></item><item><title>To Grok Grokking: Why Neural Networks Sometimes Understand Late</title><link>https://mllog.dev/en/posts/grokking-provable-ridge-regression/</link><guid isPermaLink="true">https://mllog.dev/en/posts/grokking-provable-ridge-regression/</guid><description>Grokking happens even in ridge regression: fast memorization, a long plateau of orthogonal noise, then late generalization with a delay that scales as 1/λ.</description><pubDate>Tue, 27 Jan 2026 00:00:00 GMT</pubDate><category>Machine Learning</category><category>Generalization</category><category>Grokking</category><category>Ridge Regression</category><category>Regularization</category><category>Theory</category></item><item><title>Tensor Networks: A Mathematical Bridge Between Neural and Symbolic AI</title><link>https://mllog.dev/en/posts/tensor-networks-neuro-symbolic-ai/</link><guid isPermaLink="true">https://mllog.dev/en/posts/tensor-networks-neuro-symbolic-ai/</guid><description>Tensor networks give neural and symbolic AI one language: logic becomes sparse tensors, neural nets low-rank ones, and inference in both is a contraction.</description><pubDate>Fri, 23 Jan 2026 00:00:00 GMT</pubDate><category>Machine Learning</category><category>Neuro-Symbolic AI</category><category>Tensor Networks</category><category>Logic</category><category>Probabilistic Models</category><category>Hybrid AI</category></item><item><title>M²FMoE: When Experts Learn to Predict Floods</title><link>https://mllog.dev/en/posts/m2fmoe-extreme-adaptive-time-series-forecasting/</link><guid isPermaLink="true">https://mllog.dev/en/posts/m2fmoe-extreme-adaptive-time-series-forecasting/</guid><description>M2FMoE routes Fourier and wavelet experts by frequency band to forecast floods without extreme-event labels, cutting error 45.7% on Almaden and beating 13 baselines.</description><pubDate>Wed, 14 Jan 2026 00:00:00 GMT</pubDate><category>Machine Learning</category><category>Time Series</category><category>Mixture of Experts</category><category>Forecasting</category><category>Frequency Analysis</category><category>AAAI 2026</category></item><item><title>BALLAST: When a Bandit Teaches Your Database How Long to Wait</title><link>https://mllog.dev/en/posts/ballast-contextual-bandits-raft-timeouts/</link><guid isPermaLink="true">https://mllog.dev/en/posts/ballast-contextual-bandits-raft-timeouts/</guid><description>BALLAST replaces Raft&apos;s random election timeouts with a LinUCB contextual bandit; a Rust simulator cuts cluster unavailability by 84%, and 90.8% under bursty WAN.</description><pubDate>Mon, 05 Jan 2026 00:00:00 GMT</pubDate><category>Machine Learning</category><category>Distributed Systems</category><category>Raft</category><category>Contextual Bandits</category><category>LinUCB</category></item><item><title>AI Co-Scientist: Teaching Models to Write Research Plans Better Than Humans</title><link>https://mllog.dev/en/posts/ai-co-scientist-rubric-rewards/</link><guid isPermaLink="true">https://mllog.dev/en/posts/ai-co-scientist-rubric-rewards/</guid><description>Rubrics mined from papers turn a frozen grader into an RL reward; experts preferred the generated research plans 70% over baseline and 52% over published ones.</description><pubDate>Tue, 30 Dec 2025 00:00:00 GMT</pubDate><category>Machine Learning</category><category>LLM</category><category>Reinforcement Learning</category><category>AI in Science</category><category>Research</category></item><item><title>HyDRA: Teaching Your Phone to Understand Images Without Breaking the Bank</title><link>https://mllog.dev/en/posts/hydra-dynamic-rank-adaptation-mobile-vlm/</link><guid isPermaLink="true">https://mllog.dev/en/posts/hydra-dynamic-rank-adaptation-mobile-vlm/</guid><description>HyDRA allocates LoRA rank per layer and inside layers automatically, buying a 4.7% gain on mobile vision-language models with no extra trainable parameters.</description><pubDate>Sat, 27 Dec 2025 00:00:00 GMT</pubDate><category>Machine Learning</category><category>LoRA</category><category>Fine-tuning</category><category>VLM</category><category>Mobile AI</category><category>Optimization</category></item><item><title>Comp-LLM: When an Army of Experts Beats a Giant – An Analysis of a Revolution in AI Architecture</title><link>https://mllog.dev/en/posts/comp-llm-composable-inference-framework-analysis-2025/</link><guid isPermaLink="true">https://mllog.dev/en/posts/comp-llm-composable-inference-framework-analysis-2025/</guid><description>Comp-LLM routes a query as a DAG of sub-queries to parallel experts: about 35B scores 0.83 F1 to Llama-2 70B&apos;s 0.85, and 1.1-1.7x faster than sequential agents.</description><pubDate>Tue, 09 Dec 2025 00:00:00 GMT</pubDate><category>AI</category><category>LLM</category><category>Machine Learning</category><category>Comp-LLM</category><category>Architecture</category><category>Research</category></item><item><title>NVIDIA Nemotron Parse v1.1: The Complete Anatomy of the Digital Document Understanding Revolution</title><link>https://mllog.dev/en/posts/nvidia-nemotron-parse-v1-1-analiza-vlm-ocr-deep-dive/</link><guid isPermaLink="true">https://mllog.dev/en/posts/nvidia-nemotron-parse-v1-1-analiza-vlm-ocr-deep-dive/</guid><description>Nemotron Parse v1.1 pairs a C-RADIO ViT-H encoder with an mBART decoder in 885M parameters, squeezing 13,184 visual tokens to 3,201 and emitting Markdown or LaTeX.</description><pubDate>Wed, 26 Nov 2025 00:00:00 GMT</pubDate></item><item><title>Cost-Constrained LLM Cascades — Meet C3PO</title><link>https://mllog.dev/en/posts/llm-cascades-cost-constrained-c3po/</link><guid isPermaLink="true">https://mllog.dev/en/posts/llm-cascades-cost-constrained-c3po/</guid><description>C3PO runs LLM cascades under a probabilistic cost constraint: stay in budget with 95% confidence, escalating to a bigger model only when the cheap one falls short.</description><pubDate>Fri, 14 Nov 2025 00:00:00 GMT</pubDate><category>AI</category><category>LLM</category><category>Machine Learning</category><category>Optimization</category><category>C3PO</category></item><item><title>Accurate Satellite Rain Forecasting with Physics-Conditioned Neural Networks</title><link>https://mllog.dev/en/posts/accurate-satellite-rain-forecasting/</link><guid isPermaLink="true">https://mllog.dev/en/posts/accurate-satellite-rain-forecasting/</guid><description>TUPANN nowcasts rainfall from satellite data alone, adding a differentiable advection operator and lead-time-conditioned MaxViT for forecasts 10-180 minutes ahead.</description><pubDate>Mon, 10 Nov 2025 00:00:00 GMT</pubDate><category>AI</category><category>weather</category><category>machine learning</category><category>physics</category><category>satellite</category></item><item><title>A Universal Crime Predictor – How Hypernetworks and Knowledge Graphs Are Transforming Forecasting</title><link>https://mllog.dev/en/posts/pinfm-foundation-model/</link><guid isPermaLink="true">https://mllog.dev/en/posts/pinfm-foundation-model/</guid><description>HYSTL pairs a crime knowledge graph with a hypernetwork that generates GNN weights per crime type, letting one model forecast across cities with disjoint taxonomies.</description><pubDate>Thu, 06 Nov 2025 00:00:00 GMT</pubDate></item><item><title>CHORD — Smart On-Device Recommendations Without Killing Your Battery</title><link>https://mllog.dev/en/posts/chord-smart-on-device-recommendations/</link><guid isPermaLink="true">https://mllog.dev/en/posts/chord-smart-on-device-recommendations/</guid><description>CHORD sends each phone a bit map from a cloud hypernetwork, quantizing a sequential recommender channel by channel so weak devices keep accuracy and battery.</description><pubDate>Mon, 06 Oct 2025 00:00:00 GMT</pubDate><category>AI</category><category>recommendation</category><category>edge computing</category><category>ML</category><category>quantization</category></item><item><title>DIALTREE‑RPO — a simple guide to &apos;Tree‑based Dialogue Reinforced Policy Optimization&apos;</title><link>https://mllog.dev/en/posts/dialtree-rpo-red-teaming-multi-turn-attacks-llm/</link><guid isPermaLink="true">https://mllog.dev/en/posts/dialtree-rpo-red-teaming-multi-turn-attacks-llm/</guid><description>Friendly explanation of &apos;Tree‑based Dialogue Reinforced Policy Optimization for Red‑Teaming Attacks&apos; — with examples and LaTeX formulas.</description><pubDate>Sat, 04 Oct 2025 00:00:00 GMT</pubDate><category>AI</category><category>red-teaming</category><category>LLM</category><category>reinforcement-learning</category><category>security</category></item><item><title>Attention as a Compass – Teaching Reasoning Models to Explore Smarter</title><link>https://mllog.dev/en/posts/teaching-reasoning-models-to-explore-smarter/</link><guid isPermaLink="true">https://mllog.dev/en/posts/teaching-reasoning-models-to-explore-smarter/</guid><description>AttnRL uses a model&apos;s own attention to pick branching points in process-supervised RL, beating GRPO and TreeRL by 1.8 points on math while cutting training time 8%.</description><pubDate>Wed, 01 Oct 2025 00:00:00 GMT</pubDate><category>AI</category><category>reinforcement learning</category><category>LLM</category><category>reasoning</category><category>AttnRL</category></item><item><title>How to Detect Credit Card Fraud?</title><link>https://mllog.dev/en/posts/how-to-detect-credit-card-fraud/</link><guid isPermaLink="true">https://mllog.dev/en/posts/how-to-detect-credit-card-fraud/</guid><description>Credit card fraud is 492 cases in 284,807 transactions; pairing undersampling with SMOTE beats either alone, and KNN and MLP gain most on the imbalanced test set.</description><pubDate>Sun, 21 Sep 2025 00:00:00 GMT</pubDate><category>AI</category><category>fraud detection</category><category>machine learning</category><category>class imbalance</category><category>MLP</category><category>SMOTE</category></item><item><title>Quantum Trading – AI and Quantum Computing in Investing</title><link>https://mllog.dev/en/posts/quantum-trading-ai-quantum-computing/</link><guid isPermaLink="true">https://mllog.dev/en/posts/quantum-trading-ai-quantum-computing/</guid><description>A QLSTM forecaster plus a QA3C agent trade USD/TWD with just 244 parameters, returning 11.87% over 2020-2025 at 0.92% max drawdown versus classical A3C&apos;s 11.42%.</description><pubDate>Mon, 15 Sep 2025 00:00:00 GMT</pubDate><category>AI</category><category>Quantum Computing</category><category>Reinforcement Learning</category><category>Trading</category></item><item><title>Reinforcement Learning in Pinterest Ads – DRL-PUT in action!</title><link>https://mllog.dev/en/posts/reinforcement-learning-in-pinterest-ads/</link><guid isPermaLink="true">https://mllog.dev/en/posts/reinforcement-learning-in-pinterest-ads/</guid><description>DRL-PUT replaces Pinterest&apos;s hand-tuned ad ranking weights with a policy network picking utility weights per request; A/B tests show CTR up 9.7%, LC-CTR up 7.7%.</description><pubDate>Mon, 08 Sep 2025 00:00:00 GMT</pubDate><category>reinforcement learning</category><category>recommender systems</category><category>Pinterest</category><category>machine learning</category><category>ads</category></item><item><title>Uczenie ze Wzmocnieniem w Reklamach na Pinterest – jak DRL-PUT zmienia grę / Reinforcement Learning in Pinterest Ads – How DRL-PUT Changes the Game</title><link>https://mllog.dev/en/posts/uczene_pinterest/</link><guid isPermaLink="true">https://mllog.dev/en/posts/uczene_pinterest/</guid><description>Pinterest&apos;s DRL-PUT learns the weights of its ad ranking utility with policy gradients instead of tuning them by hand, lifting CTR by 9.7% and LC-CTR by 7.7%.</description><pubDate>Mon, 08 Sep 2025 00:00:00 GMT</pubDate><category>reinforcement learning</category><category>rekomendacje</category><category>Pinterest</category><category>machine learning</category><category>ads</category></item><item><title>The Anatomy of AI Lies: How Language Models Can Deceive Us</title><link>https://mllog.dev/en/posts/the-anatomy-of-ai-lies/</link><guid isPermaLink="true">https://mllog.dev/en/posts/the-anatomy-of-ai-lies/</guid><description>Can LLMs Lie? traces deception to layers 10-15 with logit lens, zero-ablation and steering vectors: models rehearse lies in dummy tokens; bigger models lie better.</description><pubDate>Fri, 05 Sep 2025 00:00:00 GMT</pubDate><category>AI</category><category>Artificial Intelligence</category><category>LLM</category><category>AI Safety</category><category>AI Ethics</category><category>Research</category><category>Interpretability</category><category>Deep Learning</category></item><item><title>Edge AI: How to Accelerate Neural Networks on Specialized Hardware</title><link>https://mllog.dev/en/posts/accelerate_neural_network/</link><guid isPermaLink="true">https://mllog.dev/en/posts/accelerate_neural_network/</guid><description>SLAC&apos;s SNL and Auto-SNL push neural network inference onto MPSoC FPGAs for LCLS-II, swapping weights without reconfiguration and matching or beating hls4ml latency.</description><pubDate>Mon, 01 Sep 2025 00:00:00 GMT</pubDate><category>AI</category><category>FPGA</category><category>Hardware Acceleration</category><category>Machine Learning</category><category>Physics</category><category>MPSoC</category></item><item><title>Global Guarantees of Robustness: A Probabilistic Approach to AI Safety</title><link>https://mllog.dev/en/posts/global-guarantees-of-robustness-probablistic-apporach/</link><guid isPermaLink="true">https://mllog.dev/en/posts/global-guarantees-of-robustness-probablistic-apporach/</guid><description>Rather than certify every point, Mu and Lim estimate the probability that a random input is non-robust, wrapping a Clopper-Pearson interval around a small sample.</description><pubDate>Wed, 27 Aug 2025 00:00:00 GMT</pubDate><category>Artificial Intelligence</category><category>Machine Learning</category><category>Adversarial Robustness</category><category>Global Guarantees</category><category>AI Safety</category></item><item><title>Intern-S1: The New AI Scientist That&apos;s Redefining Research</title><link>https://mllog.dev/en/posts/intern-s1-ai-scientist/</link><guid isPermaLink="true">https://mllog.dev/en/posts/intern-s1-ai-scientist/</guid><description>Intern-S1 is an open-source MoE science foundation model with 28B activated parameters, trained on 5T tokens and a Mixture-of-Rewards spanning over 1000 tasks.</description><pubDate>Sat, 23 Aug 2025 00:00:00 GMT</pubDate><category>AI</category><category>Machine Learning</category><category>Science</category><category>Multimodal Models</category></item><item><title>Look Inside Seamless Flow&apos;s Hyper-Efficient Training</title><link>https://mllog.dev/en/posts/seamless-flow-ai-factory/</link><guid isPermaLink="true">https://mllog.dev/en/posts/seamless-flow-ai-factory/</guid><description>Seamless Flow kills RL pipeline bubbles with a data plane and tag-driven GPU scheduling: up to 100% more throughput than VERL, and 23.0% to 45.8% on SWE-Bench.</description><pubDate>Mon, 18 Aug 2025 00:00:00 GMT</pubDate><category>AI</category><category>Reinforcement Learning</category><category>LLM</category><category>Tech Explained</category><category>GPU Utilization</category><category>System Design</category></item><item><title>Systematization of Knowledge: Data Minimization in Machine Learning</title><link>https://mllog.dev/en/posts/sok-data-minimization-in-machine-learning/</link><guid isPermaLink="true">https://mllog.dev/en/posts/sok-data-minimization-in-machine-learning/</guid><description>SoK: Data Minimization in Machine Learning maps the GDPR principle onto ML pipelines, separating horizontal from vertical techniques and pre-hoc from post-hoc steps.</description><pubDate>Fri, 15 Aug 2025 00:00:00 GMT</pubDate><category>machine learning</category><category>data minimization</category><category>AI</category><category>privacy</category><category>GDPR</category></item><item><title>Learning Machines That Don&apos;t Forget: A New Method for Evolving Data</title><link>https://mllog.dev/en/posts/learning_machines/</link><guid isPermaLink="true">https://mllog.dev/en/posts/learning_machines/</guid><description>DyMoE counters catastrophic forgetting in incremental graph learning by adding a new expert per increment, with gating and a loss that makes older experts teach it.</description><pubDate>Thu, 14 Aug 2025 00:00:00 GMT</pubDate><category>Artificial Intelligence</category><category>Machine Learning</category><category>Graphs</category><category>Science</category></item><item><title>Dynamic Fine-Tuning (DFT): How a Single Line of Code is Revolutionizing AI Training</title><link>https://mllog.dev/en/posts/dynamic-fine-tuning-dft/</link><guid isPermaLink="true">https://mllog.dev/en/posts/dynamic-fine-tuning-dft/</guid><description>Dynamic Fine-Tuning rescales each token loss by the inverse of its probability, a one-line change that beats SFT on generalization and rivals offline RL methods.</description><pubDate>Mon, 11 Aug 2025 00:00:00 GMT</pubDate><category>AI</category><category>LLM</category><category>Machine Learning</category><category>SFT</category><category>DFT</category><category>Reinforcement Learning</category></item><item><title>A Deep Dive into the Text-to-SQL Revolution: Analyzing the Adaptive Method</title><link>https://mllog.dev/en/posts/deep-dive-text-to-sql-adaptive-method/</link><guid isPermaLink="true">https://mllog.dev/en/posts/deep-dive-text-to-sql-adaptive-method/</guid><description>Adaptive Text-to-SQL splits the work in two: a Selector retrieves conceptually similar question-schema-SQL triples, a Generator writes the query in-context.</description><pubDate>Mon, 11 Aug 2025 00:00:00 GMT</pubDate><category>Artificial Intelligence</category><category>Natural Language Processing</category><category>SQL</category><category>LLM</category><category>Text-to-SQL</category><category>Data Analysis</category><category>Machine Learning</category></item><item><title>ASkDAgger: How Artificial Intelligence Learns More Effectively by Asking Questions</title><link>https://mllog.dev/en/posts/askdagger-interactive-imitation-learning/</link><guid isPermaLink="true">https://mllog.dev/en/posts/askdagger-interactive-imitation-learning/</guid><description>ASkDAgger lets a robot flag an uncertain plan before acting; adaptive gating and foresight replay cut teacher queries and raise success on CLIPort and a real arm.</description><pubDate>Fri, 08 Aug 2025 00:00:00 GMT</pubDate><category>AI</category><category>Machine Learning</category><category>Robotics</category><category>Imitation Learning</category><category>NLP</category></item><item><title>CaPulse: Teaching Machines to Hear the Rhythm of Data</title><link>https://mllog.dev/en/posts/capulse-teaching-machines-to-hear-the-rhythm-of-data/</link><guid isPermaLink="true">https://mllog.dev/en/posts/capulse-teaching-machines-to-hear-the-rhythm-of-data/</guid><description>CaPulse spots time-series anomalies by learning the causal rhythm of data: it fires when the cause-effect order breaks, not when a threshold is crossed.</description><pubDate>Thu, 07 Aug 2025 00:00:00 GMT</pubDate><category>AI</category><category>Machine Learning</category><category>Science</category><category>Technology</category><category>Time Series</category></item><item><title>Goedel-Prover-V2: A Revolution in Automated Theorem Proving</title><link>https://mllog.dev/en/posts/goedel-prover-v2-revolution-in-automated-theorem-proving/</link><guid isPermaLink="true">https://mllog.dev/en/posts/goedel-prover-v2-revolution-in-automated-theorem-proving/</guid><description>Goedel-Prover-V2 learns from scaffolded proof sketches and its own failed Lean attempts, outperforming AlphaProof and DeepSeek-Prover on miniF2F and PutnamBench.</description><pubDate>Wed, 06 Aug 2025 00:00:00 GMT</pubDate><category>AI</category><category>Artificial Intelligence</category><category>Mathematics</category><category>Formal Proving</category><category>LLM</category></item><item><title>How to Teach AI to Handle Mistakes? Meet ε-Softmax</title><link>https://mllog.dev/en/posts/esoftmax-approximating-one-hot-vectors/</link><guid isPermaLink="true">https://mllog.dev/en/posts/esoftmax-approximating-one-hot-vectors/</guid><description>ε-Softmax swaps rigid one-hot targets for slightly softened ones, so a mislabeled example costs the model far less. A NeurIPS 2024 answer to noisy training labels.</description><pubDate>Tue, 05 Aug 2025 00:00:00 GMT</pubDate><category>AI</category><category>Machine Learning</category><category>Research</category><category>Technology</category></item><item><title>Simple and Effective Method for Uncertainty Quantification</title><link>https://mllog.dev/en/posts/quantitive_effective/</link><guid isPermaLink="true">https://mllog.dev/en/posts/quantitive_effective/</guid><description>Uncertainty from one deterministic model: kernel density estimation in feature space builds an information potential field flagging OOD samples on CIFAR-10 vs SVHN.</description><pubDate>Mon, 04 Aug 2025 00:00:00 GMT</pubDate><category>Machine Learning</category><category>Uncertainty Quantification</category><category>OOD Detection</category><category>arXiv</category><category>AI</category></item><item><title>Deep Learning-based Prediction of Clinical Trial Enrollment with Uncertainty Estimates</title><link>https://mllog.dev/en/posts/deep-learning-clinical-trial/</link><guid isPermaLink="true">https://mllog.dev/en/posts/deep-learning-clinical-trial/</guid><description>A multimodal Clinical Longformer model predicts trial enrollment at R² 0.76 and forecasts recruitment duration with 7.52-month MAE versus 10.55 for fit-and-filter.</description><pubDate>Sat, 02 Aug 2025 00:00:00 GMT</pubDate><category>clinical trials</category><category>machine learning</category><category>deep learning</category><category>uncertainty</category></item><item><title>Consensus-Driven Active Model Selection</title><link>https://mllog.dev/en/posts/coda-consensus-driven-active-model-selection/</link><guid isPermaLink="true">https://mllog.dev/en/posts/coda-consensus-driven-active-model-selection/</guid><description>CODA picks the best model from many candidates via their agreement: Bayesian Dawid-Skene plus information gain wins 18 of 26 benchmarks with up to 70% fewer labels.</description><pubDate>Fri, 01 Aug 2025 00:00:00 GMT</pubDate><category>machine learning</category><category>active learning</category><category>model selection</category><category>Bayesian inference</category></item><item><title>RLVMR: Reinforcement Learning with Verifiable Meta‑Reasoning Rewards for Robust Long‑Horizon Agents</title><link>https://mllog.dev/en/posts/rlvmr-wzmocnione-uczenie-z-weryfikowalnymi-nagradzajacymi-meta-rozumowaniem/</link><guid isPermaLink="true">https://mllog.dev/en/posts/rlvmr-wzmocnione-uczenie-z-weryfikowalnymi-nagradzajacymi-meta-rozumowaniem/</guid><description>RLVMR adds a verifiable meta-reasoning reward to the environment reward, scoring the agent&apos;s reasoning trace so long-horizon agents take fewer semantic shortcuts.</description><pubDate>Thu, 31 Jul 2025 00:00:00 GMT</pubDate><category>AI</category><category>adaptacyjna sensoryka</category><category>rle</category></item><item><title>How AI Can Reveal Where Your Honey Comes From — A Look at Mineral Fingerprints</title><link>https://mllog.dev/en/posts/honey-origin-classification-review-en/</link><guid isPermaLink="true">https://mllog.dev/en/posts/honey-origin-classification-review-en/</guid><description>Random Forests read the 12-mineral fingerprint of 429 honey samples to name the source flower with 99.50% accuracy and the region of origin with 98.01%.</description><pubDate>Wed, 30 Jul 2025 00:00:00 GMT</pubDate><category>honey</category><category>machine-learning</category><category>food-authenticity</category><category>mineral-profiles</category></item><item><title>Optimizing Call Center Operations with Reinforcement Learning: PPO vs. Value Iteration</title><link>https://mllog.dev/en/posts/call-center-ppo-vs-vi-en/</link><guid isPermaLink="true">https://mllog.dev/en/posts/call-center-ppo-vs-vi-en/</guid><description>PPO beats classical Value Iteration at call routing in a discrete-event call centre simulation: shortest customer wait, least agent idle time, highest RL reward.</description><pubDate>Sat, 26 Jul 2025 00:00:00 GMT</pubDate><category>Reinforcement Learning</category><category>PPO</category><category>Value Iteration</category><category>Call Center</category><category>Artificial Intelligence</category></item><item><title>Efficient &amp; Geometrically-Smart: Linear Memory SE(2)-Invariant Attention Explained</title><link>https://mllog.dev/en/posts/efficient-geometrically-smart-linear-memory-se2-invariant-attention/</link><guid isPermaLink="true">https://mllog.dev/en/posts/efficient-geometrically-smart-linear-memory-se2-invariant-attention/</guid><description>Fourier-encoded relative pose lets SE(2)-invariant attention use linear rather than quadratic memory, with error below 0.001. Best paper at the RSS 2025 workshop.</description><pubDate>Fri, 25 Jul 2025 00:00:00 GMT</pubDate><category>Machine Learning</category><category>Transformers</category><category>Geometric AI</category><category>Popular Science</category></item><item><title>A Lightweight AI Engine for Skin Cancer Detection on Wearable Devices</title><link>https://mllog.dev/en/posts/ai-engine-skin-cancer/</link><guid isPermaLink="true">https://mllog.dev/en/posts/ai-engine-skin-cancer/</guid><description>A MobileNetV2 skin-lesion classifier compressed with TensorRT runs on a Jetson Orin Nano at 41% of its original size, scoring 87.2% F1 with 93% lower power in INT8.</description><pubDate>Thu, 24 Jul 2025 00:00:00 GMT</pubDate><category>AI</category><category>MobileNetV2</category><category>skin cancer</category><category>wearable devices</category></item><item><title>SOPHIA: Enhancing Slow‑Thinking in Large Vision‑Language Models</title><link>https://mllog.dev/en/posts/sophia-enhancing-slow-thinking/</link><guid isPermaLink="true">https://mllog.dev/en/posts/sophia-enhancing-slow-thinking/</guid><description>SOPHIA mixes on-policy visual grounding with off-policy reasoning chains and backward reward propagation, adding 8.5 points of average accuracy to InternVL3.0-38B.</description><pubDate>Wed, 23 Jul 2025 00:00:00 GMT</pubDate><category>AI</category><category>LVLM</category><category>reinforcement learning</category><category>SOPHIA</category></item><item><title>The Role of AI in Managing Satellite Constellations</title><link>https://mllog.dev/en/posts/the-role-of-ai-in-managing-satellite-constellations/</link><guid isPermaLink="true">https://mllog.dev/en/posts/the-role-of-ai-in-managing-satellite-constellations/</guid><description>ConstellAI, an ESA project, uses reinforcement learning for routing in satellite mega-constellations, beating Dijkstra on delay and predicting bandwidth demand.</description><pubDate>Tue, 22 Jul 2025 00:00:00 GMT</pubDate><category>ConstellAI</category><category>Reinforcement Learning</category><category>Satellites</category></item><item><title>On the Fundamental Limitations of Dual Static CVaR Decompositions in Markov Decision Processes</title><link>https://mllog.dev/en/posts/fundamental-limitations-dual-cvar-decompositions/</link><guid isPermaLink="true">https://mllog.dev/en/posts/fundamental-limitations-dual-cvar-decompositions/</guid><description>Godbout and Durand show the two dual CVaR formulas can share no feasible risk assignment, and build an MDP where no policy is optimal at every risk level.</description><pubDate>Mon, 21 Jul 2025 00:00:00 GMT</pubDate><category>Markov Decision Processes</category><category>CVaR</category><category>dual decomposition</category></item><item><title>PinFM: Foundation Model for User Activity Sequences at a Billion-Scale Visual Discovery Platform</title><link>https://mllog.dev/en/posts/pinfm-foundation-model-user-activity/</link><guid isPermaLink="true">https://mllog.dev/en/posts/pinfm-foundation-model-user-activity/</guid><description>PinFM, Pinterest&apos;s 20B-parameter sequence transformer, uses deduplicated cross-attention and int4 embeddings to lift throughput 600% and engagement 20%.</description><pubDate>Sun, 20 Jul 2025 00:00:00 GMT</pubDate></item><item><title>GradNetOT: Learning Optimal Transport Maps with GradNets</title><link>https://mllog.dev/en/posts/gradnetot-method/</link><guid isPermaLink="true">https://mllog.dev/en/posts/gradnetot-method/</guid><description>GradNetOT learns optimal transport maps as the gradient of a convex potential, using a monotone gradient network trained on the Monge–Ampère residual.</description><pubDate>Sat, 19 Jul 2025 00:00:00 GMT</pubDate><category>GradNetOT</category><category>Optimal Transport</category><category>Neural Networks</category></item><item><title>Unstable Power: How Sharpness Drives Deep Network Learning</title><link>https://mllog.dev/en/posts/learning-on-the-border-ntk/</link><guid isPermaLink="true">https://mllog.dev/en/posts/learning-on-the-border-ntk/</guid><description>A larger learning rate leaves the NTK better aligned with the labels at the Edge of Stability: Kernel Target Alignment jumps exactly when sharpness drops.</description><pubDate>Fri, 18 Jul 2025 00:00:00 GMT</pubDate><category>popularization</category><category>machine learning</category><category>NTK</category><category>Edge of Stability</category></item><item><title>RiemannLoRA: A Unified Riemannian Framework for Ambiguity-Free LoRA Optimization</title><link>https://mllog.dev/en/posts/riemannlora-unified-riemannian-framework/</link><guid isPermaLink="true">https://mllog.dev/en/posts/riemannlora-unified-riemannian-framework/</guid><description>RiemannLoRA places LoRA updates on the manifold of rank-r matrices, erasing factorization ambiguity: half the fine-tuning steps and up to 1.2 BLEU more.</description><pubDate>Thu, 17 Jul 2025 00:00:00 GMT</pubDate><category>Machine Learning</category><category>Riemannian Optimization</category><category>LoRA</category><category>Fine-tuning</category></item><item><title>A Neural Network Model of Complementary Learning Systems: Pattern Separation and Completion for Continual Learning</title><link>https://mllog.dev/en/posts/nn-model-of-complementary-learning-systems/</link><guid isPermaLink="true">https://mllog.dev/en/posts/nn-model-of-complementary-learning-systems/</guid><description>A complementary learning systems model pairs a VAE with a modern Hopfield network for pattern separation and completion, hitting 90% average accuracy on Split-MNIST.</description><pubDate>Wed, 16 Jul 2025 00:00:00 GMT</pubDate></item><item><title>Target Polish: How to Polish Data and Reveal Its True Structure</title><link>https://mllog.dev/en/posts/target-polish/</link><guid isPermaLink="true">https://mllog.dev/en/posts/target-polish/</guid><description>Target Polish cleans data before factorizing it: clip X into a delta band around the current WH estimate, refactorize, repeat. Robust NMF for matrices and tensors.</description><pubDate>Tue, 15 Jul 2025 00:00:00 GMT</pubDate><category>NMF</category><category>artificial intelligence</category><category>machine learning</category><category>data analysis</category><category>target polish</category></item><item><title>Optimistic Exploration for Risk-Averse Constrained Reinforcement Learning</title><link>https://mllog.dev/en/posts/optimistic-exploration-risk-averse-crl/</link><guid isPermaLink="true">https://mllog.dev/en/posts/optimistic-exploration-risk-averse-crl/</guid><description>ORAC maximizes an upper confidence bound on reward while minimizing a lower bound on cost, with an adaptive penalty, tested on Safety-Gymnasium and CityLearn.</description><pubDate>Mon, 14 Jul 2025 00:00:00 GMT</pubDate></item><item><title>Not Just Bigger Models: Why AI Should See Better Instead of Just Scaling</title><link>https://mllog.dev/en/posts/adaptive-sensing/</link><guid isPermaLink="true">https://mllog.dev/en/posts/adaptive-sensing/</guid><description>Adaptive sensing beats brute-force scale: EfficientNet-B0 paired with sensors that tune themselves to the scene outperforms OpenCLIP-H on perception tasks.</description><pubDate>Sun, 13 Jul 2025 00:00:00 GMT</pubDate><category>AI</category><category>adaptive sensing</category><category>machine learning</category></item><item><title>HGMP: Revolutionizing Complex Graph Analysis with Prompt Learning</title><link>https://mllog.dev/en/posts/hgmp-revolution-graph-prompt-learning/</link><guid isPermaLink="true">https://mllog.dev/en/posts/hgmp-revolution-graph-prompt-learning/</guid><description>HGMP recasts node, edge and ranking tasks as graph-level prompts, combining contrastive pre-training with per-type feature prompts for heterogeneous graph learning.</description><pubDate>Sat, 12 Jul 2025 00:00:00 GMT</pubDate><category>graph learning</category><category>prompt learning</category><category>multi-task</category><category>AI</category><category>research</category></item><item><title>Predicting and Generating Antibiotics Against Future Pathogens with ApexOracle</title><link>https://mllog.dev/en/posts/apexoracle-forecast-antibiotics/</link><guid isPermaLink="true">https://mllog.dev/en/posts/apexoracle-forecast-antibiotics/</guid><description>ApexOracle fuses Evo2 genome embeddings with a SELFIES diffusion model to predict MIC and design new antibiotics, with R2 gains up to 15% on P. aeruginosa.</description><pubDate>Fri, 11 Jul 2025 00:00:00 GMT</pubDate><category>ML</category><category>Antibiotics</category><category>Drug Discovery</category><category>Diffusion Models</category></item><item><title>HeLo – A New Path for Multimodal Emotion Recognition</title><link>https://mllog.dev/en/posts/helo-multimodal-emotion-recognition/</link><guid isPermaLink="true">https://mllog.dev/en/posts/helo-multimodal-emotion-recognition/</guid><description>HeLo predicts a distribution over emotions instead of one label, fusing ECG and video via cross-attention, entropic optimal transport and a label-correlation loss.</description><pubDate>Thu, 10 Jul 2025 00:00:00 GMT</pubDate><category>multimodal</category><category>emotion</category><category>machine learning</category></item><item><title>Modern Methods in Associative Memory</title><link>https://mllog.dev/en/posts/modern-methods-in-associative-memory/</link><guid isPermaLink="true">https://mllog.dev/en/posts/modern-methods-in-associative-memory/</guid><description>Hopfield networks store only 0.14N patterns; dense variants reach polynomial capacity and modern ones exponential, with a Lagrangian view linking them to attention.</description><pubDate>Wed, 09 Jul 2025 00:00:00 GMT</pubDate><category>Associative Memory</category><category>Hopfield Networks</category><category>Transformers</category><category>Diffusion Models</category></item><item><title>QuEst: Blending Data and Predictions for Robust Quantile Estimation</title><link>https://mllog.dev/en/posts/quest-robust-quantile-estimation/</link><guid isPermaLink="true">https://mllog.dev/en/posts/quest-robust-quantile-estimation/</guid><description>QuEst blends a small gold sample with large model-generated imputations to estimate quantiles and CVaR, canceling simulator bias and minimizing sampling variance.</description><pubDate>Tue, 08 Jul 2025 00:00:00 GMT</pubDate><category>QuEst</category><category>Quantile Estimation</category><category>Statistics</category><category>Machine Learning</category></item><item><title>RetrySQL: Self-Correcting Query Generation</title><link>https://mllog.dev/en/posts/retrysql-self-correction-in-sql-generation/</link><guid isPermaLink="true">https://mllog.dev/en/posts/retrysql-self-correction-in-sql-generation/</guid><description>RetrySQL injects deliberate wrong reasoning steps and a BACK token into text-to-SQL pretraining, lifting OpenCoder 1.5B execution accuracy by 4 points toward GPT-4o.</description><pubDate>Mon, 07 Jul 2025 00:00:00 GMT</pubDate><category>RetrySQL</category><category>text-to-SQL</category><category>LLM</category><category>machine-learning</category></item><item><title>How Modern Information Theory Helps Diagnose Mental Disorders – MvHo‑IB in Action</title><link>https://mllog.dev/en/posts/mvho-ib-brain-disorder-diagnosis/</link><guid isPermaLink="true">https://mllog.dev/en/posts/mvho-ib-brain-disorder-diagnosis/</guid><description>MvHo-IB diagnoses brain disorders from rs-fMRI by adding triplet O-information to pairwise connectivity, gaining up to 7% accuracy on ABIDE, ADHD-200 and COBRE.</description><pubDate>Sun, 06 Jul 2025 00:00:00 GMT</pubDate><category>fMRI</category><category>AI</category><category>deep learning</category><category>information theory</category><category>neuroimaging</category></item><item><title>Multi-level Stepwise Hints in Reinforcement Learning</title><link>https://mllog.dev/en/posts/multi-level-step-by-stepguidelines/</link><guid isPermaLink="true">https://mllog.dev/en/posts/multi-level-step-by-stepguidelines/</guid><description>StepHint splits reasoning chains by end-of-step token probability, then feeds RL agents hints at several levels, easing near-miss errors and stalled exploration.</description><pubDate>Sat, 05 Jul 2025 00:00:00 GMT</pubDate></item><item><title>How to Predict Scooter Demand? XGBoost and Urban Micromobility</title><link>https://mllog.dev/en/posts/blog_xgboost/</link><guid isPermaLink="true">https://mllog.dev/en/posts/blog_xgboost/</guid><description>XGBoost on 341 temporal, spatial and network features predicts e-scooter demand 27-49% better than rivals and up to 90% better than Prophet, node centrality on top.</description><pubDate>Fri, 04 Jul 2025 00:00:00 GMT</pubDate><category>XGBoost</category><category>AI</category><category>machine learning</category></item><item><title>Ghost Nodes: A Trick That Makes Neural Networks Learn Smarter</title><link>https://mllog.dev/en/posts/xgboost-how-to-predict-demand/</link><guid isPermaLink="true">https://mllog.dev/en/posts/xgboost-how-to-predict-demand/</guid><description>Ghost nodes add fake output classes: softmax runs over 13 outputs while loss counts only the 10 real ones, giving gradients room to escape flat regions early.</description><pubDate>Thu, 03 Jul 2025 00:00:00 GMT</pubDate><category>ghost</category><category>AI</category><category>machine learning</category><category>trees</category></item><item><title>Does artificial intelligence really understand math? Let&apos;s find out what it says... data audit?</title><link>https://mllog.dev/en/posts/math_datasheets/</link><guid isPermaLink="true">https://mllog.dev/en/posts/math_datasheets/</guid><description>A neural-mechanistic hybrid forecasts epidemics from differentially private mobility and spending data, still beating public-health-only models under strong noise.</description><pubDate>Tue, 01 Jul 2025 00:00:00 GMT</pubDate><category>prywatność</category><category>AI</category><category>nauczanie maszynowe</category><category>epidemie</category></item><item><title>Unbreakable in the Face of Adversity: ARMOR – Resilient UAV Control</title><link>https://mllog.dev/en/posts/blog_armor/</link><guid isPermaLink="true">https://mllog.dev/en/posts/blog_armor/</guid><description>ARMOR trains a teacher VAE on privileged attack data and an LSTM student on raw sensor history, giving UAVs zero-shot robustness to unseen GPS spoofing and jamming.</description><pubDate>Mon, 30 Jun 2025 00:00:00 GMT</pubDate></item><item><title>Mind2Web 2: A new era of “agent-based” web search</title><link>https://mllog.dev/en/posts/mind2web-agent-based-web-search/</link><guid isPermaLink="true">https://mllog.dev/en/posts/mind2web-agent-based-web-search/</guid><description>Mind2Web 2 grades agentic web search on 130 tasks with an Agent-as-a-Judge rubric; the best of nine systems reaches 50-70% of human quality at twice the speed.</description><pubDate>Sun, 29 Jun 2025 00:00:00 GMT</pubDate><category>AI</category><category>searching</category><category>mind2web</category></item><item><title>A Machine That Discovers the Laws of Physics: How H-FEX Works and Why It Matters</title><link>https://mllog.dev/en/posts/hfex-machine-that-discovers-the-laws-of-physics/</link><guid isPermaLink="true">https://mllog.dev/en/posts/hfex-machine-that-discovers-the-laws-of-physics/</guid><description>H-FEX searches symbolic expressions for a system&apos;s Hamiltonian, recovering exp(-1.0003p² - 1.1002q⁴) almost exactly and beating SINDy on long-term energy drift.</description><pubDate>Sat, 28 Jun 2025 00:00:00 GMT</pubDate><category>physics</category><category>AI</category><category>symbolic learning</category><category>H-FEX</category></item><item><title>When the Bandit Is Stronger Than Your Model – On the Limits of Exploratory Learning</title><link>https://mllog.dev/en/posts/bandit_learning_artykul/</link><guid isPermaLink="true">https://mllog.dev/en/posts/bandit_learning_artykul/</guid><description>Bandit learning has no VC-dimension analogue: a class can need only 2 queries yet stay intractable unless RP = NP. With a Rust epsilon-greedy A/B/n example.</description><pubDate>Fri, 27 Jun 2025 00:00:00 GMT</pubDate></item></channel></rss>