·
DataBubble
  • Home
  • Models
  • News
  • Compare
  • Boards
  • Pricing
  • About
  • Newsletter
  • Methodology
  • Contact
Latest
Bringing Value Models Back: Generative Critics for Value Modeling in LLM Reinforcement Learning9h◆Subagents vs Agent Skills: Executing Reusable Knowledge for Long-Horizon Agentic Tasks9h◆Distribution-Consistent Inference for Dynamic Sparse Mixture-of-Experts9h◆In RAG We Trust? Measuring Robustness of Retrieval-Augmented Generation Under Document Poisoning9h◆FrontierChallenge: Evaluating Scientific Workflow Completion9h◆IBIB: A Protocol for Measuring Enterprise AI Systems by Serving Route, Not Model Identifier9h◆AgenticGen: Reward-Guided Agentic Video Generation for Advertising9h◆Strangers to Themselves: What Language Models Say About Themselves Is Generic9h◆Omni Interaction Agent Technical Report9h◆CoGReV: A Confidence-Gated Post-Hoc Non-Monotonic Belief Revision Framework for Phishing Website Classification9h◆Bit-Flip Attacks on Vision-Language-Action Models: Action-Decoding Architecture Shapes the Vulnerability9h◆Can Foundation Models Moderate Online Content? Evaluating Instruction- vs. Example-Driven Policy Operationalization9h◆RiLM: Parameter-Efficient Language Modeling via Geodesic Decoding9h◆Tracing Computation Density in LLMs9h◆Cultural Binding Heads in Language Models9h◆Direct Diversity Optimization for Diverse Successful Trajectories in Preference Post-Training9h◆Left-Branching Transformers Excel at Right-Branching Languages: Data Shapes Word Order Preferences in Language Models9h◆Palmyra x6 Technical Report: An Agentic, Tool-Use Model Post-Trained via Anchored Supervised Fine-Tuning9h◆'Ghaib in Translation' aka Unseen Harm: Measuring Cross-Script Safety Inconsistency with 'Missed-in-Urdu' Scores in LLM Hate Speech Detection9h◆DexterSQL: Deep Schema Exploration and Rule-based Correction for Text-to-SQL Generation9h◆Bringing Value Models Back: Generative Critics for Value Modeling in LLM Reinforcement Learning9h◆Subagents vs Agent Skills: Executing Reusable Knowledge for Long-Horizon Agentic Tasks9h◆Distribution-Consistent Inference for Dynamic Sparse Mixture-of-Experts9h◆In RAG We Trust? Measuring Robustness of Retrieval-Augmented Generation Under Document Poisoning9h◆FrontierChallenge: Evaluating Scientific Workflow Completion9h◆IBIB: A Protocol for Measuring Enterprise AI Systems by Serving Route, Not Model Identifier9h◆AgenticGen: Reward-Guided Agentic Video Generation for Advertising9h◆Strangers to Themselves: What Language Models Say About Themselves Is Generic9h◆Omni Interaction Agent Technical Report9h◆CoGReV: A Confidence-Gated Post-Hoc Non-Monotonic Belief Revision Framework for Phishing Website Classification9h◆Bit-Flip Attacks on Vision-Language-Action Models: Action-Decoding Architecture Shapes the Vulnerability9h◆Can Foundation Models Moderate Online Content? Evaluating Instruction- vs. Example-Driven Policy Operationalization9h◆RiLM: Parameter-Efficient Language Modeling via Geodesic Decoding9h◆Tracing Computation Density in LLMs9h◆Cultural Binding Heads in Language Models9h◆Direct Diversity Optimization for Diverse Successful Trajectories in Preference Post-Training9h◆Left-Branching Transformers Excel at Right-Branching Languages: Data Shapes Word Order Preferences in Language Models9h◆Palmyra x6 Technical Report: An Agentic, Tool-Use Model Post-Trained via Anchored Supervised Fine-Tuning9h◆'Ghaib in Translation' aka Unseen Harm: Measuring Cross-Script Safety Inconsistency with 'Missed-in-Urdu' Scores in LLM Hate Speech Detection9h◆DexterSQL: Deep Schema Exploration and Rule-based Correction for Text-to-SQL Generation9h◆
Tag

