unlock unlimited code runs for $79, limited time →
NOSSLETTER.techLIVE
back to archive

[ PAPERS // 2026-10-14 ]

22 highest-signal arXiv papers from that day's run, ranked within each topic.

ai ml

  • today's pick · read the abstractTev: Scaling Long-Horizon Agentic Environments with Dense Progress Rewards
    Wenbo Hu, Shraman Pramanick, Krishna Kumar Singh, Nanyun Peng, Kai-Wei Chang, Yong Jae Lee

    This paper introduces a new large dataset and training method that provide dense progress rewards for long-horizon tasks, enabling more efficient training of autonomous agents that can solve complex, multi-step problems and generalize across domains.

    Long-horizon reinforcement learningReward shapingAgent training datasetsAutonomous agent evaluation
    9/10
  • How Safe Is ChatGPT Health Advice? Evidence from Real User Conversations in Four Global South Countries
    Shreyasi Roy Chowdhury, Kiran Garimella

    This study analyzes real user conversations with ChatGPT about health in four Global South countries, revealing that about 20% of responses pose significant safety risks, especially when user-specific context is considered, highlighting potential dangers in relying on AI for medical advice.

    Large Language ModelsHealth AI SafetyUser Context AwarenessRisk Assessment
    9/10
  • Hybrid Reasoning Agents
    Jiaru Zou, Yunzhe Qi, Sirui Chen, Federico Bianchi, Shang Zhu, Pan Lu, Jingrui He, James Zou

    This paper introduces Hybrid Reasoning Agents that combine internal latent reasoning with external text-based interaction, improving efficiency, transparency, and tool integration in AI agents.

    Large Language ModelsLatent reasoningAgent architecturesReinforcement learning
    9/10

algorithms theory

  • $T$-efficient unitary synthesis via block-sparse Hamiltonian simulation
    Diyi Liu, Shuchen Zhu, Wibe Albert de Jong, Di Fang, David Williams-Young, Chao Yang

    This paper presents a new method to synthesize quantum circuits with fewer costly $T$ gates, improving efficiency for implementing arbitrary quantum operations and proving near-optimality of their approach.

    Quantum circuit synthesisClifford+$T$ gate setBlock-sparse Hamiltonian simulationQuantum algorithm complexity
    8/10
  • Sublinear-Time and Semi-Streaming Algorithms for Path Cover and TSP
    Sharareh Alipour, Ali Nowzari

    This paper presents faster and more space-efficient algorithms for approximating solutions to path cover and traveling salesman problems with specific edge weights, improving previous approximation ratios and running times in both sublinear-time and semi-streaming models.

    Approximation algorithmsSublinear-time algorithmsSemi-streaming algorithmsTraveling Salesman Problem (TSP)
    8/10
  • A Practical Combinatorial Interior Point Method for Minimum-Cost Flow
    Emil Schätzle, Simon Meierhans, Rasmus Kyng, Maximilian Probst Gutenberg

    This paper presents a practical implementation of a recent theoretically fast algorithm for minimum-cost flow problems, showing competitive and sometimes superior performance compared to established solvers on benchmark datasets.

    Minimum-cost flowInterior Point MethodsAlgorithm engineeringGraph algorithms
    8/10

database

  • ARACDE: Retrofitting Databases with ABAC using External Authorization Engines
    Karthikeya S M Yelisetty, Shamik Sural, Santosh Nagarakatte

    This paper presents ARCADE, a method to add advanced attribute-based access control to popular databases by externalizing authorization logic, improving flexibility and auditability with minimal performance impact.

    Attribute-Based Access Control (ABAC)Database AuthorizationPolicy EnginesDatabase Security
    8/10

distributed systems

  • HULK: An Efficient Algorithm for Enabling Fast Bulk Bitwise Operations on Homomorphically Encrypted Data
    Mayank Kabra, Phillip Widdowson, Harshita Gupta, Rakesh Nadig, Nisa Bostancı, Eirini Tzermpou, Rakesh Kumar, Spiros Galanopoulos, Ataberk Olgun, Abdullah Giray Yağlıkçı, Mohammad Sadrosadati, Onur Mutlu

    This paper introduces HULK, a new algorithm that significantly speeds up bulk bitwise operations on encrypted data, enabling faster and more practical privacy-preserving computations in cloud applications.

    Homomorphic encryptionBitwise operationsSecure computationPerformance optimization
    9/10
  • FastEEP: Fast Intra-Instance Elastic Scaling for Expert-Parallel MoE Serving
    Yunfei Feng, Jingkai He, Shiqi Liu, Cheng Zhang, Dong Du, Erhu Feng

    This paper introduces FastEEP, a system that enables much faster and more efficient scaling of Mixture-of-Experts model serving by reusing runtime resources within instances instead of rebuilding them from scratch.

    Mixture-of-Experts (MoE) modelsElastic scalingGPU memory managementDistributed inference serving
    8/10
  • LunaTP: Enabling Efficient and Scalable Tensor Product for Equivariant MLIPs
    Yuanchang Zhou, Mingzhen Li, Chen Wang, Xiangyu Zhang, Guangming Tan, Weile Jia

    This paper introduces LunaTP, a new method that significantly speeds up key tensor operations in equivariant machine learning models for atomistic simulations, enabling much faster training and scalability on GPUs.

    Equivariant machine learning interatomic potentialsClebsch–Gordan tensor productGPU parallelizationHigh-performance computing for scientific ML
    8/10

math

  • Orientation Estimation of Cryo-EM Images for Molecules with Arbitrary Symmetry by Semidefinite Programming
    Yunpeng Shi, Amit Singer, Jinxin Wang, Ruiyi Yang

    The paper presents a new unified mathematical method using semidefinite programming to estimate orientations of cryo-EM images for molecules with any symmetry, improving initial 3D model reconstruction from limited data.

    Cryo-electron microscopy (cryo-EM)Semidefinite programmingOrientation estimationSymmetry groups in molecular structures
    7/10
  • Superdiffusive Invariance Principle for the two-dimensional Asymmetric Simple Exclusion Process
    Quentin Moulard

    This paper rigorously proves how particle density fluctuations in a two-dimensional asymmetric exclusion process spread faster than normal diffusion and converge to a specific stochastic heat equation, confirming long-standing physics predictions with exact scaling and noise behavior.

    Asymmetric Simple Exclusion Process (ASEP)SuperdiffusionStochastic Heat EquationScaling Limits in Interacting Particle Systems
    7/10
  • Rapid Mixing of Stereographic MCMC for Heavy-Tailed Sampling
    Federica Milinanni, Tyler Farghly, Jun Yang

    This paper proves that certain advanced MCMC methods can efficiently sample from complex heavy-tailed distributions in high dimensions, providing theoretical guarantees on their speed and introducing new geometric tools to understand these distributions.

    Markov chain Monte Carlo (MCMC)Heavy-tailed distributionsMixing time analysisIsoperimetric inequalities
    7/10

networking

  • Pedestrian Trajectory Prediction through LoRA Federated Training
    Simone Travagliati, Maria Luisa Merani

    This paper presents a method for predicting pedestrian movements by training models directly on vehicles using federated learning with Low-Rank Adaptation, reducing communication costs while maintaining high accuracy.

    Federated learningLow-Rank Adaptation (LoRA)Pedestrian trajectory predictionEdge computing in vehicular networks
    8/10
  • HILO: Enabling Low-power, Dual-Band Communication using Tunnel Diode Oscillators
    Dhairya Shah, Rajashekar Reddy Chinthalapani, Pramuka Sooriya Patabandige, Ambuj Varshney

    This paper presents HILO, a novel low-power radio frontend that uses tunnel diode oscillators to enable simultaneous dual-band wireless communication from a single circuit, improving reliability without increasing power consumption significantly.

    Tunnel diode oscillatorsDual-band wireless communicationInjection lockingLow-power RF frontends
    8/10
  • Tanchun: Robust Flow-Based HTTP(S) DDoS Detection via Behavioral Attribute Guidance
    Qingyang Li, Yunpeng Tan, Mingxin Yang, Yannan Hu, Lei Zhang, Yong Cui, Zongming Guo, Xinggong Zhang

    This paper introduces Tanchun, a new system that detects large-scale HTTP(S) DDoS attacks using only flow-level data without decryption, by analyzing behavioral patterns over time to maintain accuracy even as traffic changes.

    DDoS detectionFlow-based network monitoringBehavioral pattern analysisRepresentation learning
    8/10

security

systems architecture

  • ZTA-Q: an Open-source RISC-V Platform for Accurate Quantized CNN Inference
    Yike Li, Ajay Kumar M, Vishnu PS, Dimitrios S. Nikolopoulos, Bo Ji, Hans Vandierendonck, Deepu John

    This paper introduces ZTA-Q, an open-source RISC-V platform that accurately runs low-precision (INT8) CNN models from TensorFlow Lite on FPGA hardware, enabling detailed study of hardware approximations on model accuracy.

    Quantized neural networksRISC-V architectureFPGA implementationTensorFlow Lite INT8 inference
    8/10
  • Dynamic Slack-Aware Clocking for Near-Threshold Tensor Processing Units (TPUs)
    Muhammad Usman Nadeem, Sanghamitra Roy, Koushik Chakraborty

    This paper presents a method to dynamically adjust the timing of individual operations in Tensor Processing Units running at low voltage, improving energy efficiency and performance without sacrificing accuracy.

    Near-threshold computingTensor Processing Units (TPUs)Dynamic clockingTiming margin prediction
    8/10
  • CONFERM: Recurrence-Aware Temporal Mapping for Multi-Cycle Multi-Context CGRAs
    Jun Yin, Jannes Willemen, Stef Cuyckens, Chao Fang, Marian Verhelst

    This paper introduces CONFERM, a new scheduling method for coarse-grained reconfigurable arrays that better overlaps loop iterations and pipeline stages to significantly boost throughput and reduce configuration overhead.

    Coarse-Grained Reconfigurable Arrays (CGRAs)Loop-Carried RecurrencesTemporal SchedulingModulo Scheduling
    8/10