← Search

Feng Chen

83 accepted papers

2026

An Empirical Study on How Video-LLMs Answer Video Questions

CVPR 2026

Taking advantage of large-scale data and pretrained language models, Video Large Language Models (Video-LLMs) have shown strong capabilities in answering video questions. However, most existing efforts focus on improving performance, with limited attention to understanding their internal mechanisms.

Cited by 0SourceScholar
2026

Chain of Event-Centric Causal Thought for Physically Plausible Video Generation

CVPR 2026

Physically Plausible Video Generation (PPVG) has emerged as a promising avenue for modeling real-world physical phenomena. PPVG requires an understanding of commonsense knowledge, which remains a challenge for video diffusion models. Current approaches leverage commonsense reasoning capability of la

Cited by 0SourcecodeScholar
2026

DeFacto: Counterfactual Thinking with Images for Enforcing Evidence-Grounded and Faithful Reasoning

ICML 2026poster

Recent advances in multimodal language models (MLLMs) have made thinking with images a dominant paradigm for multimodal reasoning. However, existing methods still fail to ensure evidence–answer consistency, where correct answers must be supported by correct visual evidence. To address this issue, we…

Cited by 0SourceScholar
2026

Dynamic Deep Graph Learning for Incomplete Multi-View Clustering with Masked Graph Reconstruction Loss

AAAI 2026technical

The prevalence of real-world multi-view data makes incomplete multi-view clustering (IMVC) a crucial research. The rapid development of Graph Neural Networks (GNNs) has established them as one of the mainstream approaches for multi-view clustering. Despite significant progress in GNNs-based IMVC, so

Cited by 0SourcePDFScholar
2026

Evaluating, Synthesizing, and Enhancing for Customer Support Conversation

AAAI 2026technical

Effective customer support requires not only accurate problem-solving but also structured and empathetic communication aligned with professional standards. However, existing dialogue datasets often lack strategic guidance, and real-world service data is difficult to access and annotate. To address t

Cited by 0SourcePDFScholar
2026

Fin-PRM: A Domain-Specialized Process Reward Model for Financial Reasoning in Large Language Models

IJCAI 2026

Process Reward Models (PRMs) supervise intermediate reasoning steps in large language models (LLMs), but existing PRMs are mainly trained on general-domain data and struggle with the structured, symbolic, and fact-sensitive nature of financial reasoning. Financial tasks require not only correct fina

Cited by 0Scholar
2026

Generative Online Reinforcement Learning

ICML 2026poster

Reinforcement learning (RL) faces a persistent tension: policies that are stable to optimize (e.g., Gaussians) are often too simple to represent the multimodal action distributions required for complex control. Conversely, expressive generative policies—such as diffusion and flow matching—are freque…

Cited by 0SourceScholar
2026

OmniSparse: Training-Aware Fine-Grained Sparse Attention for Long-Video MLLMs

AAAI 2026technical

Existing sparse attention methods primarily target inference-time acceleration by selecting critical tokens under predefined sparsity patterns. However, they often fail to bridge the training–inference gap and lack the capacity for fine-grained token selection across multiple dimensions—such as quer

Cited by 0SourcePDFScholar
2026

Quantifying and Optimizing Simplicity via Polynomial Representations

ICML 2026poster

Deep networks often exhibit a preference for "simple" solutions, and such a simplicity bias is widely believed to play a key role in generalization. Yet a broadly applicable, quantitative measure of simplicity remains elusive. We introduce _polynomial representations_ as a distribution-aware, low-di…

Cited by 0SourceScholar
2026

Sparsity Forcing: Reinforcing Token Sparsity of MLLMs

ICLR 2026poster

Sparse attention mechanisms aim to reduce computational overhead with minimal accuracy loss by selectively processing salient tokens. Despite their effectiveness, most methods merely exploit a model’s inherent sparsity and thus plateau at moderate budgets (about 50\% token reduction), with little he…

Cited by 0SourceScholar
2026

Training-free Motion Factorization for Compositional Video Generation

CVPR 2026

