Machine Learning

ML algorithms, training, and inference

Top This Week

As Meta Flounders, It Reportedly Plans to Open Source Its New AI Models
Machine Learning

As Meta Flounders, It Reportedly Plans to Open Source Its New AI Models

AI Tools & Products · 5 min ·
Google quietly launched an AI dictation app that works offline
Machine Learning

Google quietly launched an AI dictation app that works offline

Google's new offline-first dictation app uses Gemma AI models to take on the apps like Wispr Flow.

TechCrunch - AI · 4 min ·
Llms

Why do the various LLM disappoint me in reading requests?

Serious question here. I have tried various LLM over the past year to help me choose fictional novels to read based on a decent amount of...

Reddit - Artificial Intelligence · 1 min ·

All Content

[2603.22771] Explainable Threat Attribution for IoT Networks Using Conditional SHAP and Flow Behavior Modelling
Machine Learning

[2603.22771] Explainable Threat Attribution for IoT Networks Using Conditional SHAP and Flow Behavior Modelling

Abstract page for arXiv paper 2603.22771: Explainable Threat Attribution for IoT Networks Using Conditional SHAP and Flow Behavior Modelling

arXiv - Machine Learning · 3 min ·
[2603.22758] Reconstruction-Guided Slot Curriculum: Addressing Object Over-Fragmentation in Video Object-Centric Learning
Machine Learning

[2603.22758] Reconstruction-Guided Slot Curriculum: Addressing Object Over-Fragmentation in Video Object-Centric Learning

Abstract page for arXiv paper 2603.22758: Reconstruction-Guided Slot Curriculum: Addressing Object Over-Fragmentation in Video Object-Cen...

arXiv - Machine Learning · 4 min ·
[2603.22755] KALAVAI: Predicting When Independent Specialist Fusion Works -- A Quantitative Model for Post-Hoc Cooperative LLM Training
Llms

[2603.22755] KALAVAI: Predicting When Independent Specialist Fusion Works -- A Quantitative Model for Post-Hoc Cooperative LLM Training

Abstract page for arXiv paper 2603.22755: KALAVAI: Predicting When Independent Specialist Fusion Works -- A Quantitative Model for Post-H...

arXiv - AI · 3 min ·
[2603.22750] REALITrees: Rashomon Ensemble Active Learning for Interpretable Trees
Machine Learning

[2603.22750] REALITrees: Rashomon Ensemble Active Learning for Interpretable Trees

Abstract page for arXiv paper 2603.22750: REALITrees: Rashomon Ensemble Active Learning for Interpretable Trees

arXiv - Machine Learning · 3 min ·
[2603.22629] LGSE: Lexically Grounded Subword Embedding Initialization for Low-Resource Language Adaptation
Llms

[2603.22629] LGSE: Lexically Grounded Subword Embedding Initialization for Low-Resource Language Adaptation

Abstract page for arXiv paper 2603.22629: LGSE: Lexically Grounded Subword Embedding Initialization for Low-Resource Language Adaptation

arXiv - AI · 4 min ·
[2603.22665] Improving LLM Predictions via Inter-Layer Structural Encoders
Llms

[2603.22665] Improving LLM Predictions via Inter-Layer Structural Encoders

Abstract page for arXiv paper 2603.22665: Improving LLM Predictions via Inter-Layer Structural Encoders

arXiv - Machine Learning · 3 min ·
[2603.22624] Toward Faithful Segmentation Attribution via Benchmarking and Dual-Evidence Fusion
Machine Learning

[2603.22624] Toward Faithful Segmentation Attribution via Benchmarking and Dual-Evidence Fusion

Abstract page for arXiv paper 2603.22624: Toward Faithful Segmentation Attribution via Benchmarking and Dual-Evidence Fusion

arXiv - AI · 4 min ·
[2603.22623] To Agree or To Be Right? The Grounding-Sycophancy Tradeoff in Medical Vision-Language Models
Llms

[2603.22623] To Agree or To Be Right? The Grounding-Sycophancy Tradeoff in Medical Vision-Language Models

Abstract page for arXiv paper 2603.22623: To Agree or To Be Right? The Grounding-Sycophancy Tradeoff in Medical Vision-Language Models

arXiv - AI · 4 min ·
[2603.22644] Overfitting and Generalizing with (PAC) Bayesian Prediction in Noisy Binary Classification
Machine Learning

[2603.22644] Overfitting and Generalizing with (PAC) Bayesian Prediction in Noisy Binary Classification

Abstract page for arXiv paper 2603.22644: Overfitting and Generalizing with (PAC) Bayesian Prediction in Noisy Binary Classification

