Post-training is (Massive) Supervised Learning
arXiv:2606.07527v1 Announce Type: cross Abstract: The prevailing paradigm for training LLMs has evolved to rely on a massive post-training phase consisting of SFT and RL. In this position paper, we ar
Knowledge catalogue
arXiv:2606.07527v1 Announce Type: cross Abstract: The prevailing paradigm for training LLMs has evolved to rely on a massive post-training phase consisting of SFT and RL. In this position paper, we ar
arXiv:2606.09788v1 Announce Type: new Abstract: Large-scale document processing requires contextually aware table extraction (TE) that is both accurate and efficient. Yet current approaches require bi
arXiv:2606.09617v1 Announce Type: cross Abstract: The rapid expansion of AI globally has led to the proliferation of energy-intensive hyperscale data centres (DCs), making them as a structurally chall
arXiv:2606.08365v1 Announce Type: cross Abstract: Sparse autoencoder (SAE) features are increasingly used to steer language models, but feature steering is rarely clean: the same intervention can beha
arXiv:2606.08374v1 Announce Type: cross Abstract: We recast predictive coding as continuous-time proximal gradient descent applied to a regularized maximum-a-posteriori (MAP) objective. We study first
arXiv:2602.15327v2 Announce Type: replace-cross Abstract: Machine learning model performance improvements tend to arise from competition and application. For deployment, we consider prescriptive scali
arXiv:2606.09762v1 Announce Type: cross Abstract: Continual training of deep neural networks under non-stationarity often leads to a progressive loss of plasticity, eventually limiting further learnin
arXiv:2606.09189v1 Announce Type: cross Abstract: EEG foundation-model releases are usually audited one endpoint at a time: raw-reconstruction, membership inference, identity linkage, or DP-SGD on the
arXiv:2606.09396v1 Announce Type: cross Abstract: Supervised fine-tuning (SFT) is an efficient approach for downstream task adaptation and often serves as the initialization stage for reinforcement le
arXiv:2606.07532v1 Announce Type: cross Abstract: RLHF-trained models are systematically biased toward agreement over accuracy, a structural property of the training process. We present Principled Age
arXiv:2606.07555v1 Announce Type: cross Abstract: Glossaries, technical specifications, and system prompts routinely ask language models to use familiar words in unfamiliar ways. When this works, the
arXiv:2606.07974v1 Announce Type: cross Abstract: A learned world model provides a powerful physical intuition for evaluating future states. But its effectiveness in continuous control also depends cr
arXiv:2606.09563v1 Announce Type: new Abstract: As LLMs are deployed as agents, reliable monitoring requires knowing not only what they output, but which instructions are steering their behavior. This
arXiv:2606.09301v1 Announce Type: new Abstract: Multimodal federated graph learning (MM-FGL) aims to collaboratively learn from decentralized graphs with text and images. However, real-world clients m
arXiv:2606.09507v1 Announce Type: new Abstract: Video world models have made rapid progress in generating controllable visual experiences, but most of them still simulate the world from a single obser
arXiv:2606.08926v1 Announce Type: new Abstract: Knowledge graph completion (KGC) models are commonly evaluated using rank-based metrics such as MRR and Hits@K, despite different users often requiring
arXiv:2606.09740v1 Announce Type: new Abstract: Vision-Language-Action (VLA) models demonstrate strong perfor-1 mance on language-conditioned robotic manipulation within their training dis-2 tribution
arXiv:2512.12320v2 Announce Type: replace Abstract: Conventional soft pneumatic actuators, typically based on hollow elastomeric chambers, often suffer from small structural support and require costly
arXiv:2606.08370v1 Announce Type: cross Abstract: Standard dynamic vision sensors approximate retinal processing by detecting temporal contrast changes, offering high speed and high dynamic range. In
arXiv:2606.08500v1 Announce Type: cross Abstract: Software engineering agents (SWE agents) increasingly work through tool-mediated trajectories in real repositories, yet their behavior remains difficu
arXiv:2510.04127v2 Announce Type: replace-cross Abstract: Approximate nearest neighbour (ANN) search underpins large-scale retrieval, increasingly within the retrieval-augmented generation pipelines t
arXiv:2606.08186v1 Announce Type: new Abstract: Monopedal hopping robots are conceptually simple but highly dynamic and inherently unstable. Achieving robust 3D hopping is still difficult because grou
arXiv:2606.08150v1 Announce Type: new Abstract: Designing 3D metamaterial microstructures that meet the intended functions remains a major challenge, as it typically requires domain expertise, iterati
arXiv:2606.09245v1 Announce Type: cross Abstract: Few-shot object detection has gained widely attention in recent years. Some excellent algorithms have been proposed to handle this task. However, most
arXiv:2606.08410v1 Announce Type: cross Abstract: Personalized decision-making in multi-objective bandits requires learning user-specific trade-offs among competing objectives. Since arm utility depen
arXiv:2606.09711v1 Announce Type: new Abstract: Reward hacking is usually studied after it becomes visible, once a model earns high proxy reward while failing the intended task. We instead study what
arXiv:2606.08708v1 Announce Type: new Abstract: Reinforcement Learning with Verifiable Rewards (RLVR) has become an effective paradigm for improving the reasoning capability of Large Vision-Language M
arXiv:2606.08922v1 Announce Type: new Abstract: Humanoid robots can fall on slopes, gravel, and uneven ground in unstructured environments. We target integrated fall recovery and locomotion: rebuildin
arXiv:2606.09816v1 Announce Type: cross Abstract: Standard diffusion models typically use a single time-homogeneous Gaussian terminal distribution as the reference law for generation. While this choic
arXiv:2606.08212v1 Announce Type: new Abstract: Solving machine learning problems is complex and typically reserved for experts. Over the past two decades, systems have emerged to support non-experts.
arXiv:2606.08804v1 Announce Type: new Abstract: Linear attention reformulates sequence modeling as recurrent state evolution, enabling efficient linear-time inference. Under the key-value associative
arXiv:2606.08015v1 Announce Type: new Abstract: We propose Q-Guided Value-Gradient Matching (Q-VGM), an off-policy reinforcement learning (RL) method that tackles a long-standing challenge in fine-tun
arXiv:2606.07657v1 Announce Type: cross Abstract: Traffic sign recognition is crucial for intelligent transportation and autonomous driving, as it can improve driving efficiency and ensure road safety
arXiv:2606.07606v1 Announce Type: new Abstract: Very low birth weight infants (VLBWI) are at high risk of mortality and severe neurodevelopmental impairment, including cerebral palsy, yet reliable dis
arXiv:2606.08276v1 Announce Type: cross Abstract: Quantum reinforcement learning (QRL) is a promising approach to learn effective decision strategies across several applications with stochastic enviro
arXiv:2404.01948v3 Announce Type: replace Abstract: Dynamic visual sensors (DVS) are characterized by a large amount of background activity (BA) noise, which it is mixed with the original (cleaned) se
arXiv:2606.07580v1 Announce Type: cross Abstract: As Low Earth Orbit has grown more crowded with space debris, the need for reliable and efficient debris removal solutions becomes more urgent. An acti
arXiv:2606.08552v1 Announce Type: new Abstract: I discuss some quantitative representations of Promise Theory for processes involving autonomous agents. Agent models are common in software systems, ma
arXiv:2606.07766v1 Announce Type: cross Abstract: We present a quantum--classical hybrid pipeline for polarimetric material classification that casts this as a point-matching problem. Voxel cubes, con
arXiv:2510.03389v2 Announce Type: replace-cross Abstract: Current quantum computers require algorithms that use limited resources economically. In quantum machine learning, success hinges on quantum f
arXiv:2606.08592v1 Announce Type: new Abstract: Efficient quantum error correction is essential for the advancement of quantum computing. We propose a quantum neural network with a global structure th
arXiv:2508.19857v3 Announce Type: replace Abstract: Many successful families of generative models leverage a low-dimensional latent distribution that is mapped to a data distribution. Though simple la
arXiv:2602.18364v2 Announce Type: replace-cross Abstract: Maximum likelihood prediction (MLP) is a core task at the heart of modern large language models. Here, we study a quantum version of this task
arXiv:2606.07617v1 Announce Type: cross Abstract: While sparse autoencoders provide features more interpretable than individual neurons, reliably characterizing them remains challenging. We propose Qu
arXiv:2606.08493v1 Announce Type: cross Abstract: extit{Tissue graph counterfactuals} ask how a cell's expression would change under altered spatial neighbor contexts. Such queries are central to pred
arXiv:2606.08300v1 Announce Type: new Abstract: Many real-world queries over personal data span multiple applications and require structured planning, as individual tools expose only partial informati
arXiv:2605.24890v2 Announce Type: replace Abstract: Vision-Language-Action (VLA) models commonly adapt pretrained Vision-Language Models (VLMs) to robot control by mapping visual observations and lang
arXiv:2606.07843v1 Announce Type: cross Abstract: Schema matching, a critical task for integrating data from diverse sources, seeks to identify correspondences between columns across different schemas
arXiv:2410.00713v4 Announce Type: replace Abstract: Anomaly detection is a core capability for robotic perception and industrial inspection, yet most existing benchmarks are collected under controlled
arXiv:2606.08769v1 Announce Type: cross Abstract: Automatic evaluation is critical for high-stakes text generation, where errors often involve omitted findings, hallucinated content, polarity reversal
arXiv:2606.08790v1 Announce Type: new Abstract: Autonomous agents negotiate, purchase, deploy code, and move funds, but no neutral mechanism determines whether they met their delegated obligation, who
arXiv:2606.09108v1 Announce Type: cross Abstract: Many stages of the robotic lifecycle, from morphology synthesis to operation, rely fundamentally on the reachable workspace. However, current methods
arXiv:2606.08679v1 Announce Type: cross Abstract: Pretrained models are often evaluated on multi-task leaderboards to measure their applicability in diverse contexts. However, current methods for aggr
arXiv:2606.08156v1 Announce Type: cross Abstract: Vision Transformers (ViTs) achieve strong performance but suffer from high computational costs due to quadratic self-attention complexity. Although to
arXiv:2606.07600v1 Announce Type: cross Abstract: We formulate data propagation through the Transformer, the machine learning architecture powering large language models, as a nonlinear control system
arXiv:2606.07935v1 Announce Type: new Abstract: In dyadic interactions, various human facial reactions could be appropriate for responding to each human speaker behaviour. Following the successful org
arXiv:2606.07641v1 Announce Type: new Abstract: Can vision-language models predict what a 180{eg} rotation would reveal from the original image alone? We study this ability through Rotated-Outcome Pre
arXiv:2606.08564v1 Announce Type: new Abstract: Robotic manipulation robustness often founders on the physics gap between simplified simulations and the resistance-laden real world. In this work, we e
arXiv:2606.08725v1 Announce Type: new Abstract: In teleoperation, the human operator typically controls only the end-effector pose, which often leads to self-collisions of the manipulator and collisio
arXiv:2606.09390v1 Announce Type: cross Abstract: Body movement communicates intent at distances and in conditions where neither the face, nor speech can be captured. We study the recognition of commu