Compositional video generation aims to synthesize multiple instances with diverse appearance and motion. However, current approaches mainly focus on binding semantics, neglecting to understand diverse motion categories specified in prompts. In this paper, we propose a motion factorization framework

Cited by 0SourcecodeScholar
2026

Translation Heads: Unveiling Attention's Role in LLM Multilingual Translation

ICLR 2026poster

Recently, large language models (LLMs) have made remarkable progress, with multilingual capability emerging as a core foundational strengths. However, the internal mechanisms by which these models perform translation remain incompletely understood. In this paper, we elucidate the relationship betwee…

Cited by 0SourceScholar
2026

VideoTrace-R1: Long Video-based Retrieval-Augmented Generation via Temporal Path Graph Understanding

ICML 2026poster

Long-video temporal reasoning remains challenging for Large Video Language Models (LVLMs). Recent reasoning-enhanced models apply reinforcement learning with outcome supervision to improve temporal understanding. However, outcome-only rewards cannot distinguish whether a model arrived at the correct…

Cited by 0SourceScholar
2025

ACT as Human: Multimodal Large Language Model Data Annotation with Critical Thinking

NeurIPS 2025poster

Supervised learning relies on high-quality labeled data, but obtaining such data through human annotation is both expensive and time-consuming. Recent work explores using large language models (LLMs) for annotation, but LLM-generated labels still fall short of human-level quality. To address this pr…

Cited by 0SourceScholar
2025

Adaptive Fission: Post-training Encoding for Low-latency Spike Neural Networks

NeurIPS 2025poster

Spiking Neural Networks (SNNs) often rely on rate coding, where high-precision inference depends on long time-steps, leading to significant latency and energy cost—especially for ANN-to-SNN conversions. To address this, we propose Adaptive Fission, a post-training encoding technique that selectively…

Cited by 0SourceScholar
2025

Alternating Gradient Flows: A Theory of Feature Learning in Two-layer Neural Networks

NeurIPS 2025poster

What features neural networks learn, and how, remains an open question. In this paper, we introduce Alternating Gradient Flows (AGF), an algorithmic framework that describes the dynamics of feature learning in two-layer networks trained from small initialization. Prior works have shown that gradient…

Cited by 0SourceScholar
2025

BFS-Prover: Scalable Best-First Tree Search for LLM-based Automatic Theorem Proving

ACL 2025long

Recent advancements in large language models (LLMs) have spurred growing interest in automatic theorem proving using Lean4, where effective tree search methods are crucial for navigating the underlying large proof search spaces. While the existing approaches primarily rely on value functions and/or…

Cited by 0SourcePDFScholar
2025

EvaLearn: Quantifying the Learning Capability and Efficiency of LLMs via Sequential Problem Solving

NeurIPS 2025poster

We introduce EvaLearn, a pioneering benchmark designed to evaluate large language models (LLMs) on their learning capability and efficiency in challenging tasks, a critical, yet underexplored aspect of model potential. EvaLearn contains 648 challenging problems across six task types, grouped into 18…

Cited by 0SourceScholar
2025

Evidential Uncertainty Probes for Graph Neural Networks

AISTATS 2025poster

Accurate quantification of both aleatoric and epistemic uncertainties is essential when deploying Graph Neural Networks (GNNs) in high-stakes applications such as drug discovery and financial fraud detection, where reliable predictions are critical. Although Evidential Deep Learning (EDL) efficientl…

Cited by 0SourceScholar
2025

Exploring the Hidden Reasoning Process of Large Language Models by Misleading Them

EMNLP 2025

Large language models (LLMs) have been able to perform various forms of reasoning tasks ina wide range of scenarios, but are they truly engaging in task abstraction and rule-based reasoning beyond mere memorization? To answer this question, we propose a novel experimentalapproach, Misleading Fine-Tu

Cited by 0SourcePDFScholar
2025

GRICP: Granular-Ball Iterative Closest Point with Multikernel Correntropy for Point Cloud Fine Registration

AAAI 2025technical

The Iterative Closest Point (ICP) algorithm suffers from sensitivity to outliers and tendency to local optima in point cloud fine registration. In this paper, we introduce a global and robust ICP framework called Granular-Ball Iterative Closest Point with MultiKernel Correntropy (GRICP). This approa…

