← Search

Jianxin Wang

37 accepted papers

2026

Awaken Memories with Words: Recursive Visual Imagination and Adaptive Linguistic Grounding for Vision Language Navigation

ICRA 2026poster

Vision Language Navigation (VLN) typically requires agents to navigate to specified objects or remote regions in unknown scenes by obeying linguistic commands. Such tasks require organizing historical visual observations for linguistic grounding, which is critical for long-sequence navigational deci…

Cited by 0Scholar
2026

LeGO-MM: Learning Navigation for Goal-Oriented Mobile Manipulation Via Hierarchical Policy Distillation

ICRA 2026poster

Benefiting from mobility and dexterity, Mobile Manipulation (MM) systems are expected to assist humans with diverse tasks in everyday life. However, since MM tasks (e.g., tidying up a room) require learning multi-stage heterogeneous behaviors (e.g., picking, placing, and opening), existing Reinforce…

Cited by 0Scholar
2026

New Algorithms for Fully-Dynamic k-center with Outliers

ICML 2026poster

In this paper, we study the fully-dynamic k-center with outliers problem. In this setting, the clustering data changes over time through a sequence of updates. The goal is to maintain an approximate k-center solution with efficient update and query time, while allowing up to z points to be discarded…

Cited by 0SourceScholar
2026

Spatially Generalizable Mobile Manipulation via Adaptive Experience Selection and Dynamic Imagination

IJCAI 2026

Mobile Manipulation (MM) involves long-horizon decision-making over multi-stage compositions of heterogeneous skills, such as navigation and picking up objects. Despite recent progress, existing MM methods still face two key limitations: (i) low sample efficiency, due to ineffective use of redundant

Cited by 0Scholar
2026

Towards Ultrasound-based Reliable Disease Diagnosis Using Causal Inference

AAAI 2026technical

Aligning the decision-making process of deep learning models with that of experienced sonographers is essential for ultrasound-based reliable disease diagnosis. Although existing methods have made significant progress in this aspect, their alignments are primarily associational rather than causal, l

Cited by 0SourcePDFScholar
2026

Universal-to-Specific: Dynamic Knowledge-Guided Multiple Instance Learning for Few-Shot Whole Slide Image Classification

CVPR 2026

Multiple Instance Learning (MIL) has emerged as the dominant paradigm for the analysis of gigapixel-scale Whole Slide Images (WSIs). However, recent methods leveraging guidance from Vision-Language Models often rely on static and universal pathological descriptions. This one-size-fits-all strategy f

Cited by 0SourcecodeScholar
2025

A Single-Swap Local Search Algorithm for k-Means of Lines

NeurIPS 2025poster

Clustering is a fundamental problem that has been extensively studied over past few decades, with most research focusing on point-based clustering such as $k$-means, $k$-median, and $k$-center. However, numerous real-world applications, such as motion analysis, computer vision, and missing data anal…

Cited by 0SourceScholar
2025

C2F-TP: A Coarse-to-Fine Denoising Framework for Uncertainty-Aware Trajectory Prediction

AAAI 2025technical

Accurately predicting the trajectory of vehicles is critically important for ensuring safety and reliability in autonomous driving. Although considerable research efforts have been made recently, the inherent trajectory uncertainty caused by various factors including the dynamic driving intends and…

2025

DDO: Dual-Decision Optimization for LLM-Based Medical Consultation via Multi-Agent Collaboration

EMNLP 2025

Large Language Models (LLMs) demonstrate strong generalization and reasoning abilities, making them well-suited for complex decision-making tasks such as medical consultation (MC). However, existing LLM-based methods often fail to capture the dual nature of MC, which entails two distinct sub-tasks:

2025

Fast Local Search Algorithms for Clustering with Adaptive Sampling and Bandit Strategies

NeurIPS 2025poster

Local search is a powerful clustering technique that provides high-quality solutions with theoretical guarantees. With distance-based sampling strategies, local search methods can achieve constant approximations for clustering with linear running time in data size. Despite their effectiveness, exist…

Cited by 0SourceScholar
2025

Fully-Scalable Massively Parallel Algorithm for k-center with Outliers

AAAI 2025technical

In this paper, we consider the k-center problem with outliers (the (k, z)-center problem) in the context of Massively Parallel Computation (MPC). Existing MPC algorithms for the (k, z)-center problem typically require Ω(k) local space per machine. While this may be feasible when k is small, these al…

