Skip to content
TILens What matters today in tech v0.3.2
Theme

Topic - Edition

AI Research

433 items on 12 Oct 2026
AI Research AI Python

We Specified an AI Agent in 2016. We Called It Analytics.

Re-reading my own IBM patent on real-time concert feedback as what it actually was: an agentic loop with multimodal perception, memory-grounded inference, and a human in the loop. What it got right, and what a decade of…

Source: Towards Data Science Mario Noioso
AI Research AI

Discovering Phase Space Structure in Learned Hamiltonian Systems

arXiv:2509.23003v3 Announce Type: replace Abstract: Mechanics-inspired neural dynamical models improve interpretability and physical consistency, but they usually assume a known configuration space, fixed physical…

Source: arXiv cs.LG Yulong Yang, Jiayin Liu, Vineet Bansal, Christine Allen-Blanchette
AI Research AI

Particle-based Generalised Stochastic Optimisation

arXiv:2608.02844v2 Announce Type: replace-cross Abstract: We develop a class of general diffusion-based stochastic particle optimisation methods for loss functions with intractable gradients. Specifically, we consider…

Source: arXiv cs.LG Jiechen Jackie Zhang, O. Deniz Akyildiz
AI Research AI

X-AVDD: Cross-Attentive Audio-Visual Dataset Distillation

arXiv:2610.13687v1 Announce Type: cross Abstract: Audio-visual dataset distillation aims to synthesize a small dataset from a large paired audio-visual dataset, while nearly preserving the training utility for neural…

Source: arXiv cs.LG Saumyaranjan Mohanty, Aravind Reddy, Konda Reddy Mopuri
AI Research AI

HART: Hybrid Attention-RWKV Time series Foundation Model

arXiv:2610.12883v1 Announce Type: new Abstract: Non-autoregressive multi-step forecasting (NAF) enables time series foundation models to predict an entire future horizon in a single forward pass. Despite its strong…

Source: arXiv cs.LG Qingwen Lin, Boyan Xu, Shifeng Xie, Zhifeng Hao, Keli Zhang, Ruichu Cai
AI Research AI

Bandits with Anytime Knapsacks

arXiv:2501.18560v2 Announce Type: replace Abstract: We consider bandits with anytime knapsacks (BwAK), a novel version of the BwK problem where there is an \textit{anytime} cost constraint instead of a total cost…

Source: arXiv cs.LG Eray Can Elumar, Cem Tekin, Osman Yagan
AI Research AI

Simultaneous Competitive and Regret Guarantees for TCP Acknowledgment

arXiv:2610.13571v1 Announce Type: new Abstract: We study simultaneous competitive and regret guarantees for TCP acknowledgment. Each acknowledgment serves all pending packets, and the objective is to minimize the total…

Source: arXiv cs.LG Tsubasa Harada, Yasushi Kawase, Hanna Sumita
AI Research AI

PACT: Privileged Trace Co-Training for Multi-Turn Tool-Use Agents

arXiv:2606.16215v2 Announce Type: replace-cross Abstract: Multi-turn tool-use agents must reason, call tools, and adapt to observations across several interaction turns. Post-training such agents is challenging, as…

Source: arXiv cs.LG Zhenbang Du, Jun Luo, Zhiwei Zheng, Xiangchi Yuan, Kejing Xia, Dachuan Shi, Qirui Jin, Qijia He, Shaofeng Zou, Yingbin Liang, Wenke Lee

433 items available