2025

HyperTASR: Hypernetwork-Driven Task-Aware Scene Representations for Robust Manipulation

CoRL 2025poster

Effective policy learning for robotic manipulation requires scene representations that selectively capture task-relevant environmental features. Current approaches typically employ task-agnostic representation extraction, failing to emulate the dynamic perceptual adaptation observed in human cogniti…

Cited by 0SourceScholar
2025

Informed Correctors for Discrete Diffusion Models

NeurIPS 2025poster

Discrete diffusion has emerged as a powerful framework for generative modeling in discrete domains, yet efficiently sampling from these models remains challenging. Existing sampling strategies often struggle to balance computation and sample quality when the number of sampling steps is reduced, even…

Cited by 0SourceScholar
2025

Large Language Models with Reinforcement Learning from Human Feedback Approach for Enhancing Explainable Sexism Detection

COLING 2025main

Recent advancements in natural language processing, driven by Large Language Models (LLMs), have significantly improved text comprehension, enabling these models to handle complex tasks with greater efficiency. A key feature of LLMs is their ability to engage in contextual learning, which allows the…

2025

Learning to Reuse Policies in State Evolvable Environments

ICML 2025poster

The policy trained via reinforcement learning (RL) makes decisions based on sensor-derived state features. It is common for state features to evolve for reasons such as periodic sensor maintenance or the addition of new sensors for performance improvement. The deployed policy fails in new state spac…

Cited by 0SourcePDFScholar
2025

Let The Jury Decide: Fair Demonstration Selection for In-Context Learning through Incremental Greedy Evaluation

ACL 2025finding

Large Language Models (LLMs) are powerful in-context learners, achieving strong performance with just a few high-quality demonstrations. However, fairness concerns arise in many in-context classification tasks, especially when predictions involve sensitive attributes. To address this, we propose JUD…

2025

Lost in the Context: Insufficient and Distracted Attention to Contexts in Preference Modeling

ACL 2025long

In Reinforcement Learning from Human Feedback (RLHF), the reward model (RM) evaluates the response quality based on the given context and assigns a reward. It plays a crucial role in aligning RLHF with human preferences. Although the current RM training paradigm concatenates the context and response…

Cited by 0SourcePDFScholar
2025

MFinMeeting: A Multilingual, Multi-Sector, and Multi-Task Financial Meeting Understanding Evaluation Dataset

ACL 2025finding

Recent breakthroughs in large language models (LLMs) have led to the development of new benchmarks for evaluating their performance in the financial domain. However, current financial benchmarks often rely on news articles, earnings reports, or announcements, making it challenging to capture the rea…

2025

OURO: A Self-Bootstrapped Framework for Enhancing Multimodal Scene Understanding

ICCV 2025poster

Multimodal large models have made significant progress, yet fine-grained understanding of complex scenes remains a challenge. High-quality, large-scale vision-language datasets are essential for addressing this issue. However, existing methods often rely on labor-intensive manual annotations or clos…

2025

Pancreatic Cystic Neoplasms Lesion Detection for Non-contrast CT Image via Teacher-student Model

ICASSP 2025accepted

Due to the low contrast between lesion features and surrounding tissues in non-contrast CT images, traditional detection methods often struggle to accurately identify and differentiate various types of cystic tumors. This limitation increases the risk of misdiagnosis and missed detection, thereby hi…

Cited by 0SourceScholar
2025

Predictive Uncertainty Quantification for Bird's Eye View Segmentation: A Benchmark and Novel Loss Function

ICLR 2025poster

The fusion of raw sensor data to create a Bird's Eye View (BEV) representation is critical for autonomous vehicle planning and control. Despite the growing interest in using deep learning models for BEV semantic segmentation, anticipating segmentation errors and enhancing the explainability of these…

Cited by 1SourcePDFScholar
2025

Rethinking Fine-Tuning when Scaling Test-Time Compute: Limiting Confidence Improves Mathematical Reasoning

NeurIPS 2025poster

