research
∙
08/24/2023
Conditional Kernel Imitation Learning for Continuous State Environments
Imitation Learning (IL) is an important paradigm within the broader rein...
share
research
∙
08/12/2023
Quantum secure non-malleable randomness encoder and its applications
"Non-Malleable Randomness Encoder"(NMRE) was introduced by Kanukurthi, O...
research
∙
08/12/2023
Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum Messages
Non-malleable codes are fundamental objects at the intersection of crypt...
research
∙
05/24/2023
Optimal Control of Logically Constrained Partially Observable and Multi-Agent Markov Decision Processes
Autonomous systems often have logical constraints arising, for example, ...
research
∙
04/11/2023
Exact and Cost-Effective Automated Transformation of Neural Network Controllers to Decision Tree Controllers
Over the past decade, neural network (NN)-based controllers have demonst...
research
∙
04/10/2023
A Novel Point-based Algorithm for Multi-agent Control Using the Common Information Approach
The Common Information (CI) approach provides a systematic way to transf...
research
∙
03/20/2023
Bridging Imitation and Online Reinforcement Learning: An Optimistic Tale
In this paper, we address the following problem: Given an offline demons...
research
∙
02/28/2023
On the geometric thickness of 2-degenerate graphs
A graph is 2-degenerate if every subgraph contains a vertex of degree at...
research
∙
02/21/2023
A note on the partition bound for one-way classical communication complexity
We present a linear program for the one-way version of the partition bou...
research
∙
02/07/2023
Leveraging Demonstrations to Improve Online Learning: Quality Matters
We investigate the extent to which offline demonstration data can improv...
research
∙
02/02/2023
Average-Constrained Policy Optimization
Reinforcement Learning (RL) with constraints is becoming an increasingly...
research
∙
01/27/2023
Safe Posterior Sampling for Constrained MDPs with Bounded Constraint Violation
Constrained Markov decision processes (CMDPs) model scenarios of sequent...
research
∙
11/12/2022
Learning Neuro-symbolic Programs for Language Guided Robot Manipulation
Given a natural language instruction, and an input and an output scene, ...
research
∙
11/03/2022
Matrix Multiplicative Weights Updates in Quantum Zero-Sum Games: Conservation Laws Recurrence
Recent advances in quantum computing and in particular, the introduction...
research
∙
02/27/2022
Quantum secure non-malleable-codes in the split-state model
Non-malleable-codes introduced by Dziembowski, Pietrzak and Wichs [DPW18...
research
∙
01/31/2022
Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints
We study regret minimization for infinite-horizon average-reward Markov ...
research
∙
12/18/2021
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP
We introduce two new no-regret algorithms for the stochastic shortest pa...
research
∙
09/27/2021
Model-Free Reinforcement Learning for Optimal Control of MarkovDecision Processes Under Signal Temporal Logic Specifications
We present a model-free reinforcement learning algorithm to find an opti...
research
∙
09/08/2021
Learning Zero-sum Stochastic Games with Posterior Sampling
In this paper, we propose Posterior Sampling Reinforcement Learning for ...
research
∙
09/07/2021
Online Learning for Cooperative Multi-Player Multi-Armed Bandits
We introduce a framework for decentralized online learning for multi-arm...
research
∙
09/07/2021
Quantum secure non-malleable-extractors
We construct several explicit quantum secure non-malleable-extractors. A...
research
∙
09/04/2021
Dynamic Meta-theorems for Distance and Matching
Reachability, distance, and matching are some of the most fundamental gr...
research
∙
07/24/2021
On relating one-way classical and quantum communication complexities
Let f: X × Y →{0,1,} be a partial function and μ be a distribution with ...
research
∙
06/15/2021
Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path
We introduce a generic template for developing regret minimization algor...
research
∙
06/09/2021
Online Learning for Stochastic Shortest Path Model via Posterior Sampling
We consider the problem of online reinforcement learning for the Stochas...
research
∙
06/08/2021
A direct product theorem for quantum communication complexity with applications to device-independent QKD
We give a direct product theorem for the entanglement-assisted interacti...
research
∙
06/05/2021
Quantum Measurement Adversary
Multi-source-extractors are functions that extract uniform randomness fr...
research
∙
04/22/2021
Optimal communication and control strategies in a multi-agent MDP problem
The problem of controlling multi-agent systems under different models of...
research
∙
04/18/2021
One-shot quantum state redistribution and quantum Markov chains
We revisit the task of quantum state redistribution in the one-shot sett...
research
∙
03/25/2021
Reachability and Matching in Single Crossing Minor Free Graphs
We construct in Logspace non-zero circulations for H-minor free graphs w...
research
∙
02/25/2021
Online Learning for Unknown Partially Observable MDPs
Solving Partially Observable Markov Decision Processes (POMDPs) is hard....
research
∙
01/13/2021
Space-Efficient Algorithms for Reachability in Geometric Graphs
The problem of graph Reachability is to decide whether there is a path f...
research
∙
10/28/2020
Designing Interpretable Approximations to Deep Reinforcement Learning with Soft Decision Trees
In an ever expanding set of research and application areas, deep neural ...
research
∙
09/23/2020
A Sample-Efficient Algorithm for Episodic Finite-Horizon MDP with Constraints
Constrained Markov Decision Processes (CMDPs) formalize sequential decis...
research
∙
08/20/2020
A Direct Product Theorem for One-Way Quantum Communication
We prove a direct product theorem for the one-way entanglement-assisted ...
research
∙
08/17/2020
A near-optimal direct-sum theorem for communication complexity
We show a near optimal direct-sum theorem for the two-party randomized c...
research
∙
07/23/2020
Learning Infinite-horizon Average-reward MDPs with Linear Function Approximation
We develop several new algorithms for learning Markov Decision Processes...
research
∙
06/08/2020
A Model-free Learning Algorithm for Infinite-horizon Average-reward MDPs with Near-optimal Regret
Recently, model-free reinforcement learning has attracted research atten...
research
∙
06/08/2020
Randomized Policy Learning for Continuous State and Action MDPs
Deep reinforcement learning methods have achieved state-of-the-art resul...
research
∙
05/19/2020
Multiple Source Replacement Path Problem
One of the classical line of work in graph algorithms has been the Repla...
research
∙
05/13/2020
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs
A graph separator is a subset of vertices of a graph whose removal divid...
research
∙
10/15/2019
Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processes
Model-free reinforcement learning is known to be memory and computation ...
research
∙
09/02/2019
A Two-Stage Market Mechanism for Electricity with Renewable Generation
We consider a two stage market mechanism for trading electricity includi...
research
∙
02/01/2019
Grid Graph Reachability
The reachability problem is to determine if there exists a path from one...
research
∙
01/31/2019
Reachability in High Treewidth Graphs
Reachability is the problem of deciding whether there is a path from one...
research
∙
01/24/2019
Vision-based Obstacle Removal System for Autonomous Ground Vehicles Using a Robotic Arm
Over the past few years, the use of camera-equipped robotic platforms fo...
research
∙
09/26/2018
A Two Stage Mechanism For Selling Random Power
We present a two stage auction mechanism that renewable generators (or a...
research
∙
09/19/2018
One-shot Capacity bounds on the Simultaneous Transmission of Classical and Quantum Information
We study the communication capabilities of a quantum channel under the m...
research
∙
07/15/2018
Partially smoothed information measures
Smooth entropies are a tool for quantifying resource trade-offs in (quan...
research
∙
04/04/2018
