research
∙
08/27/2023
Universal Graph Continual Learning
We address catastrophic forgetting issues in graph learning as incoming ...
share
research
∙
08/09/2023
Intrinsic Motivation via Surprise Memory
We present a new computing model for intrinsic rewards in reinforcement ...
research
∙
07/31/2023
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More
The notion of shortcut partition, introduced recently by Chang, Conroy, ...
research
∙
06/20/2023
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω(log n) Lightness Barrier
An essential requirement of spanners in many applications is to be fault...
research
∙
06/09/2023
Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions
Recently the authors [CCLMST23] introduced the notion of shortcut partit...
research
∙
06/09/2023
Covering Planar Metrics (and Beyond): O(1) Trees Suffice
While research on the geometry of planar graphs has been active in the p...
research
∙
05/31/2023
CodeTF: One-stop Transformer Library for State-of-the-art Code LLM
Code intelligence plays a key role in transforming modern software engin...
research
∙
05/13/2023
CodeT5+: Open Code Large Language Models for Code Understanding and Generation
Large language models (LLMs) pretrained on vast source code have achieve...
research
∙
05/12/2023
When Giant Language Brains Just Aren't Enough! Domain Pizzazz with Knowledge Sparkle Dust
Large language models (LLMs) have significantly advanced the field of na...
research
∙
04/14/2023
Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1
We prove that there is a randomized polynomial-time algorithm that given...
research
∙
04/04/2023
VC Set Systems in Minor-free (Di)Graphs and Applications
A recent line of work on VC set systems in minor-free (undirected) graph...
research
∙
03/03/2023
BO-Muse: A human expert and AI teaming framework for accelerated experimental design
In this paper we introduce BO-Muse, a new approach to human-AI teaming f...
research
∙
01/17/2023
Memory-Augmented Theory of Mind Network
Social reasoning necessitates the capacity of theory of mind (ToM), the ...
research
∙
12/23/2022
Learning to Generate Questions by Enhancing Text Generation with Sentence Selection
We introduce an approach for the answer-aware question generation proble...
research
∙
12/20/2022
Tuning the Tail Latency of Distributed Queries Using Replication
Querying graph data with low latency is an important requirement in appl...
research
∙
10/23/2022
Functional Indirection Neural Estimator for Better Out-of-distribution Generalization
The capacity to achieve out-of-distribution (OOD) generalization is a ha...
research
∙
09/26/2022
Improving Document Image Understanding with Reinforcement Finetuning
Successful Artificial Intelligence systems often require numerous labele...
research
∙
09/21/2022
Momentum Adversarial Distillation: Handling Large Distribution Shifts in Data-Free Knowledge Distillation
Data-free Knowledge Distillation (DFKD) has attracted attention recently...
research
∙
09/15/2022
LAVIS: A Library for Language-Vision Intelligence
We introduce LAVIS, an open-source deep learning library for LAnguage-VI...
research
∙
07/12/2022
Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency
Thorup [FOCS'01, JACM'04] and Klein [SODA'01] independently showed that ...
research
∙
07/05/2022
CodeRL: Mastering Code Generation through Pretrained Models and Deep Reinforcement Learning
Program synthesis or code generation aims to generate a program that sat...
research
∙
06/16/2022
Multimodal Dialogue State Tracking
Designed for tracking user goals in dialogues, a dialogue state tracker ...
research
∙
06/01/2022
OmniXAI: A Library for Explainable AI
We introduce OmniXAI, an open-source Python library of eXplainable AI (X...
research
∙
06/01/2022
HYCEDIS: HYbrid Confidence Engine for Deep Document Intelligence System
Measuring the confidence of AI models is critical for safely deploying A...
research
∙
04/20/2022
Memory-Constrained Policy Optimization
We introduce a new constrained optimization method for policy gradient r...
research
∙
04/17/2022
Learning Theory of Mind via Dynamic Traits Attribution
Machine learning of Theory of Mind (ToM) is essential to build social ag...
research
∙
04/12/2022
Make The Most of Prior Data: A Solution for Interactive Text Summarization with Preference Feedback
For summarization, human preference is critical to tame outputs of the s...
research
∙
03/29/2022
Low Treewidth Embeddings of Planar and Minor-Free Metrics
Cohen-Addad, Filtser, Klein and Le [FOCS'20] constructed a stochastic em...
research
∙
02/24/2022
Towards Effective and Robust Neural Trojan Defenses via Input Filtering
Trojan attacks on deep neural networks are both dangerous and surreptiti...
research
∙
12/16/2021
Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound
In STOC'95 [ADMSS'95] Arya et al. showed that any set of n points in ℝ^d...
research
∙
12/03/2021
Episodic Policy Gradient Training
We introduce a novel training procedure for policy gradient methods wher...
research
∙
11/26/2021
A Unified Framework of Light Spanners II: Fine-Grained Optimality
Seminal works on light spanners over the years provide spanners with opt...
research
∙
11/13/2021
Robust Deep Reinforcement Learning for Extractive Legal Summarization
Automatic summarization of legal texts is an important and still a chall...
research
∙
11/05/2021
Optimal Approximate Distance Oracle for Planar Graphs
A (1+ϵ)-approximate distance oracle of an edge-weighted graph is a data ...
research
∙
11/03/2021
Model-Based Episodic Memory Induces Dynamic Hybrid Controls
Episodic control enables sample efficiency in reinforcement learning by ...
research
∙
08/20/2021
Plug and Play, Model-Based Reinforcement Learning
Sample-efficient generalisation of reinforcement learning approaches hav...
research
∙
07/30/2021
Near-Optimal Spanners for General Graphs in (Nearly) Linear Time
Let G = (V,E,w) be a weighted undirected graph on |V| = n vertices and |...
research
∙
07/29/2021
Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners
Spanners for metric spaces have been extensively studied, both in genera...
research
∙
07/18/2021
A New Representation of Successor Features for Transfer across Dissimilar Environments
Transfer in reinforcement learning is usually achieved through generalis...
research
∙
07/14/2021
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators
The greedy spanner in a low dimensional Euclidean space is a fundamental...
research
∙
07/03/2021
Memory and attention in deep learning
Intelligence necessitates memory. Without memory, humans fail to perform...
research
∙
06/29/2021
Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
Seminal works on light spanners over the years provide spanners with opt...
research
∙
06/16/2021
C^3: Compositional Counterfactual Constrastive Learning for Video-grounded Dialogues
Video-grounded dialogue systems aim to integrate video understanding and...
research
∙
04/16/2021
VGNMN: Video-grounded Neural Module Network to Video-Grounded Language Tasks
Neural module networks (NMN) have achieved success in image-grounded tas...
research
∙
03/01/2021
Learning Reasoning Paths over Semantic Graphs for Video-grounded Dialogues
Compared to traditional visual question answering, video-grounded dialog...
research
∙
01/19/2021
Reliable Spanners: Locality-Sensitive Orderings Strike Back
Chan, Har-Peled, and Jones [2020] recently developed locality-sensitive ...
research
∙
01/04/2021
Clan Embeddings into Trees, and Low Treewidth Graphs
In low distortion metric embeddings, the goal is to embed a host "hard" ...
research
∙
01/01/2021
DVD: A Diagnostic Dataset for Multi-step Reasoning in Video Grounded Dialogue
A video-grounded dialogue system is required to understand both dialogue...
research
∙
10/20/2020
BiST: Bi-directional Spatio-Temporal Reasoning for Video-Grounded Dialogues
Video-grounded dialogues are very challenging due to (i) the complexity ...
research
∙
09/24/2020