Recent progress in large language models (LLMs) highlights the power of scaling test-time compute to achieve strong performance on complex tasks, such as mathematical reasoning and code generation. This raises a critical question: how should model training be modified to optimize performance under a…

Cited by 0SourcecodeScholar
2025

SolverLLM: Leveraging Test-Time Scaling for Optimization Problem via LLM-Guided Search

NeurIPS 2025poster

Large Language Models (LLMs) offer promising capabilities for tackling complex reasoning tasks, including optimization problems. However, existing methods either rely on prompt engineering, which leads to poor generalization across problem types, or require costly supervised training. We introduce S…

Cited by 0SourceScholar
2025

Training-free Dense-Aligned Diffusion Guidance for Modular Conditional Image Synthesis

CVPR 2025poster

Conditional image synthesis is a crucial task with broad applications, such as artistic creation and virtual reality. However, current generative methods are often task-oriented with a narrow scope, handling a restricted condition with constrained applicability. In this paper, we propose a novel app…

2025

ZipAR: Parallel Autoregressive Image Generation through Spatial Locality

ICML 2025poster

In this paper, we propose ZipAR, a training-free, plug-and-play parallel decoding framework for accelerating autoregressive (AR) visual generation. The motivation stems from the observation that images exhibit local structures, and spatially distant regions tend to have minimal interdependence. Give…

Cited by 0SourcePDFScholar
2025

ZipVL: Accelerating Vision-Language Models through Dynamic Token Sparsity

ICCV 2025poster

The efficiency of large vision-language models (LVLMs) is constrained by the computational bottleneck of the attention mechanism during the prefill phase and the memory bottleneck of fetching the key-value (KV) cache in the decoding phase, particularly in scenarios involving high-resolution images o…

Cited by 0SourcePDFScholar
2024

Can We Trust the Performance Evaluation of Uncertainty Estimation Methods in Text Summarization?

EMNLP 2024main

Text summarization, a key natural language generation (NLG) task, is vital in various domains. However, the high cost of inaccurate summaries in risk-critical applications, particularly those involving human-in-the-loop decision-making, raises concerns about the reliability of uncertainty estimation…

2024

Feature Contamination: Neural Networks Learn Uncorrelated Features and Fail to Generalize

ICML 2024poster

Learning representations that generalize under distribution shifts is critical for building robust machine learning models. However, despite significant efforts in recent years, algorithmic advances in this direction have been limited. In this work, we seek to understand the fundamental difficulty o…

2024

Fedsoda: Federated Cross-Assessment and Dynamic Aggregation for Histopathology Segmentation

ICASSP 2024accepted

Federated learning (FL) for histopathology image segmentation involving multiple medical sites plays a crucial role in advancing the field of accurate disease diagnosis and treatment. However, it is still a task of great challenges due to the sample imbalance across clients and large data heterogene…

Cited by 0SourceScholar
2024

Get rich quick: exact solutions reveal how unbalanced initializations promote rapid feature learning

NeurIPS 2024spotlight

While the impressive performance of modern neural networks is often attributed to their capacity to efficiently extract task-relevant features from data, the mechanisms underlying this *rich feature learning regime* remain elusive, with much of our theoretical understanding stemming from the opposin…

2024

Hyper Evidential Deep Learning to Quantify Composite Classification Uncertainty

ICLR 2024poster

Deep neural networks (DNNs) have been shown to perform well on exclusive, multi-class classification tasks. However, when different classes have similar visual features, it becomes challenging for human annotators to differentiate them. When an image is ambiguous, such as a blurry one where an annot…

2024

Learning Causally Disentangled Representations via the Principle of Independent Causal Mechanisms

IJCAI 2024poster

Learning disentangled causal representations is a challenging problem that has gained significant attention recently due to its implications for extracting meaningful information for downstream tasks. In this work, we define a new notion of causal disentanglement from the perspective of independent…

2024

RoboGen: Towards Unleashing Infinite Data for Automated Robot Learning via Generative Simulation

ICML 2024poster

We present RoboGen, a generative robotic agent that automatically learns diverse robotic skills at scale via generative simulation. RoboGen leverages the latest advancements in foundation and generative models. Instead of directly adapting these models to produce policies or low-level actions, we ad…