arXiv - Machine Learning · 4 min ·
[2603.22563] Privacy-Preserving Reinforcement Learning from Human Feedback via Decoupled Reward Modeling
Llms

[2603.22563] Privacy-Preserving Reinforcement Learning from Human Feedback via Decoupled Reward Modeling

Abstract page for arXiv paper 2603.22563: Privacy-Preserving Reinforcement Learning from Human Feedback via Decoupled Reward Modeling

arXiv - Machine Learning · 3 min ·
[2603.22593] Language Models Can Explain Visual Features via Steering
Llms

[2603.22593] Language Models Can Explain Visual Features via Steering

Abstract page for arXiv paper 2603.22593: Language Models Can Explain Visual Features via Steering

arXiv - AI · 3 min ·
[2603.22472] Wake Up to the Past: Using Memory to Model Fluid Wake Effects on Robots
Machine Learning

[2603.22472] Wake Up to the Past: Using Memory to Model Fluid Wake Effects on Robots

Abstract page for arXiv paper 2603.22472: Wake Up to the Past: Using Memory to Model Fluid Wake Effects on Robots

arXiv - Machine Learning · 4 min ·
[2603.22582] Lie to Me: How Faithful Is Chain-of-Thought Reasoning in Reasoning Models?
Llms

[2603.22582] Lie to Me: How Faithful Is Chain-of-Thought Reasoning in Reasoning Models?

Abstract page for arXiv paper 2603.22582: Lie to Me: How Faithful Is Chain-of-Thought Reasoning in Reasoning Models?

arXiv - AI · 4 min ·
[2603.22577] STRIATUM-CTF: A Protocol-Driven Agentic Framework for General-Purpose CTF Solving
Llms

[2603.22577] STRIATUM-CTF: A Protocol-Driven Agentic Framework for General-Purpose CTF Solving

Abstract page for arXiv paper 2603.22577: STRIATUM-CTF: A Protocol-Driven Agentic Framework for General-Purpose CTF Solving

arXiv - AI · 4 min ·
[2603.22468] SPDE Methods for Nonparametric Bayesian Posterior Contraction and Laplace Approximation
Machine Learning

[2603.22468] SPDE Methods for Nonparametric Bayesian Posterior Contraction and Laplace Approximation

Abstract page for arXiv paper 2603.22468: SPDE Methods for Nonparametric Bayesian Posterior Contraction and Laplace Approximation

arXiv - Machine Learning · 3 min ·
[2603.22528] GraphRAG for Engineering Diagrams: ChatP&ID Enables LLM Interaction with P&IDs
Llms

[2603.22528] GraphRAG for Engineering Diagrams: ChatP&ID Enables LLM Interaction with P&IDs

Abstract page for arXiv paper 2603.22528: GraphRAG for Engineering Diagrams: ChatP&ID Enables LLM Interaction with P&IDs

arXiv - AI · 4 min ·
[2603.22437] mmFHE: mmWave Sensing with End-to-End Fully Homomorphic Encryption
Machine Learning

[2603.22437] mmFHE: mmWave Sensing with End-to-End Fully Homomorphic Encryption

Abstract page for arXiv paper 2603.22437: mmFHE: mmWave Sensing with End-to-End Fully Homomorphic Encryption

arXiv - Machine Learning · 4 min ·
[2603.22519] LLMON: An LLM-native Markup Language to Leverage Structure and Semantics at the LLM Interface
Llms

[2603.22519] LLMON: An LLM-native Markup Language to Leverage Structure and Semantics at the LLM Interface

Abstract page for arXiv paper 2603.22519: LLMON: An LLM-native Markup Language to Leverage Structure and Semantics at the LLM Interface

arXiv - AI · 4 min ·
[2603.22518] High Resolution Flood Extent Detection Using Deep Learning with Random Forest Derived Training Labels
Machine Learning

[2603.22518] High Resolution Flood Extent Detection Using Deep Learning with Random Forest Derived Training Labels

Abstract page for arXiv paper 2603.22518: High Resolution Flood Extent Detection Using Deep Learning with Random Forest Derived Training ...

arXiv - AI · 4 min ·
[2603.22401] Probabilistic modeling over permutations using quantum computers
Machine Learning

[2603.22401] Probabilistic modeling over permutations using quantum computers

Abstract page for arXiv paper 2603.22401: Probabilistic modeling over permutations using quantum computers

arXiv - Machine Learning · 4 min ·
Previous Page 129 Next

Related Topics

Stay updated with AI News

Get the latest news, tools, and insights delivered to your inbox.

Daily or weekly digest • Unsubscribe anytime