← Search

Weiwei Wu

13 accepted papers

2026

CALM: Co-evolution of Algorithms and Language Model for Automatic Heuristic Design

ICLR 2026poster

Tackling complex optimization problems often relies on expert-designed heuristics, typically crafted through extensive trial and error. Recent advances demonstrate that large language models (LLMs), when integrated into well-designed evolutionary search frameworks, can autonomously discover high-per…

Cited by 0SourcecodeScholar
2026

Constraint Matters: Multi-Modal Representation for Reducing Mixed-Integer Linear programming

ICLR 2026poster

Model reduction, which aims to learn a simpler model of the original mixed integer linear programming (MILP), can solve large-scale MILP problems much faster. Most existing model reduction methods are based on variable reduction, which predicts a solution value for a subset of variables. From a dual…

Cited by 0SourcecodeScholar
2026

Learning from Human Gaze: Human-like Robot Social Navigation in Dense Crowds

AAAI 2026technical

Robot navigation in dense crowds requires understanding social cues that humans naturally use, yet existing methods struggle with real-world complexity. We investigate two questions: (1) Where do pedestrians look when navigating crowds? and (2) Can eye tracking improve robot navigation? To answer, w

Cited by 0SourcePDFScholar
2025

Faithful Dynamic Imitation Learning from Human Intervention with Dynamic Regret Minimization

NeurIPS 2025poster

Human-in-the-loop (HIL) imitation learning enables agents to learn complex behaviors safely through real-time human intervention. However, existing methods struggle to efficiently leverage agent-generated data due to dynamically evolving trajectory distributions and imperfections caused by human int…

Cited by 0SourceScholar
2025

Fast and Interpretable Mixed-Integer Linear Program Solving by Learning Model Reduction

AAAI 2025technical

By exploiting the correlation between the structure and the solution of Mixed-Integer Linear Programming (MILP), Machine Learning (ML) has become a promising method for solving large-scale MILP problems. Existing ML-based MILP solvers mainly focus on end-to-end solution learning, which suffers from…

Cited by 2SourcePDFScholar
2025

Non-stochastic Budgeted Online Pricing with Semi-Bandit Feedback

AAAI 2025technical

We consider a general non-stochastic online pricing bandit setting in a procurement scenario where a buyer with a budget wants to procure items from a fixed set of sellers to maximize the buyer's reward by dynamically offering purchasing prices to the sellers, where the sellers' costs and values at…

Cited by 0SourcePDFScholar
2025

Transtreaming: Adaptive Delay-aware Transformer for Real-time Streaming Perception

AAAI 2025technical

Real-time object detection is critical for the decision-making process for many real-world applications, such as collision avoidance and path planning in autonomous driving. This work presents an innovative real-time streaming perception method, Transtreaming, which addresses the challenge of real-t…

2024

SocialGAIL: Faithful Crowd Simulation for Social Robot Navigation

ICRA 2024poster

Navigation through crowded human environments is challenging for social robots. While reinforcement learning has been adopted for its capacity to capture complex interactions, the training process often relies on simulators to replicate realistic crowd behaviors, ensuring cost-efficiency. Existing c…

Cited by 3SourcecodeScholar
2024

i-Rebalance: Personalized Vehicle Repositioning for Supply Demand Balance

AAAI 2024technical

Ride-hailing platforms have been facing the challenge of balancing demand and supply. Existing vehicle reposition techniques often treat drivers as homogeneous agents and relocate them deterministically, assuming compliance with the reposition. In this paper, we consider a more realistic and driver-…

2021

Budget-feasible Mechanisms for Representing Groups of Agents Proportionally

IJCAI 2021poster

In this paper, we consider the problem of designing budget-feasible mechanisms for selecting agents with private costs from various groups to ensure proportional representation, where the minimum proportion of the selected agents from each group is maximized. Depending on agents' membership in the…

Cited by 3SourcePDFScholar
2020

Weakly Supervised Semantic Segmentation with Boundary Exploration

ECCV 2020poster

Weakly supervised semantic segmentation with image-level labels has attracted a lot of attention recently because these labels are already available in most datasets. To obtain semantic segmentation under weak supervision, this paper presents a simple yet effective approach based on the idea of expl…

Cited by 210SourcePDFScholar