Cited by 88SourcePDFScholar
2024

Spatio-Temporal Approximation: A Training-Free SNN Conversion for Transformers

ICLR 2024poster

Spiking neural networks (SNNs) are energy-efficient and hold great potential for large-scale inference. Since training SNNs from scratch is costly and has limited performance, converting pretrained artificial neural networks (ANNs) to SNNs is an attractive approach that retains robust performance wi…

Cited by 12SourcePDFScholar
2024

Uncertainty Estimation on Sequential Labeling via Uncertainty Transmission

NAACL 2024findings

Sequential labeling is a task predicting labels for each token in a sequence, such as Named Entity Recognition (NER). NER tasks aim to extract entities and predict their labels given a text, which is important in information extraction. Although previous works have shown great progress in improving…

2023

DiffVL: Scaling Up Soft Body Manipulation using Vision-Language Driven Differentiable Physics

NeurIPS 2023poster

Combining gradient-based trajectory optimization with differentiable physics simulation is an efficient technique for solving soft-body manipulation problems. Using a well-crafted optimization objective, the solver can quickly converge onto a valid trajectory. However, writing the appropriate object…

Cited by 3SourcePDFScholar
2023

Fast Counterfactual Inference for History-Based Reinforcement Learning

AAAI 2023technical

Incorporating sequence-to-sequence models into history-based Reinforcement Learning (RL) provides a general way to extend RL to partially-observable tasks. This method compresses history spaces according to the correlations between historical observations and the rewards. However, they do not adjust…

Cited by 3SourcePDFScholar
2023

Graph-Based Spectro-Temporal Dependency Modeling for Anti-Spoofing

ICASSP 2023accepted

A great deal of recent research reveals that artifacts introduced by spoofing algorithms reside in specific frequency subbands or temporal segments. Therefore, the performance of spoofing detection can be improved by focusing on these regions. However, it is difficult for the detection system to cho…

Cited by 0SourceScholar
2023

Improvements on Uncertainty Quantification for Node Classification via Distance Based Regularization

NeurIPS 2023poster

Deep neural networks have achieved significant success in the last decades, but they are not well-calibrated and often produce unreliable predictions. A large number of literature relies on uncertainty quantification to evaluate the reliability of a learning model, which is particularly important fo…

2023

Multi-Label Temporal Evidential Neural Networks for Early Event Detection

ICASSP 2023accepted

Early event detection aims to detect events even before the event is complete. However, most of the existing methods focus on an event with a single label but fail to be applied to cases with multiple labels. Another non-negligible issue for early event detection is a prediction with overconfidence…

Cited by 0SourceScholar
2023

Pretraining task diversity and the emergence of non-Bayesian in-context learning for regression

NeurIPS 2023poster

Pretrained transformers exhibit the remarkable ability of in-context learning (ICL): they can learn tasks from just a few examples provided in the prompt without updating any weights. This raises a foundational question: can ICL solve fundamentally _new_ tasks that are very different from those seen…

2023

Robust Multi-Agent Coordination via Evolutionary Generation of Auxiliary Adversarial Attackers

AAAI 2023technical

Cooperative Multi-agent Reinforcement Learning (CMARL) has shown to be promising for many real-world applications. Previous works mainly focus on improving coordination ability via solving MARL-specific challenges (e.g., non-stationarity, credit assignment, scalability), but ignore the policy pertur…

2023

Self-Convolution for Automatic Speech Recognition

ICASSP 2023accepted

Self-attention plays a significant role in recent automatic speech recognition (ASR) models with promising results. However, it suffers from high computational complexity and weak capability in modeling local information. In contrast, the convolutional neural network (CNN) is computationally effecti…

Cited by 0SourceScholar
2023

Stochastic Collapse: How Gradient Noise Attracts SGD Dynamics Towards Simpler Subnetworks

NeurIPS 2023poster

In this work, we reveal a strong implicit bias of stochastic gradient descent (SGD) that drives overly expressive networks to much simpler subnetworks, thereby dramatically reducing the number of independent parameters, and improving generalization. To reveal this bias, we identify _invariant sets_,…

