← Search

Tianyi Xu

17 accepted papers

2026

Fair Algorithms with Probing for Multi-Agent Multi-Armed Bandits

AAAI 2026technical

We propose a multi-agent multi-armed bandit (MA-MAB) framework to ensure fair outcomes across agents while maximizing overall system performance. For example, in a ridesharing setting where a central dispatcher assigns drivers to distinct geographic regions, utilitarian welfare (the sum of driver ea

Cited by 0SourcePDFScholar
2026

Hearing Without Noticing? Attention-Aware Stealthy Black-box Adversarial Audio Attacks

ICML 2026poster

Automatic Speech Recognition (ASR) systems, such as those in intelligent assistants, are vulnerable to adversarial examples (AEs). Benign audio clips like music, when embedded with small perturbations, can trick ASR models into recognizing attacker-specified commands. Prior studies focus on minimizi…

Cited by 0SourceScholar
2026

Neuromem: A Granular Decomposition of the Streaming Lifecycle in External Memory for LLMs

ICML 2026poster

Most evaluations of External Memory Module assume a static setting: memory is built offline and queried at a fixed state. In practice, memory is streaming: new facts arrive continuously, insertions interleave with retrievals, and the memory state evolves while the model is serving queries. In this r…

Cited by 0SourceScholar
2026

OPUS: Towards Efficient and Principled Data Selection in Large Language Model Pre-training in Every Iteration

ICML 2026oral

As high-quality public text approaches exhaustion, a phenomenon known as the Data Wall—LLM pre-training is shifting from more tokens to better tokens. However, existing methods either rely on heuristic static filters that ignore training dynamics, or use dynamic yet optimizer-agnostic criteria based…

Cited by 0SourceScholar
2026

StepORLM: A Self-Evolving Framework With Generative Process Supervision For Operations Research Language Models

ICLR 2026poster

Large Language Models (LLMs) have shown promising capabilities for solving Operations Research (OR) problems. While reinforcement learning serves as a powerful paradigm for LLM training on OR problems, existing works generally face two key limitations. First, outcome reward suffers from the $\texti…

Cited by 0SourcecodeScholar
2025

AdaptiveAE: An Adaptive Exposure Strategy for HDR Capturing in Dynamic Scenes

ICCV 2025poster

Mainstream high dynamic range imaging techniques typically rely on fusing multiple images captured with different exposure setups (shutter speed and ISO). A good balance between shutter speed and ISO is crucial for achieving high-quality HDR, as high ISO values introduce significant noise, while lon…

Cited by 0SourcePDFScholar
2025

Class Semantic Prompts Enhanced Prototypical Fusion Method for Few-shot Named Entity Recognition

ICASSP 2025accepted

Few-shot named entity recognition is to identify named entities in scenarios where labeled data is scarce. Existing prototype building methods ignore the use of class semantic and it is difficult to obtain accurate prototype representations only by relying on few support samples. In this paper, we p…

Cited by 0SourceScholar
2025

Herald: A Natural Language Annotated Lean 4 Dataset

ICLR 2025poster

Verifiable formal languages like Lean have profoundly impacted mathematical reasoning, particularly through the use of large language models (LLMs) for automated reasoning. A significant challenge in training LLMs for these formal languages is the lack of parallel datasets that align natural languag…

Cited by 2SourcePDFScholar
2025

MTE: Multi Transformation of Entities in Quaternion Vector Space for Temporal Knowledge Graph Completion

ICASSP 2025accepted

Compared with Static Knowledge Graphs, Temporal Knowledge Graphs need to pay more attention to the time when facts occur and these facts will change over time. However, existing models lack the capture of entity and relation and timestamp feature interactions, which is mainly reflected in the tempor…

Cited by 0SourceScholar
2025

Maximum Mutual Information Estimation based Graph Attention Network for Knowledge Graph Completion

ICASSP 2025accepted

Knowledge graphs often face the issue of missing links. Addressing the problem of reasoning about and completing these missing entities or relations has become a key research focus. However, existing graph attention networks rely on connections within the graph for information propagation and aggreg…

Cited by 0SourceScholar
2025

Popularity and Interest Signal Detection for Sequential Recommendation Denoising

ICASSP 2025accepted

Sequential recommender systems aim to learn user preferences through historical interaction sequences. User interactions are driven both by popular trends and personal interests, introducing two types of noise: popular choices triggered by conformist behavior and irrelevant terms that do not reflect…

Cited by 0SourceScholar
2025

TeDS: Joint Learning of Diachronic and Synchronic Perspectives in Quaternion Space for Temporal Knowledge Graph Completion

ICML 2025poster

Existing research on temporal knowledge graph completion treats temporal information as supplementary, without simulating various features of facts from a temporal perspective. This work summarizes features of temporalized facts from both diachronic and synchronic perspectives: (1) Diachronicity. Fa…

Cited by 0SourcePDFScholar
2025

WMRE: Enhancing Distant Supervised Relation Extraction with Word-level Multi-instance Learning and Multi-hierarchical Feature

ICASSP 2025accepted

Distant supervised relation extraction (DSRE) obtains large amounts of data cost-effectively by aligning knowledge base with natural texts but also brings noisy data. Existing methods deal with noise through multi-instance learning (MIL) with attention. However, these approaches typically use attent…

Cited by 0SourceScholar
2024

Articulated Object Manipulation with Coarse-to-fine Affordance for Mitigating the Effect of Point Cloud Noise

ICRA 2024poster

3D articulated objects are inherently challenging for manipulation due to the varied geometries and intricate functionalities associated with articulated objects. Point-level affordance, which predicts the per-point actionable score and thus proposes the best point to interact with, has demonstrated…

Cited by 16SourceScholar
2024

Debiasing Recommenders Through Personalized Popularity-Aware Margins

ICASSP 2024accepted

Recommender systems based on Matrix Factorization are widely used. However, they can easily suffer from the problem of overrecommendation of popular items, i.e., popularity bias. To mitigate popularity bias, current methods often uniformly model interactions' popularity bias degree considering user…

Cited by 0SourceScholar
2023

Memory-Augmented Contrastive Learning for Talking Head Generation

ICASSP 2023accepted

Given one reference facial image and a piece of speech as input, talking head generation aims to synthesize a realistic-looking talking head video. However, generating a lip-synchronized video with natural head movements is challenging. The same speech clip can generate multiple possible lip and hea…

Cited by 0SourceScholar
2019

A Low-latency Sparse-Winograd Accelerator for Convolutional Neural Networks

ICASSP 2019accepted

Low-latency and low-power implementations of Convolutional Neural Network (CNN) are highly desired for budget-restricted scenarios. Pruning and Winograd algorithm are two representative approaches to reduce the computation complexity of CNNs. Coupling them is very attractive, but the Winograd transf…

Cited by 0SourceScholar