Cited by 0SourcePDFScholar
2025

Improving Cancer Gene Prediction by Enhancing Common Information Between the PPI Network and Gene Functional Association

AAAI 2025technical

Identifying cancer genes is crucial for treatment and understanding pathogenesis. Recent methods typically leverage protein-protein interaction (PPI) networks or gene functional association data from annotated gene sets. There may be some shared neighborhood structure information between these two t…

2025

New Algorithms for the Learning-Augmented k-means Problem

ICLR 2025poster

In this paper, we study the clustering problems in the learning-augmented setting, where predicted labels for a d-dimensional dataset with size m are given by an oracle to serve as auxiliary information to improve the clustering performance. Following the prior work, the given oracle is parameterize…

Cited by 0SourcePDFScholar
2025

Parameterized Approximation Algorithm for Doubly Constrained Fair Clustering

IJCAI 2025

Fair clustering has recently received considerable attention where numerous distinct fairness notions are developed. Despite being well-justified, these fairness notions are frequently studied in isolation, leaving the need to explore how they can be combined. Building on prior work, we focus on the

Cited by 0SourcePDFScholar
2025

PartInstruct: Part-level Instruction Following for Fine-grained Robot Manipulation

RSS 2025poster

Fine-grained robot manipulation, such as lifting and rotating a bottle to display the label on the cap, requires robust reasoning about object parts and their relationships with intended tasks. Despite recent advances in training general-purpose robot manipulation policies guided by language instruc…

Cited by 0PDFScholar
2025

RUIE: Retrieval-based Unified Information Extraction using Large Language Model

COLING 2025main