2023

Towards Deployment-Efficient and Collision-Free Multi-Agent Path Finding (Student Abstract)

AAAI 2023technical

Multi-agent pathfinding (MAPF) is essential to large-scale robotic coordination tasks. Planning-based algorithms show their advantages in collision avoidance while avoiding exponential growth in the number of agents. Reinforcement-learning (RL)-based algorithms can be deployed efficiently but cannot…

Cited by 0SourcePDFScholar
2023

Uncertainty-guided Learning for Improving Image Manipulation Detection

ICCV 2023poster

Image manipulation detection (IMD) is of vital importance as faking images and spreading misinformation can be malicious and harm our daily life. IMD is the core technique to solve these issues and poses challenges in two main aspects: (1) Data Uncertainty, i.e., the manipulated artifacts are often…

Cited by 18PDFcodeScholar
2023

Unmasking the Lottery Ticket Hypothesis: What's Encoded in a Winning Ticket's Mask?

ICLR 2023top-25%

As neural networks get larger and costlier, it is important to find sparse networks that require less compute and memory but can be trained to the same accuracy as the full network (i.e. matching). Iterative magnitude pruning (IMP) is a state of the art algorithm that can find such highly sparse mat…

Cited by 50SourcePDFScholar
2022

A Nested Bi-level Optimization Framework for Robust Few Shot Learning

AAAI 2022technical

Model-Agnostic Meta-Learning (MAML), a popular gradient-based meta-learning framework, assumes that the contribution of each task or instance to the meta-learner is equal.Hence, it fails to address the domain shift between base and novel classes in few-shot learning. In this work, we propose a novel…

2022

Calibrated Nonparametric Scan Statistics for Anomalous Pattern Detection in Graphs

AAAI 2022technical

We propose a new approach, the calibrated nonparametric scan statistic (CNSS), for more accurate detection of anomalous patterns in large-scale, real-world graphs. Scan statistics identify connected subgraphs that are interesting or unexpected through maximization of a likelihood ratio statistic; in…

Cited by 3SourcePDFScholar
2022

Efficient Multi-agent Communication via Self-supervised Information Aggregation

NeurIPS 2022accept

Utilizing messages from teammates can improve coordination in cooperative Multi-agent Reinforcement Learning (MARL). To obtain meaningful information for decision-making, previous works typically combine raw messages generated by teammates with local information as inputs for policy. However, neglec…

Cited by 35SourcePDFScholar
2022

Interacting Attention Graph for Single Image Two-Hand Reconstruction

CVPR 2022oral

Graph convolutional network (GCN) has achieved great success in single hand reconstruction task, while interacting two-hand reconstruction by GCN remains unexplored. In this paper, we present Interacting Attention Graph Hand (IntagHand), the first graph convolution based network that reconstructs tw…

Cited by 133PDFcodeScholar
2022

Multi-Agent Concentrative Coordination with Decentralized Task Representation

IJCAI 2022poster

Value-based multi-agent reinforcement learning (MARL) methods hold the promise of promoting coordination in cooperative settings. Popular MARL methods mainly focus on the scalability or the representational capacity of value functions. Such a learning paradigm can reduce agents' uncertainties and pr…

2022

Non-Autoregressive Transformer with Unified Bidirectional Decoder for Automatic Speech Recognition

ICASSP 2022accepted

Non-autoregressive (NAR) transformer models have been studied intensively in automatic speech recognition (ASR), and many NAR transformer models is to use the causal mask to limit token dependencies. However, the causal mask is designed for the left-to-right decoding process of the non-parallel auto…

Cited by 0SourceScholar
2022

PLATINUM: Semi-Supervised Model Agnostic Meta-Learning using Submodular Mutual Information

ICML 2022spotlight

