← heapsort-ai

machine learning

790 items

RESEARCHarXiv CS.LG·5/4/2026

Learning physically grounded traffic accident reconstruction from public accident reports

This paper presents a method for traffic accident reconstruction from public reports and scene measurements, formulating it as a parameterized multimodal learning problem. Researchers created the CISS-REC dataset with 6,217 real-world cases and developed a framework that outperforms baselines in reconstruction fidelity, including accident point accuracy.

27
RESEARCHarXiv CS.LG·5/4/2026

Information-Theoretic Generalization Bounds for Stochastic Gradient Descent with Predictable Virtual Noise

This paper introduces predictable history-adaptive virtual perturbations to enhance information-theoretic generalization bounds for Stochastic Gradient Descent. This new approach allows perturbation covariances to dynamically depend on past SGD history, addressing limitations of existing methods that require fixed covariances.

27
RESEARCHarXiv CS.LG·18d ago

Temporal Contrastive Transformer for Financial Crime Detection: Self-Supervised Sequence Embeddings via Predictive Contrastive Coding

The Temporal Contrastive Transformer (TCT) is a new representation learning framework designed for financial transaction sequences to detect fraud. It uses self-supervised contrastive learning to generate embeddings that capture temporal behavioral patterns, showing meaningful predictive performance, especially when combined with domain-engineered features.

27
RESEARCHarXiv CS.LG·18d ago

Double descent for least-squares interpolation on contaminated data: A simulation study

This research investigates the "double descent" phenomenon in overparametrized models, which allows for improved generalization despite classical overfitting concerns. The study specifically explores this effect in linear regression with contaminated training data, finding that significant overparametrization enables double descent even in such robust settings.

27
RESEARCHarXiv CS.LG·18d ago

Harnesses for Inference-Time Alignment over Execution Trajectories

This research investigates harness engineering as an inference-time technique for large language model (LLM) agents, focusing on improving long-term performance via task decomposition and guided execution. It quantifies how design elements like workflow granularity and guidance impact performance, revealing common failure modes such as over-decomposition and hallucinated execution.

27
RESEARCHarXiv CS.CL·5/7/2026

FMI_SU_Yotkova_Kastreva at SemEval-2026 Task 13: Lightweight Detection of LLM-Generated Code via Stylometric Signals

This paper details participation in SemEval-2026 Task 13, focusing on lightweight detection of LLM-generated code using stylometric signals. The approach employs ratio-based features, parsing engines, and language classifiers, proving computationally efficient with near-instant inference time.

27
RESEARCHarXiv CS.CL·5/7/2026

Adapt to Thrive! Adaptive Power-Mean Policy Optimization for Improved LLM Reasoning

This research introduces Adaptive Power-Mean Policy Optimization (APMPO) to improve Large Language Model (LLM) reasoning capabilities within Reinforcement Learning with Verifiable Rewards (RLVR). APMPO combines a generalized power-mean objective and feedback-adaptive clipping to enhance learning dynamics and performance, addressing limitations of static optimization schemes.

27
RESEARCHarXiv CS.LG·29d ago

Feature Repulsion and Spectral Lock-in: An Empirical Study of Two-Layer Network Grokking

This empirical study investigates Tian's (2025) feature repulsion theorem in two-layer network grokking, testing its mechanisms and spectral signatures. It observes a clear structure-mechanism dissociation, with the predicted sign rule robustly holding for similar feature pairs despite a strong activation dependence in the spectral signature.

27
RESEARCHarXiv CS.CL·26d ago

Distribution Corrected Offline Data Distillation for Large Language Models

This research proposes an offline reasoning distillation framework for Large Language Models (LLMs) to enhance intelligence in resource-constrained environments. It tackles the distributional drift issue in existing offline methods by correcting teacher-student discrepancies while preserving data efficiency and supervision quality.

27
RESEARCHarXiv CS.LG·8d ago

Generative AI and Digital Ecosystem Resilience: A Proactive Lifecycle-Based Survey

This survey addresses the proliferation of adversarial synthetic content, accelerated by Generative AI, which renders traditional reactive detection methods ineffective. It proposes a paradigm shift towards proactive detection of emerging inauthentic narratives, adopting a unified, lifecycle-based taxonomy integrating socio-technical models and advanced computational methodologies.

27
RESEARCHarXiv CS.LG·8d ago

Hoeffding Concept Bottleneck Models with Applications to Overhead Images

Hoeffding Concept Bottleneck Models (HCBM) are introduced to offer non-linear and sparse aggregations of concept scores, enhancing the explainability and accuracy of deep learning predictions. This method leverages Hoeffding functional decomposition of gradient-boosted trees to overcome the limitations of existing linear CBMs, which suffer from a large number of concepts and potential information leakage.

27
RESEARCHarXiv CS.LG·29d ago

TTCD:Transformer Integrated Temporal Causal Discovery from Non-Stationary Time Series Data

The Transformer Integrated Temporal Causal Discovery (TTCD) Framework is a novel end-to-end approach designed to learn contemporaneous and lagged causal relations from complex non-stationary time series data. This method addresses the limitations of existing techniques by integrating temporal and frequency-domain attention, providing a unified solution for challenging real-world scenarios.

27