Unified information extraction (UIE) aims to extract diverse structured information from unstructured text. While large language models (LLMs) have shown promise for UIE, they require significant computational resources and often struggle to generalize to unseen tasks. We propose RUIE (Retrieval-bas…

2025

medIKAL: Integrating Knowledge Graphs as Assistants of LLMs for Enhanced Clinical Diagnosis on EMRs

COLING 2025main

Electronic Medical Records (EMRs), while integral to modern healthcare, present challenges for clinical reasoning and diagnosis due to their complexity and information redundancy. To address this, we proposed medIKAL (Integrating Knowledge Graphs as Assistants of LLMs), a framework that combines Lar…

2024

Fine Tuning Out-of-Vocabulary Item Recommendation with User Sequence Imagination

NeurIPS 2024spotlight

Recommending out-of-vocabulary (OOV) items is a challenging problem since the in-vocabulary (IV) items have well-trained behavioral embeddings but the OOV items only have content features. Current OOV recommendation models often generate 'makeshift' embeddings for OOV items from content features and…

Cited by 3SourcePDFScholar
2024

HSPNav: Hierarchical Scene Prior Learning for Visual Semantic Navigation Towards Real Settings

ICRA 2024poster

Visual Semantic Navigation (VSN) aims at navigating a robot to a given target object in a previously unseen scene. To tackle this task, the robot must learn a nimble navigation policy by utilizing spatial patterns and semantic co-occurrence relations among objects in the scene. Prevailing approaches…

Cited by 1SourceScholar
2024

Linear Time Approximation Algorithm for Column Subset Selection with Local Search

NeurIPS 2024poster

The Column Subset Selection (CSS) problem has been widely studied in dimensionality reduction and feature selection. The goal of the CSS problem is to output a submatrix S, consisting of k columns from an n×d input matrix A that minimizes the residual error ‖A-SS^\dagger A‖_F^2, where S^\dagger is t…

Cited by 0SourcePDFScholar
2024

MARE: Multi-Aspect Rationale Extractor on Unsupervised Rationale Extraction

EMNLP 2024main

Unsupervised rationale extraction aims to extract text snippets to support model predictions without explicit rationale annotation.Researchers have made many efforts to solve this task. Previous works often encode each aspect independently, which may limit their ability to capture meaningful interna…

2024

Multi-modal Concept Alignment Pre-training for Generative Medical Visual Question Answering

ACL 2024findings

Medical Visual Question Answering (Med-VQA) seeks to accurately respond to queries regarding medical images, a task particularly challenging for open-ended questions. This study unveils the Multi-modal Concept Alignment Pre-training (MMCAP) approach for generative Med-VQA, leveraging a knowledge gra…

Cited by 3SourcePDFScholar
2024

Near-Linear Time Approximation Algorithms for k-means with Outliers

ICML 2024poster

The k-means with outliers problem is one of the most extensively studied clustering problems in the field of machine learning, where the goal is to discard up to z outliers and identify a minimum k-means clustering on the remaining data points. Most previous results for this problem have running tim…

Cited by 2SourcePDFScholar
2024

SEC: More Accurate Clustering Algorithm via Structural Entropy

AAAI 2024technical

As one of the most popular machine learning tools in the field of unsupervised learning, clustering has been widely used in various practical applications. While numerous methods have been proposed for clustering, a commonly encountered issue is that the existing clustering methods rely heavily on l…

Cited by 0SourcePDFScholar
2024

SaSDim:Self-Adaptive Noise Scaling Diffusion Model for Spatial Time Series Imputation

IJCAI 2024poster

Spatial time series imputation is of great importance to various real-world applications. As the state-of-the-art generative models, diffusion models (e.g. CSDI) have outperformed statistical and autoregressive based models in time series imputation. However, diffusion models may introduce unstable…

Cited by 1SourcePDFScholar
2024

Socially Aware Object Goal Navigation With Heterogeneous Scene Representation Learning

RA-L 2024

Socially aware Object Goal Navigation (ObjectNav) requires robots to navigate to objects with specific semantic categories while understanding complex human social awareness and semantic co-occurrence relations among objects. Existing solutions usually achieve scene representation by mapping these c

Cited by 9SourceScholar
2023

CDA: A Contrastive Data Augmentation Method for Alzheimer’s Disease Detection

ACL 2023findings

Alzheimer’s Disease (AD) is a neurodegenerative disorder that significantly impacts a patient’s ability to communicate and organize language. Traditional methods for detecting AD, such as physical screening or neurological testing, can be challenging and time-consuming. Recent research has explored…

Cited by 9SourcePDFScholar
2023

Fast Algorithms for Distributed k-Clustering with Outliers

ICML 2023poster

In this paper, we study the $k$-clustering problems with outliers in distributed setting. The current best results for the distributed $k$-center problem with outliers have quadratic local running time with communication cost dependent on the aspect ratio $\Delta$ of the given instance, which may co…

Cited by 6SourcePDFScholar
2023

Linear Time Algorithms for k-means with Multi-Swap Local Search

NeurIPS 2023poster

The local search methods have been widely used to solve the clustering problems. In practice, local search algorithms for clustering problems mainly adapt the single-swap strategy, which enables them to handle large-scale datasets and achieve linear running time in the data size. However, compared w…

Cited by 1SourcePDFScholar
2023

V-InFoR: A Robust Graph Neural Networks Explainer for Structurally Corrupted Graphs

NeurIPS 2023poster

GNN explanation method aims to identify an explanatory subgraph which contains the most informative components of the full graph. However, a major limitation of existing GNN explainers is that they are not robust to the structurally corrupted graphs, e.g., graphs with noisy or adversarial edges. On…

Cited by 4SourcePDFScholar
2022

Coded Residual Transform for Generalizable Deep Metric Learning

NeurIPS 2022accept

A fundamental challenge in deep metric learning is the generalization capability of the feature embedding network model since the embedding network learned on training classes need to be evaluated on new test classes. To address this challenge, in this paper, we introduce a new method called coded…

Cited by 4SourcePDFScholar
2022

FLS: A New Local Search Algorithm for K-means with Smaller Search Space

IJCAI 2022poster

The k-means problem is an extensively studied unsupervised learning problem with various applications in decision making and data mining. In this paper, we propose a fast and practical local search algorithm for the k-means problem. Our method reduces the search space of swap pairs from O(nk) to O(k…

Cited by 2SourcePDFScholar
2021

Prediction of Egfr Mutation Status in Lung Adenocarcinoma Using Multi-Source Feature Representations

ICASSP 2021accepted

Epidermal growth factor receptor (EGFR) genotyping is essential to treatment guidelines for the use of tyrosine kinase inhibitors in lung adenocarcinoma. However, accurate and noninvasive methods to detect the EGFR gene are ongoing challenges. In this study, we propose a hybrid framework, namely HC-…

Cited by 0SourceScholar