#algorithms

8 articles tagged #algorithms

arxivJul 22

Mixing-Free and Signal-Optimal Learning of Gaussian Graphical Models from Glauber Dynamics

arXiv:2607.18559v1 Announce Type: cross Abstract: Gaussian graphical model selection is usually studied under independent sampling, but in many applications the data arise as a single trajectory of a dependent stochastic process. We study exact recovery of the graph from one trajectory of random-sca

#machine-learning#graphical-models#stochastic-processRead on arxiv →
arxivJul 2bullish

Neural Certificate Pricing for Combinatorial Optimization Problems

arXiv:2607.01185v1 Announce Type: new Abstract: Combinatorial optimization (CO) problems are difficult because certifiable discrete structure induces exponential search. One needs to search over the set exponentially many candidates to certify optimality, however, the structural feasibility of a pat

NE1 model#optimization#machine-learning#researchRead on arxiv →
arxivJun 30

Learning the structure of open quantum systems

arXiv:2606.30358v1 Announce Type: cross Abstract: We design an algorithm for learning the coefficients of an $n$-qubit constant-local Lindbladian to $\varepsilon$ error with $O(g d^2 \log(n) / \varepsilon^2)$ total evolution time, where $g$ is the single-site energy and $d$ is the (approximate) degr

#quantum-physics#machine-learning#algorithmsRead on arxiv →
arxivMay 16

Adapting Dijkstra for Buffers and Unlimited Transfers

arXiv:2603.11729v3 Announce Type: replace-cross Abstract: In recent years, RAPTOR based algorithms have been considered the state-of-the-art for path-finding with unlimited transfers without preprocessing. However, this status largely stems from the evolution of routing research, where Dijkstra-base

#routing#algorithms#optimizationRead on arxiv →
arxivMay 12

Mistake-Bounded Language Generation

arXiv:2605.10809v1 Announce Type: new Abstract: We investigate the learning task of language generation in the limit, but shift focus from the traditional time-of-last-mistake metric of a generator's success to a new notion of "mistake-bounded generation." While existing results for language generat

#language-generation#machine-learning#algorithmsRead on arxiv →
arxivMay 11bullish

Simple KNN-Based Outlier Detection Achieves Robust Clustering

arXiv:2605.07130v1 Announce Type: new Abstract: Being robust to the presence of outliers is crucial for applying clustering algorithms in practice. In the $\textit{robust $k$-Means}$ problem (i.e., $k$-Means with outliers), the goal is to remove $z$ outliers and minimize the $k$-Means cost on the re

#clustering#outlier-detection#machine-learningRead on arxiv →
arxivApr 18

Tight Bounds for Learning Polyhedra with a Margin

arXiv:2604.14614v1 Announce Type: cross Abstract: We give an algorithm for PAC learning intersections of $k$ halfspaces with a $\rho$ margin to within error $\varepsilon$ that runs in time $\textsf{poly}(k, \varepsilon^{-1}, \rho^{-1}) \cdot \exp \left(O(\sqrt{n \log(1/\rho) \log k})\right)$. Notabl

#machine-learning#algorithms#data-structuresRead on arxiv →
arxivApr 2bullish

Learning to Shuffle: Block Reshuffling and Reversal Schemes for Stochastic Optimization

arXiv:2604.00260v1 Announce Type: new Abstract: Shuffling strategies for stochastic gradient descent (SGD), including incremental gradient, shuffle-once, and random reshuffling, are supported by rigorous convergence analyses for arbitrary within-epoch permutations. In particular, random reshuffling

LA1 model#optimization#machine-learning#researchRead on arxiv →
HomeModelsNews