Semantic query engines ask a large language model (LLM) to judge individual rows, and benchmarks compare these engines on the quality of a few executions at temperature 0. We measure how much another execution changes. We re-execute the text and tabular workloads of SemBench, LRO-Bench, and UDA-Bench through their own...
Production recommender systems have feature-lifecycle asymmetry: adding new features must produce gains on some metric, while feature removal must not regress any metric. In practice, feature deprecation is hard to prioritize as a feature can fail to be removed if it interacts with other features, its importance change...
Vishnu Arun, Adam Obeng, Tianyou Wang et al.· 0 citations
Discrete graph diffusion models (GDMs) corrupt the graph structure by adding noise independently to nodes and edges under a Markovian noise model. In the unconditional setting without node features, an equivariant denoiser trained on a single graph is able to generate novel graphs and sample-level metrics such as edge...
State-space models (SSMs) maintain a fixed-size recurrent state, but reading and writing it at every decoding step can bottleneck hybrid models. This eager state management causes large state I/O with low arithmetic intensity, leaves speculative decoding no cheap rollback, and feeds state quantization error into subseq...
Ze-Wei Liou, Harris Nover, Amey Naik et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Low-bit inference on accelerators with native 4-bit support requires quantizing both weights and activations to realize the full throughput gains these formats provide. While post-training weight quantization has been extensively studied, activation quantization remains considerably more challenging and typically requi...
Discrete graph diffusion models corrupt graph structure through independent edge updates with a Markovian noise model. Combined with the exchangeability requirement on the output distribution, the terminal prior is necessarily an Erd\H{o}s--R\'enyi (E-R) random graph. This has a fundamental consequence for unconditiona...
Adarsh Jamadandi, Nicolas Keriven, Aline Roumy· 0 citations
Training long-horizon language model agents requires assigning credit to intermediate decisions from sparse terminal feedback. Within a finite group of sibling rollouts, useful action comparisons depend on their context, evidence for both alternatives, and how that evidence enters learning. We propose Matched-Context G...
Chen-Xu Zhang, Yao-Rui Shi, Wen-Long Zhang et al.· 0 citations
Cooperative multi-agent tasks often impose constraints on a shared objective or collective safety. A team level violation cost function can measure this constraint outcome, but does not distinguish which agents'actions most strongly influence that violation. We present SafeDiSTL, a constrained multi-agent reinforcement...
Efficient attention mechanisms, such as linear and sliding window attention, aim to reduce the computational complexity of Transformers from quadratic to linear. However, their degraded in-context recall often necessitates interleaving full attention layers, leaving the quadratic bottleneck unresolved in long-context p...
Yuhong Chou, Zehao Liu, Yuqi Pan et al.· 0 citations
Scaling generalist robotic policies is limited by the high cost of collecting embodied interaction data. Large-scale egocentric human videos offer a rich alternative, but they lack robot action labels, and existing action annotation methods are often noisy under real-world visual complexity and diverse manipulation dyn...
Zhi-Yuan Xiang, Pei-Dong Liu, Ming-Yang Li et al.· 0 citations
Counterfactual inference asks how an observed outcome might have differed under different circumstances, such as whether a patient would have recovered had they received a different treatment. Such questions arise whenever decisions depend on the outcomes of alternatives that were not observed. Answering counterfactual...
This paper shows that standard (post-hoc) calibrators can be trained end-to-end with the backbone via a bilevel Stackelberg formulation, and shows that using the final classification layer itself as the calibrator yields accurate, well-calibrated models with no additional parameters.
Nektarios G. Kalampalikis, Pablo M. Olmos, Isabel Valera· 0 citations