1 May 2026
We develop a unified Lyapunov-integral quadratic constraint (IQC) framework for establishing uniform stability of first-order accelerated optimization algorithms in the $β$-smooth and $γ$-strongly convex regime.
Trending research and the full catalog - each paper linked to the benchmarks, methods, and models it introduces.
Filtering here covers the 2,000 most recent papers, as much as one page can hold in memory. See the full index of 22,427 papers.
1 May 2026
We develop a unified Lyapunov-integral quadratic constraint (IQC) framework for establishing uniform stability of first-order accelerated optimization algorithms in the $β$-smooth and $γ$-strongly convex regime.
1 May 2026
Inverse-multiquadric (IMQ) kernel sections decay at infinity. Can polynomial alignment add persistent directional responses while preserving universal approximation? The \yat{} (Yat) kernel answers this question by multiplying IMQ distance by a biased squared inner product.
1 May 2026
Federated differentially private protocols can communicate over many adaptive rounds and reuse each client's local samples. Existing lower bound arguments for federated DP are often restricted to noninteractive protocols or fresh batch decompositions, so the fundamental…
1 May 2026
Dynamic link prediction is important for modeling evolving interactions in social, communication, financial, and transportation networks. Classical temporal graph models capture changes over time, but they may struggle to represent rapidly evolving node-edge interactions in…
1 May 2026
Long-horizon, sparse-reward tasks pose a fundamental challenge for reinforcement learning, since single-step TD learning suffers from bootstrapping error accumulation across successive Bellman updates.
1 May 2026
Quantization is an effective strategy to reduce the storage and computation footprint of large language models (LLMs). Post-training quantization (PTQ) is a leading approach for compressing LLMs.
1 May 2026
Automatic heuristic design (AHD) has emerged as a promising paradigm for solving NP-hard combinatorial optimization problems (COPs). Recent works show that large language models (LLMs), when integrated into well-designed frameworks (i.e., LLM-AHD), can autonomously discover…
23 Apr 2026
This paper aims to synthesize current knowledge on generative AI in IT project management using the PRISMA methodology to provide researchers with a comprehensive perspective on techniques, applications, adoption trends, limitations, and integration across project management…
Jian Yang, Ruibin Yuan, Yizhi Li · 21 Apr 2026
TACO is a self-evolving compression framework that automatically discovers and refines compression rules from interaction trajectories to improve long-horizon agent performance while reducing token overhead.
18 Apr 2026
The present study aims to investigate a cluster cleaning algorithm that is both computationally simple and capable of solving the PU classification when the SCAR condition is unsatisfied.
Mingqiao Ye, Afshin Dehghan, Roman Bachmann · 16 Apr 2026
Tokenization is a key component of autoregressive (AR) generative models, converting raw data into more manageable units for modeling.
Stefan Schulz, Fernando Edelstein, Hannah Dröge · 13 Apr 2026
Real-time free-viewpoint rendering requires balancing multi-camera redundancy with the latency constraints of interactive applications.
Eslam Reda, Sara El-Metwally · 13 Apr 2026
Large Language Models have demonstrated remarkable capabilities in generating contextually relevant and grammatically correct text.
Xiaodong Yang, Meng'en Qin, Yu Song · 11 Apr 2026
A3-FPN enhances multi-scale feature representation through asymptotically disentangled framework and content-aware attention modules, improving small object recognition and dense prediction tasks.
10 Apr 2026
Topic modeling is a branch of Natural Language Processing (NLP) that aims to organize large collections of texts into coherent groups according to word co-occurrence patterns, with Latent Dirichlet Allocation (LDA) remaining one of the most widely used and interpretable…
7 Apr 2026
Constructing artificial lexicons that are pronounceable, typologically plausible, and semantically structured remains an open challenge in computational linguistics. Existing conlang generators either lack formal phonotactic guarantees or delegate generation to opaque,…
Qihang Yu, Ju He, Liang-Chieh Chen · 6 Apr 2026
Anticipating diverse future states is a central challenge in video world modeling.
Ziwei Liu, Jingkang Yang, Shulin Tian · 2 Apr 2026
Recent streaming video understanding methods increasingly rely on complex memory mechanisms to handle long video streams.
1 Apr 2026
Supervised fine-tuning (SFT) is a common first stage of LLM post-training, teaching the model to follow instructions and shaping its behavior as a helpful assistant. At the same time, SFT may harm the fundamental capabilities of an LLM, particularly after long pretraining: a…
1 Apr 2026
Prompt optimization improves language models without updating their weights by searching for a better system prompt, but its effectiveness varies widely across tasks. We study what makes a task amenable to prompt optimization.
1 Apr 2026
Diffusion Large Language Models (dLLMs) have emerged as a promising alternative to autoregressive generation by enabling parallel token prediction. However, practical dLLM decoding still suffers from high inference latency, which limits deployment.
1 Apr 2026
We study a QA curation pipeline for improving long-context complex reasoning in large language models (LLMs). Our approach, $π^2$, constructs high-quality reasoning data through rigorous QA curation: 1) extracting and expanding tables from Wikipedia, 2) from the collected tables…
1 Apr 2026
RAG-based question-answering (QA) in specialist domains faces a cold-start problem: lack of evaluative benchmarks and absence of labeled data for post-training. We present DoRA (Domain-oriented RAG Assessment), a novel benchmark construction and evaluation framework using only a…
1 Apr 2026
End-to-end OCR for historical newspapers remains challenging, as models must handle long text sequences, degraded print quality, and complex layouts. While Transformer-based recognizers dominate current research, their quadratic complexity limits efficient paragraph-level…