Few-shot classification (FSC) requires training models using a few (typically one to five) data points per class. Meta-learning has proven to be able to learn a parametrized model for FSC by training on various other classification tasks. In this work, we propose PLATINUM (semi-suPervised modeL Agno…

2022

Seed: Sound Event Early Detection Via Evidential Uncertainty

ICASSP 2022accepted

Sound Event Early Detection (SEED) is an essential task in recognizing the acoustic environments and soundscapes. However, most of the existing methods focus on the offline sound event detection, which suffers from the over-confidence issue of early-stage event detection and usually yield unreliable…

Cited by 0SourceScholar
2021

Boosting Cross-Lingual Transfer via Self-Learning with Uncertainty Estimation

EMNLP 2021main

Recent multilingual pre-trained language models have achieved remarkable zero-shot performance, where the model is only finetuned on one source language and directly evaluated on target languages. In this work, we propose a self-learning framework that further utilizes unlabeled data of target langu…

2021

CRIL: Continual Robot Imitation Learning via Generative and Prediction Model

IROS 2021poster

Imitation learning (IL) algorithms have shown promising results for robots to learn skills from expert demonstrations. However, they need multi-task demonstrations to be provided at once for acquiring diverse skills, which is difficult in real world. In this work we study how to realize continual im…

Cited by 20SourcecodeScholar
2021

Distributionally Robust Optimization for Deep Kernel Multiple Instance Learning

AISTATS 2021poster

Multiple Instance Learning (MIL) provides a promising solution to many real-world problems, where labels are only available at the bag level but missing for instances due to a high labeling cost. As a powerful Bayesian non-parametric model, Gaussian Processes (GP) have been extended from classical s…

2021

Multidimensional Uncertainty-Aware Evidential Neural Networks

AAAI 2021technical

Traditional deep neural networks (NNs) have significantly contributed to the state-of-the-art performance in the task of classification under various application domains. However, NNs have not considered inherent uncertainty in data associated with the class probabilities where misclassification un…

2021

RETRIEVE: Coreset Selection for Efficient and Robust Semi-Supervised Learning

NeurIPS 2021poster

Semi-supervised learning (SSL) algorithms have had great success in recent years in limited labeled data regimes. However, the current state-of-the-art SSL algorithms are computationally expensive and entail significant compute time and energy requirements. This can prove to be a huge limitation for…

2020

Adaptability Preserving Domain Decomposition for Stabilizing Sim2Real Reinforcement Learning

IROS 2020poster

In sim-to-real transfer of Reinforcement Learning (RL) policies for robot tasks, Domain Randomization (DR) is a widely used technique for improving adaptability. However, in DR there is a conflict between adaptability and training stability, and heavy DR tends to result in instability or even failur…

Cited by 6SourceScholar
2020

Generating Adjacency-Constrained Subgoals in Hierarchical Reinforcement Learning

NeurIPS 2020spotlight

Goal-conditioned hierarchical reinforcement learning (HRL) is a promising approach for scaling up reinforcement learning (RL) techniques. However, it often suffers from training inefficiency as the action space of the high-level, i.e., the goal space, is often large. Searching in a large goal space…

2020

Multifaceted Uncertainty Estimation for Label-Efficient Deep Learning

NeurIPS 2020poster

We present a novel multi-source uncertainty prediction approach that enables deep learning (DL) models to be actively trained with much less labeled data. By leveraging the second-order uncertainty representation provided by subjective logic (SL), we conduct evidence-based theoretical analysis and f…

Cited by 41SourcePDFScholar
2020

Uncertainty Aware Semi-Supervised Learning on Graph Data

NeurIPS 2020spotlight

Thanks to graph neural networks (GNNs), semi-supervised node classification has shown the state-of-the-art performance in graph data. However, GNNs have not considered different types of uncertainties associated with class probabilities to minimize risk of increasing misclassification under uncerta…

2019

Convolution with even-sized kernels and symmetric padding

NeurIPS 2019poster

Compact convolutional neural networks gain efficiency mainly through depthwise convolutions, expanded channels and complex topologies, which contrarily aggravate the training process. Besides, 3x3 kernels dominate the spatial representation in these models, whereas even-sized kernels (2x2, 4x4) are…

2019

Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization

ICML 2019oral

Stochastic optimization algorithms update models with cheap per-iteration costs sequentially, which makes them amenable for large-scale data analysis. Such algorithms have been widely studied for structured sparse models where the sparsity information is very specific, e.g., convex sparsity-inducing…