Search Results for author:
Found 17 papers, 8 papers with code
Improving Token-Based World Models with Parallel Observation Prediction
We incorporate POP in a novel TBWM agent named REM (Retentive Environment Model), showcasing a 15. 4x faster imagination compared to prior TBWMs.
C-Procgen: Empowering Procgen with Controllable Contexts
We present C-Procgen, an enhanced suite of environments on top of the Procgen benchmark.
ClassEval: A Manually-Crafted Benchmark for Evaluating LLMs on Class-level Code Generation
Third, we find that generating the entire class all at once (i. e. holistic generation strategy) is the best generation strategy only for GPT-4 and GPT-3. 5, while method-by-method generation (i. e. incremental and compositional) is better strategies for the other models with limited ability of understanding long instructions and utilizing the middle information.
Bring Your Own (Non-Robust) Algorithm to Solve Robust MDPs by Estimating The Worst Kernel
Robust Markov Decision Processes (RMDPs) provide a framework for sequential decision-making that is robust to perturbations on the transition kernel.
An Efficient Solution to s-Rectangular Robust Markov Decision Processes
We present an efficient robust value iteration for \texttt{s}-rectangular robust Markov Decision Processes (MDPs) with a time complexity comparable to standard (non-robust) MDPs which is significantly faster than any existing method.
Reinforcement Learning Enhanced Weighted Sampling for Accurate Subgraph Counting on Fully Dynamic Graph Streams
Specifically, we propose a weighted sampling algorithm called WSD for estimating the subgraph count in a fully dynamic graph stream, which samples the edges based on their weights that indicate their importance and reflect their properties.
Reachability-Aware Laplacian Representation in Reinforcement Learning
In Reinforcement Learning (RL), Laplacian Representation (LapRep) is a task-agnostic state representation that encodes the geometry of the environment.
Policy Gradient for Reinforcement Learning with General Utilities
The policy gradient theorem proves to be a cornerstone in Linear RL due to its elegance and ease of implementability.
Relational Reasoning via Set Transformers: Provable Efficiency and Applications to MARL
The cooperative Multi-A gent R einforcement Learning (MARL) with permutation invariant agents framework has achieved tremendous empirical successes in real-world applications.
Efficient Policy Iteration for Robust Markov Decision Processes via Regularization
But we don't have a clear understanding to exploit this equivalence, to do policy improvement steps to get the optimal value function or policy.
Tyger: Task-Type-Generic Active Learning for Molecular Property Prediction
However, existing best deep AL methods are mostly developed for a single type of learning task (e. g., single-label classification), and hence may not perform well in molecular property prediction that involves various task types.
The Geometry of Robust Value Functions
The key of this perspective is to decompose the value space, in a state-wise manner, into unions of hypersurfaces.
Towards Better Laplacian Representation in Reinforcement Learning with Generalized Graph Drawing
It enables learning high-quality Laplacian representations that faithfully approximate the ground truth.
Improving Generalization in Reinforcement Learning with Mixture Regularization
Deep reinforcement learning (RL) agents trained in a limited set of environments tend to suffer overfitting and fail to generalize to unseen testing environments.
Understanding and Resolving Performance Degradation in Graph Convolutional Networks
In this work, we study performance degradation of GCNs by experimentally examining how stacking only TRANs or PROPs works.
PANet: Few-Shot Image Semantic Segmentation with Prototype Alignment
In this paper, we tackle the challenging few-shot segmentation problem from a metric learning perspective and present PANet, a novel prototype alignment network to better utilize the information of the support set.
Ranked #70 on
Few-Shot Semantic Segmentation
on COCO-20i (5-shot)
Neural Epitome Search for Architecture-Agnostic Network Compression
The recent WSNet [1] is a new model compression method through sampling filterweights from a compact set and has demonstrated to be effective for 1D convolutionneural networks (CNNs).
