venue stringclasses 2
values | paper_content stringlengths 7.54k 83.7k | prompt stringlengths 161 2.5k | format stringclasses 5
values | review stringlengths 293 9.84k |
|---|---|---|---|---|
ICLR | Title
Learning Disentangled Representation by Exploiting Pretrained Generative Models: A Contrastive Learning View
Abstract
From the intuitive notion of disentanglement, the image variations corresponding to different factors should be distinct from each other, and the disentangled representation should reflect those v... | 1. What is the focus and contribution of the paper on disentangled directions for pretrained models?
2. What are the strengths of the proposed framework, particularly in terms of its model-agnostic nature and ability to mitigate poor generation quality?
3. What are the weaknesses of the approach, especially regarding t... | Summary Of The Paper
Review | Summary Of The Paper
This paper presents a framework to model disentangled directions for pretrained models. Such an approach mitigates the problems with poor generation quality arising while training models with additional regularization terms to force disentanglement. The underlying idea is contrastive-based: similar... |
ICLR | Title
Learning Disentangled Representation by Exploiting Pretrained Generative Models: A Contrastive Learning View
Abstract
From the intuitive notion of disentanglement, the image variations corresponding to different factors should be distinct from each other, and the disentangled representation should reflect those v... | 1. What is the focus and contribution of the paper on disentanglement?
2. What are the strengths of the proposed approach, particularly in terms of its ability to achieve SOTA results and ensure good generation quality?
3. What are the weaknesses of the paper, especially regarding the proposed method's flaws and the us... | Summary Of The Paper
Review | Summary Of The Paper
This paper proposes DisCo, a framework that learns disentangled representations from pretrained entangled generative models. Extensive experimental results show that DisCo outperforms many baselines in both quantitative and qualitative evaluations.
Review
Pros:
The proposed method is novel and ach... |
ICLR | Title
Learning Disentangled Representation by Exploiting Pretrained Generative Models: A Contrastive Learning View
Abstract
From the intuitive notion of disentanglement, the image variations corresponding to different factors should be distinct from each other, and the disentangled representation should reflect those v... | 1. What is the focus of the paper regarding representation learning?
2. What are the strengths of the proposed method, particularly its simplicity and effectiveness?
3. What are the weaknesses of the paper, such as the lack of explanation for choosing semantically meaningful directions?
4. How does the reviewer assess ... | Summary Of The Paper
Review | Summary Of The Paper
The paper proposes a novel representation learning technique to disentangle the latent space of pre-trained generative models, by discovering semantically meaningful directions in them.
The method trains a navigator and a delta-contrastor network, which consists of 2 encoders sharing weights. First... |
ICLR | Title
Learning Disentangled Representation by Exploiting Pretrained Generative Models: A Contrastive Learning View
Abstract
From the intuitive notion of disentanglement, the image variations corresponding to different factors should be distinct from each other, and the disentangled representation should reflect those v... | 1. What is the focus of the paper regarding disentanglement learning?
2. What are the strengths of the proposed approach, particularly in its simplicity and effectiveness?
3. What are the questions raised by the reviewer regarding the method's application in StyleGAN2?
4. How does the reviewer assess the quality and im... | Summary Of The Paper
Review | Summary Of The Paper
This paper proposes to learn disentangled representations via contrastive learning on well-pretrained generative models. Extensive experiments are conducted on various datasets and the results validate the effectiveness of the method.
Review
Strengths:
Learning disentangled representations via con... |
ICLR | Title
ProMP: Proximal Meta-Policy Search
Abstract
Credit assignment in Meta-reinforcement learning (Meta-RL) is still poorly understood. Existing methods either neglect credit assignment to pre-adaptation behavior or implement it naively. This leads to poor sample-efficiency during metatraining as well as ineffective t... | 1. What are the differences in gradient calculation between the original MAML and E-MAML?
2. How does the proposed new objective and surrogate address the potential error due to auto-differentiation?
3. What is the concern regarding the effect of using (3) compared to (4) in calculating the gradient?
4. Are there any o... | Review | Review
In this paper, the authors investigate the gradient calculation in the original MAML (Finn et al. 2017) and E-MAML (Al-Shedivat et al. 2018). By comparing the differences in the gradients of these two algorithms, the authors demonstrate the advantages of the original MAML in taking the casual dependence into ac... |
ICLR | Title
ProMP: Proximal Meta-Policy Search
Abstract
Credit assignment in Meta-reinforcement learning (Meta-RL) is still poorly understood. Existing methods either neglect credit assignment to pre-adaptation behavior or implement it naively. This leads to poor sample-efficiency during metatraining as well as ineffective t... | 1. What is the focus of the paper regarding meta-reinforcement learning?
2. What are the strengths of the proposed approach in comparison to other methods like MAML, E-MAML-TRPO, LVC-VPG, and DiCE?
3. Do you have any concerns or suggestions regarding the experimental analysis?
4. How does the reviewer assess the signif... | Review | Review
In this paper, the author proposed an efficient surrogate loss for estimating Hessian in the setting of Meta-reinforcement learning (Finn.et al, 2017), which significantly reduce the variance while introducing small bias. The author verified their proposed method with other meta-learning algorithms on the Mujoc... |
ICLR | Title
ProMP: Proximal Meta-Policy Search
Abstract
Credit assignment in Meta-reinforcement learning (Meta-RL) is still poorly understood. Existing methods either neglect credit assignment to pre-adaptation behavior or implement it naively. This leads to poor sample-efficiency during metatraining as well as ineffective t... | 1. What are the main contributions and improvements introduced by the paper regarding MAML and E-MAML?
2. How does the proposed method optimize the objective function, and what is the role of LVC in this process?
3. Can you provide more details about the empirical results shown in Figure 4, and how do they support the ... | Review | Review
The paper first examines the objective function optimized in MAML and E-MAML and interprets the terms as different credit assignment criteria. MAML takes into account the dependences between pre-update trajectory and pre-update policy, post-update trajectory and post-update policy by forcing the gradient of the ... |
ICLR | Title
Putting Theory to Work: From Learning Bounds to Meta-Learning Algorithms
Abstract
Most of existing deep learning models rely on excessive amounts of labeled training data in order to achieve state-of-the-art results, even though these data can be hard or costly to get in practice. One attractive alternative is to... | 1. What is the focus of the reviewed paper regarding meta-learning?
2. What are the concerns regarding the regularization methods proposed in the paper?
3. How do the experimental results compare to other approaches in meta-learning? | Review | Review
########################################################################## Summary:
The paper reviews common assumptions made by recent theoretical analysis of meta-learning and applies them to meta-learning methods as regularization. Results show that these regularization terms improve over vanilla meta-learnin... |
ICLR | Title
Putting Theory to Work: From Learning Bounds to Meta-Learning Algorithms
Abstract
Most of existing deep learning models rely on excessive amounts of labeled training data in order to achieve state-of-the-art results, even though these data can be hard or costly to get in practice. One attractive alternative is to... | 1. What are the limitations of the paper regarding its application of meta-learning theory in few-shot learning?
2. How does the reviewer assess the validity and relevance of the proposed regularizer in improving the model's generalization ability?
3. What are the weaknesses of the paper regarding its comparisons with ... | Review | Review
The main motivation of this paper is based on the theoretical results of meta-learning. To ensure the assumptions of the theories, the authors propose a novel regularizer, which improves the generalization ability of the model. Some results on few-shot learning benchmarks show the proposed method improves w.r.t.... |
ICLR | Title
Putting Theory to Work: From Learning Bounds to Meta-Learning Algorithms
Abstract
Most of existing deep learning models rely on excessive amounts of labeled training data in order to achieve state-of-the-art results, even though these data can be hard or costly to get in practice. One attractive alternative is to... | 1. What are the contributions and novel aspects of the paper regarding meta-learning algorithms?
2. What are the concerns regarding the efficacy of the proposed methods, particularly in experimental results?
3. How could the loss function in Eq. (4) be improved regarding weighting parameters for regularization terms?
4... | Review | Review
To improve the practical performance of meta-learning algorithms, this paper proposes two regularization terms that are motivated by two common assumptions in some recent theoretical work on meta-learning, namely (1) the optimal (linear) predictors cover the embedding space evenly, and (2) the norms of the optim... |
ICLR | Title
Putting Theory to Work: From Learning Bounds to Meta-Learning Algorithms
Abstract
Most of existing deep learning models rely on excessive amounts of labeled training data in order to achieve state-of-the-art results, even though these data can be hard or costly to get in practice. One attractive alternative is to... | 1. What are the strengths and weaknesses of the paper regarding its motivation, organization, experimental setting, and results?
2. How does the reviewer assess the novelty of the second regularization term in the paper?
3. Does the reviewer have any concerns about the applicability of the proposed regularizations when... | Review | Review
Summary: In this paper, the authors aim at bridging the gap between the practice and theory in meta-learning approaches. Specifically, they propose two regularization terms to 1) capture the diversity of the tasks and 2) control the norm of the prediction layer, thereby satisfying the assumptions in meta-learnin... |
ICLR | Title
Localized random projections challenge benchmarks for bio-plausible deep learning
Abstract
Similar to models of brain-like computation, artificial deep neural networks rely on distributed coding, parallel processing and plastic synaptic weights. Training deep neural networks with the error-backpropagation algorit... | 1. What is the focus and contribution of the paper on biologically plausible ANNs?
2. What are the strengths of the proposed approach, particularly in terms of local learning rules and unsupervised learning?
3. What are the limitations of the paper regarding its choice of dataset and architectures?
4. How does the revi... | Review | Review
Summary:
The authors propose a benchmark of biologically plausible ANNs on the MNIST dataset with an emphasis on local learning rules (ruling out backpropagation, and enforcing small receptive fields). They find that random projection (RP) networks provide good performance close to backpropagation and outperform... |
ICLR | Title
Localized random projections challenge benchmarks for bio-plausible deep learning
Abstract
Similar to models of brain-like computation, artificial deep neural networks rely on distributed coding, parallel processing and plastic synaptic weights. Training deep neural networks with the error-backpropagation algorit... | 1. What is the focus of the paper regarding image classification tasks?
2. What are the strengths and weaknesses of the proposed biologically plausible network architecture?
3. How does the reviewer assess the significance and novelty of the work compared to prior research?
4. Are there any concerns regarding the train... | Review | Review
In this work authors benchmark a biologically plausible network architecture for image classification. The employed architecture consists of one hidden layer, where input to hidden layer weights W1 are either trained with PCA or sparse coding, or are kept fixed after random initialization. The output layer units... |
ICLR | Title
Localized random projections challenge benchmarks for bio-plausible deep learning
Abstract
Similar to models of brain-like computation, artificial deep neural networks rely on distributed coding, parallel processing and plastic synaptic weights. Training deep neural networks with the error-backpropagation algorit... | 1. What are the strengths and weaknesses of the paper regarding its contribution to training multi-layer spiking neural networks in a bio-plausible way?
2. How does the reviewer assess the significance of the paper's findings, particularly in comparison to other state-of-the-art and bio-plausible SNNs?
3. What are some... | Review | Review
This article compares different methods to train a two-layer spiking neural network (SNN) in a bio-plausible way on the MNIST dataset, showing that fixed localized random connections that form the hidden layer, in combination with a supervised local learning rule on the output layer can achieve close to state-of... |
ICLR | Title
LEARNING EXECUTION THROUGH NEURAL CODE FUSION
Abstract
As the performance of computer systems stagnates due to the end of Moore’s Law, there is a need for new models that can understand and optimize the execution of general purpose code. While there is a growing body of work on using Graph Neural Networks (GNNs) ... | 1. How does the proposed method improve code representation compared to previous approaches?
2. What is the significance of using assembly code in the graph representation?
3. Can you explain the snapshot mechanism and its role in improving performance?
4. How effective is the proposed method in downstream tasks such a... | Review | Review
The paper proposes using Graph Neural Networks to learn representations of source code and its execution. They test their method on the SPEC CPU benchmark suite and show substantial improvement over methods that do not use execution.
The paper's main question is to answer how to learn code representations. The... |
ICLR | Title
LEARNING EXECUTION THROUGH NEURAL CODE FUSION
Abstract
As the performance of computer systems stagnates due to the end of Moore’s Law, there is a need for new models that can understand and optimize the execution of general purpose code. While there is a growing body of work on using Graph Neural Networks (GNNs) ... | 1. What is the novel improvement in methodology for learning code execution presented in the paper?
2. What are the strengths of the proposed approach, particularly in combining static and dynamic program descriptions?
3. Are there any concerns regarding the fairness of comparison against baselines in the experimental ... | Review | Review
This paper presents a novel improvement in methodology for learning code execution (at the level of branch-predictions and prefetching). They combine static program description with dynamic program state into one graph neural network, for the first time, to achieve significant performance gains on standard benc... |
ICLR | Title
LEARNING EXECUTION THROUGH NEURAL CODE FUSION
Abstract
As the performance of computer systems stagnates due to the end of Moore’s Law, there is a need for new models that can understand and optimize the execution of general purpose code. While there is a growing body of work on using Graph Neural Networks (GNNs) ... | 1. What are the contributions of the paper in using deep learning and GNNs for optimizing code performance?
2. What are the concerns regarding the reasoning behind binary representations being better than categorical or scalar representations?
3. How does the reviewer assess the transfer learning experiments and compar... | Review | Review
Using Deep Learning and especially, GNNs seems to be a popular area of research. I am no
expert at optimizing code performance, so please take my review with a grain of salt. The algorithmic contributions of the paper are as following:
(a) GNN that combines static code and dynamic execution trace.
(b) Binary... |
ICLR | Title
Crafting Data-free Universal Adversaries with Dilate Loss
Abstract
We introduce a method to create Universal Adversarial Perturbations (UAP) for a given CNN in a data-free manner. Data-free approaches suite scenarios where the original training data is unavailable for crafting adversaries. We show that the advers... | 1. What is the focus of the paper, and what are its contributions to the field?
2. How does the proposed approach differ from previous methods, specifically GDUAP?
3. Can you explain the Euclidean norm maximization and its significance in the proposed method?
4. Why did the authors choose to optimize the perturbations ... | Review | Review
The paper is well written and easy to follow. In this paper, a new data-free method is proposed to create universal adversarial perturbation without using data. There are some similarities with GDUAP though, authors also make some crucial improvements. They perform Euclidean norm maximization before the non-line... |
ICLR | Title
Crafting Data-free Universal Adversaries with Dilate Loss
Abstract
We introduce a method to create Universal Adversarial Perturbations (UAP) for a given CNN in a data-free manner. Data-free approaches suite scenarios where the original training data is unavailable for crafting adversaries. We show that the advers... | 1. What is the focus of the paper regarding data-free white-box adversarial attacks?
2. What are the strengths and weaknesses of the proposed method compared to prior works, specifically GDUAP?
3. Do you have any concerns or questions regarding the theoretical analysis and assumptions made in the paper?
4. How does the... | Review | Review
This paper proposed a white-box (known network architecture, known network weight) data free (without need to access the data) adversarial attacking method. The main idea is to find a perturbation that maximizes the activations at different layers jointly. But the optimization is done sequentially, treating each... |
ICLR | Title
Crafting Data-free Universal Adversaries with Dilate Loss
Abstract
We introduce a method to create Universal Adversarial Perturbations (UAP) for a given CNN in a data-free manner. Data-free approaches suite scenarios where the original training data is unavailable for crafting adversaries. We show that the advers... | 1. What are the strengths and weaknesses of the proposed method for generating universal adversarial examples?
2. How does the reviewer assess the quality and reliability of the experimental results presented in the paper?
3. What are the limitations and assumptions made in the paper regarding the data-free approach, a... | Review | Review
The paper proposes a data free method for generating universal adversarial examples. Their method finds an input that maximizes the output of each layer by maximizing the dilation loss. They gave a well motivated derivation going from the data matrix, the data mean and to data free. The experiments results seems... |
ICLR | Title
Crafting Data-free Universal Adversaries with Dilate Loss
Abstract
We introduce a method to create Universal Adversarial Perturbations (UAP) for a given CNN in a data-free manner. Data-free approaches suite scenarios where the original training data is unavailable for crafting adversaries. We show that the advers... | 1. What is the focus and contribution of the paper regarding universal adversarial perturbations?
2. What are the strengths and weaknesses of the proposed method compared to prior works like GDUAP?
3. Do you have any concerns about the theoretical analysis and its assumptions?
4. How does the reviewer assess the clarit... | Review | Review
Summary:
This paper proposed a method to generate universal adversarial perturbations without training data. This task is timely and practical. The proposed method maximizes the norm of the output before nonlinearity at any layer to craft the universal perturbation. A sequential dilation algorithm is designed to... |
ICLR | Title
Towards Faster and Stabilized GAN Training for High-fidelity Few-shot Image Synthesis
Abstract
Training Generative Adversarial Networks (GAN) on high-fidelity images usually requires large-scale GPU-clusters and a vast number of training images. In this paper, we study the few-shot image synthesis task for GAN wi... | 1. What is the focus of the paper regarding GAN architecture?
2. What are the strengths of the proposed modifications in the GAN architecture?
3. How does the reviewer assess the presentation clarity and significance of the results?
4. What is the suggestion provided by the reviewer to strengthen the paper?
5. What are... | Review | Review
Summary: This paper proposes a lightweight GAN architecture which is tuned for learning generative models in the case where one has access to only a relatively small datasets, as well as a simple autoencoding modification for GAN discriminators to help prevent overfitting and mode collapse. Results are presented... |
ICLR | Title
Towards Faster and Stabilized GAN Training for High-fidelity Few-shot Image Synthesis
Abstract
Training Generative Adversarial Networks (GAN) on high-fidelity images usually requires large-scale GPU-clusters and a vast number of training images. In this paper, we study the few-shot image synthesis task for GAN wi... | 1. What is the focus and contribution of the paper on Generative Adversarial Networks (GANs)?
2. What are the strengths of the proposed architecture, particularly in terms of the skip-layer channel-wise excitation (SLE) modules and the self-supervised discriminator?
3. Do you have any concerns or questions regarding th... | Review | Review
Summary:
This paper introduces a new GAN architecture that targets high resolution generation for small datasets. Two techniques are introduced for this purpose: skip-layer channel-wise excitation (SLE) modules, and regularization of the discriminator via a self-supervised auxiliary task. The proposed architectu... |
ICLR | Title
Towards Faster and Stabilized GAN Training for High-fidelity Few-shot Image Synthesis
Abstract
Training Generative Adversarial Networks (GAN) on high-fidelity images usually requires large-scale GPU-clusters and a vast number of training images. In this paper, we study the few-shot image synthesis task for GAN wi... | 1. What is the main contribution of the paper on training GANs for high-resolution image synthesis with small datasets?
2. What are the strengths of the proposed approach, particularly regarding the SLE module and SS-discriminator?
3. Do you have any concerns or questions regarding the novelty of the proposed technique... | Review | Review
Paper summary
This work studies training GANs on small datasets (in a few-shot setting) for high-resolution image synthesis. To generate high-quality samples with minimum computation cost, and to alleviate overfitting and training instabilities, two techniques are proposed: 1) For the generator the Skip-Layer ch... |
ICLR | Title
Towards Faster and Stabilized GAN Training for High-fidelity Few-shot Image Synthesis
Abstract
Training Generative Adversarial Networks (GAN) on high-fidelity images usually requires large-scale GPU-clusters and a vast number of training images. In this paper, we study the few-shot image synthesis task for GAN wi... | 1. What are the strengths and weaknesses of the proposed framework for unconditional image generation?
2. Do you have any concerns regarding the skip-layer excitation module (SLE)?
3. How does the discriminator contribute to the autoencoding process?
4. Can you provide more details about the experimental setup and resu... | Review | Review
In this paper, the authors introduce a new framework for unconditional image generation. The introduce a skip-layer excitation module (SLE) that allows gradient flow between activations of different spatial size. They also included a discriminator that is forced to autoencode the image. The authors claim that th... |
ICLR | Title
PatchDCT: Patch Refinement for High Quality Instance Segmentation
Abstract
High-quality instance segmentation has shown emerging importance in computer vision. Without any refinement, DCT-Mask directly generates high-resolution masks by compressed vectors. To further refine masks obtained by compressed vectors, w... | 1. What is the focus and contribution of the paper on instance segmentation?
2. What are the strengths of the proposed approach, particularly in its patch-based refinement mechanism?
3. What are the weaknesses of the paper regarding its claims and comparisons with other works?
4. How does the reviewer assess the clarit... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
The paper proposes PatchDCT for high-quality instance segmentation. Different from DCT-Mask, the whole image mask is divided into different patches. Each patch is refined individually by the classifier and regressor. The refinement is performed in a multi-stage. Improvements on mask quality are obs... |
ICLR | Title
PatchDCT: Patch Refinement for High Quality Instance Segmentation
Abstract
High-quality instance segmentation has shown emerging importance in computer vision. Without any refinement, DCT-Mask directly generates high-resolution masks by compressed vectors. To further refine masks obtained by compressed vectors, w... | 1. What is the focus and contribution of the paper regarding semantic correspondence?
2. What are the strengths of the proposed approach, particularly in terms of neural representation?
3. What are the weaknesses of the paper, especially for the experiment section?
4. Do you have any concerns about the semantic corresp... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
The paper proposes a DCT-vector-based multi-stage refinement framework named PatchDCT, which contains a classifier and a regressor. PatchDCT first separates the original coarse mask into several patches. The classifier is used to distinguish mixed patches which consist of both foreground and backgr... |
ICLR | Title
PatchDCT: Patch Refinement for High Quality Instance Segmentation
Abstract
High-quality instance segmentation has shown emerging importance in computer vision. Without any refinement, DCT-Mask directly generates high-resolution masks by compressed vectors. To further refine masks obtained by compressed vectors, w... | 1. What is the main contribution of the paper in instance segmentation?
2. What are the strengths of the proposed approach, particularly in its extension from image-level to patch-level?
3. How does the reviewer assess the clarity, quality, novelty, and reproducibility of the paper's content?
4. Are there any relevant ... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper is focused on instance segmentation. Baseline method applise Discrete Cosine Transform to improve the segmentation quality around the object boundary. This paper extends DCT-Mask from image-level to patch-level. Through Figure 4 we could see the quality improvement visually.
Strengths A... |
ICLR | Title
PatchDCT: Patch Refinement for High Quality Instance Segmentation
Abstract
High-quality instance segmentation has shown emerging importance in computer vision. Without any refinement, DCT-Mask directly generates high-resolution masks by compressed vectors. To further refine masks obtained by compressed vectors, w... | 1. What is the focus and contribution of the paper regarding semantic correspondence?
2. What are the strengths of the proposed approach, particularly in terms of neural representation?
3. What are the weaknesses of the paper, especially for the experiment section?
4. Do you have any concerns about the semantic corresp... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
The paper adds a patching technique to the DCT-Mask model and adopts a refinement technique for each patch, so that high-resolution masks can be achieved. The patching technique can produce better boundaries compared to the DCT mask model itself as element changes for DCT vectors can be limited to ... |
ICLR | Title
Multi-Agent Sequential Decision-Making via Communication
Abstract
Communication helps agents to obtain information about others so that better coordinated behavior can be learned. Some existing work communicates predicted future trajectory with others, hoping to get clues about what others would do for better coo... | 1. What is the focus of the paper regarding multi-agent communication schemes?
2. What are the strengths and weaknesses of the proposed approach, particularly in its setting and comparisons with other works?
3. How does the reviewer assess the clarity, quality, novelty, and reproducibility of the paper's content? | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
Summary
The paper presents SeqComm, a multi-agent communication scheme allowing agents to condition on one another's actions by imposing ordering over the agents. The paper introduces multi-agent sequential decision and demonstrates that ordering in this paradigm can affect the optimality of the le... |
ICLR | Title
Multi-Agent Sequential Decision-Making via Communication
Abstract
Communication helps agents to obtain information about others so that better coordinated behavior can be learned. Some existing work communicates predicted future trajectory with others, hoping to get clues about what others would do for better coo... | 1. What is the main contribution of the paper in multi-agent reinforcement learning?
2. What are the strengths and weaknesses of the proposed sequential communication framework?
3. How does the reviewer assess the clarity, quality, novelty, and reproducibility of the paper's content?
4. What are the concerns regarding ... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
Authors present a sequential communication framework to address the relative overgeneralization problem in multi-agent reinforcement learning and test it against a number of communication-free and communication-based baselines. Performance figures drawn against the number of training steps show hig... |
ICLR | Title
Multi-Agent Sequential Decision-Making via Communication
Abstract
Communication helps agents to obtain information about others so that better coordinated behavior can be learned. Some existing work communicates predicted future trajectory with others, hoping to get clues about what others would do for better coo... | 1. What is the focus of the paper in cooperative multi-agent reinforcement learning?
2. What are the strengths of the proposed approach, particularly regarding its theoretical analysis and performance improvement?
3. Do you have any concerns or suggestions regarding the paper's title and its representation of the main ... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
The paper proposes a novel communication scheme, Sequential Communication (SeqComm), for cooperative multi-agent reinforcement learning (MARL). In communication for cooperation in MARL, circular dependencies can sometimes occur. This is caused by synchronization in communication. The proposed model... |
ICLR | Title
Multi-Agent Sequential Decision-Making via Communication
Abstract
Communication helps agents to obtain information about others so that better coordinated behavior can be learned. Some existing work communicates predicted future trajectory with others, hoping to get clues about what others would do for better coo... | 1. What is the focus and contribution of the paper on multiagent POMDP?
2. What are the strengths of the proposed approach, particularly in terms of communication mechanism?
3. What are the weaknesses of the paper regarding the comparison with other works and the advantage of the proposed approach?
4. How does the revi... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
The paper studies a multiagent POMDP and proposes a communication mechanism for the agents to exchange information about their decision-making. In the process, the agents have the same objective, aiming to find a joint policy that maximizes their utility. The authors introduced a communication mech... |
ICLR | Title
CO2: Consistent Contrast for Unsupervised Visual Representation Learning
Abstract
Contrastive learning has been adopted as a core method for unsupervised visual representation learning. Without human annotation, the common practice is to perform an instance discrimination task: Given a query image crop, this task... | 1. What is the focus of the paper regarding self-supervised visual representation learning?
2. What is the novelty of the proposed approach, particularly in combining consistency regularization loss with the standard instance discrimination loss?
3. How does the reviewer assess the significance and impact of the paper'... | Review | Review
This paper proposes to add a new consistency loss term to the momentum contrast (MoCo) framework for self-supervised visual representation learning. A common strategy for self-supervised learning, employed by MoCo as well as others, is to learn invariance to a class of transforms. Here, a deep network is trained... |
ICLR | Title
CO2: Consistent Contrast for Unsupervised Visual Representation Learning
Abstract
Contrastive learning has been adopted as a core method for unsupervised visual representation learning. Without human annotation, the common practice is to perform an instance discrimination task: Given a query image crop, this task... | 1. What is the main contribution of the paper?
2. How does the reviewer assess the technical novelty of the proposed approach?
3. What are the strengths and weaknesses of the experimental evaluation?
4. Does the reviewer think the proposed method is generally applicable to other contrastive learning methods?
5. What is... | Review | Review
This paper addresses the problem of unsupervised contrastive learning for visual representation. Its key idea is to use a consistency regularization method to resolve the issue of one-hot labels for instance discrimination on which most previous work have relied. The proposed CO2 method is implemented on top of ... |
ICLR | Title
CO2: Consistent Contrast for Unsupervised Visual Representation Learning
Abstract
Contrastive learning has been adopted as a core method for unsupervised visual representation learning. Without human annotation, the common practice is to perform an instance discrimination task: Given a query image crop, this task... | 1. What is the main contribution of the paper, and how does it extend existing contrastive loss functions?
2. How effective is the proposed method in improving performance compared to previous approaches, especially in transfer learning tasks?
3. What are the strengths and weaknesses of the paper regarding its novelty,... | Review | Review
Summary This paper proposes an extension, coined as CO2, to InfoNCE contrastive loss used in semi/unsupervised methods. CO2 is based on the premise that the query-negative crop similarity distribution and positive-negative crop similarity distribution should be alike. The proposed method yields significant impro... |
ICLR | Title
CO2: Consistent Contrast for Unsupervised Visual Representation Learning
Abstract
Contrastive learning has been adopted as a core method for unsupervised visual representation learning. Without human annotation, the common practice is to perform an instance discrimination task: Given a query image crop, this task... | 1. What is the focus of the paper regarding unsupervised visual representation learning?
2. What is the proposed method for contrastive regularization, and how does it differ from clustering-based methods?
3. How does the performance of the proposed method compare to MoCo and MoCo v2?
4. Why was symmetric KD divergence... | Review | Review
##########################################################################
Summary:
This paper proposed a consistency regularization for unsupervised visual representation learning. This paper argues that the instance discrimination task performed by most contrastive learning methods merely uses one-hot labels, ... |
ICLR | Title
Domain Adversarial Training: A Game Perspective
Abstract
The dominant line of work in domain adaptation has focused on learning invariant representations using domain-adversarial training. In this paper, we interpret this approach from a game theoretical perspective. Defining optimal solutions in domain-adversari... | 1. What is the main contribution of the paper in the context of unsupervised domain adaptation?
2. What is the significance of the game-theoretical formulation proposed in the paper?
3. What are the strengths and weaknesses of the paper regarding its experimental results and practical implications?
4. How does the revi... | Summary Of The Paper
Review | Summary Of The Paper
The setting in the paper is the classic unsupervised domain adaptation problem, where we are given a labeled sample from a source distribution and an unlabeled sample from a target distribution. The goal is to minimize the risk on the target distribution. Theoretical results led to a breakthrough i... |
ICLR | Title
Domain Adversarial Training: A Game Perspective
Abstract
The dominant line of work in domain adaptation has focused on learning invariant representations using domain-adversarial training. In this paper, we interpret this approach from a game theoretical perspective. Defining optimal solutions in domain-adversari... | 1. What is the focus of the paper regarding domain-adversarial training?
2. What are the strengths of the proposed approach, especially in terms of game theory and numerical analysis?
3. Do you have any concerns or questions regarding the novelty and impact of the work in the field of domain-adversarial learning?
4. Ho... | Summary Of The Paper
Review | Summary Of The Paper
The authors exhibit a strong link between game theory and domain-adversarial training. They show the optimal point in the latter is a Nash equilibrium of a three players game. From this perspective, the authors show that standard approaches, like gradient descent, cannot work in this setting as the... |
ICLR | Title
Domain Adversarial Training: A Game Perspective
Abstract
The dominant line of work in domain adaptation has focused on learning invariant representations using domain-adversarial training. In this paper, we interpret this approach from a game theoretical perspective. Defining optimal solutions in domain-adversari... | 1. What is the focus of the paper regarding adversarial domain learning?
2. What are the issues with the standard optimization method in DAL according to the review?
3. How does the proposed ODE method improve the transfer performance and reduce the number of training iterations?
4. What is the concern regarding the eq... | Summary Of The Paper
Review | Summary Of The Paper
This paper analyzes adversarial domain learning (DAL) from a game-theoretical perspective, where the optimal condition is defined as obtaining the local Nash equilibrium. From this view, the authors show that the standard optimization method in DAL can violate the asymptotic guarantees of the gradi... |
ICLR | Title
Domain Adversarial Training: A Game Perspective
Abstract
The dominant line of work in domain adaptation has focused on learning invariant representations using domain-adversarial training. In this paper, we interpret this approach from a game theoretical perspective. Defining optimal solutions in domain-adversari... | 1. What is the focus of the paper regarding adversarial domain adaptation training?
2. What are the strengths of the proposed approach, particularly in its theoretical analysis and novelty?
3. What are the weaknesses of the paper, especially regarding its limitations in practical applications?
4. How does the reviewer ... | Summary Of The Paper
Review | Summary Of The Paper
This manuscript considers the adversarial domain adaptation training problem, specifically the gradient reversal method, from the perspective of game theory. The authors show that gradient-based optimizers without an upper bound on the learning rate violate asymptotic convergence guarantees to loca... |
ICLR | Title
Prototype Based Classification from Hierarchy to Fairness
Abstract
Artificial neural nets can represent and classify many types of high-dimensional data but are often tailored to particular applications – e.g., for “fair” or “hierarchical” classification. Once an architecture has been selected, it is often diffic... | 1. What is the focus and contribution of the paper regarding prototypical classification networks?
2. What are the strengths and weaknesses of the proposed approach compared to prior works, specifically Li et al. 2018?
3. How does the reviewer assess the clarity and quality of the paper's content, particularly in the w... | Summary Of The Paper
Review | Summary Of The Paper
The paper builds on prior work on prototypical classification networks (more specifically, the work of Li et al. 2018) and additionally tries to include criteria such as orthogonality to enable applications such as fair classification. An application to hierarchical networks is also described thoug... |
ICLR | Title
Prototype Based Classification from Hierarchy to Fairness
Abstract
Artificial neural nets can represent and classify many types of high-dimensional data but are often tailored to particular applications – e.g., for “fair” or “hierarchical” classification. Once an architecture has been selected, it is often diffic... | 1. What is the focus and contribution of the paper on hierarchical and fair classification?
2. What are the strengths of the proposed approach, particularly in terms of concept subspaces?
3. Do you have any concerns or questions regarding the definition and implementation of concept subspaces?
4. How does the reviewer ... | Summary Of The Paper
Review | Summary Of The Paper
The authors propose a novel model — called Concept Subspace Network (CSN) — for both hierarchical and fair classification. The idea behind the network is to use sets of prototypes to define concept subspaces in the latent space defined by the neural network itself. The relationships between the sub... |
ICLR | Title
Prototype Based Classification from Hierarchy to Fairness
Abstract
Artificial neural nets can represent and classify many types of high-dimensional data but are often tailored to particular applications – e.g., for “fair” or “hierarchical” classification. Once an architecture has been selected, it is often diffic... | 1. What is the main contribution of the paper regarding prototype-based representation?
2. What are the strengths and weaknesses of the proposed approach, particularly in terms of its application in fairness and hierarchical classification?
3. Do you have any questions or concerns about the motivation behind the paper,... | Summary Of The Paper
Review | Summary Of The Paper
This paper proposed a framework (that authors called the concept subspace network) using prototype-based representation controlling the alignment between two subspaces for the purpose of the classifier (fair or hierarch classification).
Review
Strength:
The paper proposed a new prototype-based app... |
ICLR | Title
Prototype Based Classification from Hierarchy to Fairness
Abstract
Artificial neural nets can represent and classify many types of high-dimensional data but are often tailored to particular applications – e.g., for “fair” or “hierarchical” classification. Once an architecture has been selected, it is often diffic... | 1. What is the main contribution of the paper regarding prototype-based classification?
2. How does the proposed approach support class hierarchies and fairness?
3. What are the strengths and weaknesses of the paper, particularly in terms of its connection to various concepts and experimental material?
4. How does the ... | Summary Of The Paper
Review | Summary Of The Paper
The present paper proposes a novel architecture for prototype-based classification to support class hierarchies and fairness. In particular, hierarchies are supported by training the model for multiple classification problems jointly, each in its own subspace of the feature space, spanned by the re... |
ICLR | Title
Frequency Decomposition in Neural Processes
Abstract
Neural Processes are a powerful tool for learning representations of function spaces purely from examples, in a way that allows them to perform predictions at test time conditioned on so-called context observations. The learned representations are finite-dimens... | 1. What are the main contributions and key findings of the paper regarding Neural Processes?
2. How do the authors infer a maximum theoretical upper bound of frequencies of functions f that can be used to represent the points, based on signal theoretic aspects of discretization?
3. How do the authors use simulations to... | Review | Review
The work examines properties of Neural Processes (NP). More precisely, of deterministic NPs and how they for finite-dimensional representations of infinite-dimensional function spaces. NP learn functions f that best represent/fit discrete sets of points in space. Based on signal theoretic aspects of discretisati... |
ICLR | Title
Frequency Decomposition in Neural Processes
Abstract
Neural Processes are a powerful tool for learning representations of function spaces purely from examples, in a way that allows them to perform predictions at test time conditioned on so-called context observations. The learned representations are finite-dimens... | 1. What are the limitations of the experimental approach used in the paper?
2. How does the paper contribute to the understanding of neural processes in the frequency domain?
3. What are the implications of the paper's findings for the broader field of machine learning?
4. Are there any potential applications or use ca... | Review | Review
The paper tries to analyze the behavior of Neural Processes in the frequency domain and concludes that such Processes can only represent oscillations up to a certain frequency.
While drawing a parallel between Neural Processes and signal processes, I think that there is some weakness in the experiments of the pa... |
ICLR | Title
Frequency Decomposition in Neural Processes
Abstract
Neural Processes are a powerful tool for learning representations of function spaces purely from examples, in a way that allows them to perform predictions at test time conditioned on so-called context observations. The learned representations are finite-dimens... | 1. What is the focus of the paper, and how does it contribute to understanding Neural Processes?
2. What are the strengths and weaknesses of the paper's empirical observations?
3. Do you have any concerns regarding the main claims of the paper, particularly about the "frequency decomposition" observation and the theore... | Review | Review
This paper addresses an interesting and timely problem, which is to understand how Neural Processes work to learn a representation of a function space. Offering a closer investigation into a recently introduced framework, this work will likely be of interest to the ICLR community. The work focuses on the 1-dimen... |
ICLR | Title
Frequency Decomposition in Neural Processes
Abstract
Neural Processes are a powerful tool for learning representations of function spaces purely from examples, in a way that allows them to perform predictions at test time conditioned on so-called context observations. The learned representations are finite-dimens... | 1. What is the main contribution of the paper regarding neural processes in signal processing?
2. What are the weaknesses of the paper, particularly in its analysis and experimental design?
3. Do you have any concerns about the definitions and terminology used in the paper?
4. How does the reviewer assess the clarity a... | Review | Review
This paper presents an analysis on the neural processes in the signal processing point of view and gives a bound on the highest frequency of the function that a neural process can represent.
I recommend to reject this manuscript. My comments are below.
The key point of this work is Theorem 3.1. However the theor... |
ICLR | Title
Learning A Minimax Optimizer: A Pilot Study
Abstract
Solving continuous minimax optimization is of extensive practical interest, yet notoriously unstable and difficult. This paper introduces the learning to optimize (L2O) methodology to the minimax problems for the first time and addresses its accompanying unique... | 1. What is the main contribution of the paper regarding learning to optimize minimax optimization?
2. What are the strengths of the proposed approach, particularly in its design options and extensions?
3. How does the reviewer assess the novelty and significance of the paper's contributions compared to prior works?
4. ... | Review | Review
This paper studies the learning to optimize (L2O) for minimax optimization. Since L2O has been studied in a few works, extending L2O from continuous minimization to minimax is a straightforward idea and not super-novel. But it also is a non-trivial effort, as minimax problems are much harder and unstable to solv... |
ICLR | Title
Learning A Minimax Optimizer: A Pilot Study
Abstract
Solving continuous minimax optimization is of extensive practical interest, yet notoriously unstable and difficult. This paper introduces the learning to optimize (L2O) methodology to the minimax problems for the first time and addresses its accompanying unique... | 1. What is the main contribution of the paper regarding L2O frameworks?
2. What are the strengths of the proposed minimax L2O design options?
3. What are the weaknesses of the paper, particularly in the theoretical analysis?
4. How does the reviewer assess the convergence guarantees provided by the authors?
5. Do you h... | Review | Review
This paper’s main contribution is to extend the L2O framework to solving minimax problems for the first time.
Minimax optimization is in general unstable and harder to solve, challenging whether an L2O model can indeed figure out effective learning rules from data. Further, in order to design L2O for minimax pro... |
ICLR | Title
Learning A Minimax Optimizer: A Pilot Study
Abstract
Solving continuous minimax optimization is of extensive practical interest, yet notoriously unstable and difficult. This paper introduces the learning to optimize (L2O) methodology to the minimax problems for the first time and addresses its accompanying unique... | 1. What is the focus of the reviewed paper?
2. What are the strengths and weaknesses of the proposed approach compared to traditional methods?
3. How does the reviewer assess the significance of the contributions made by the paper?
4. Are there any concerns regarding the experimental results presented in the paper?
5. ... | Review | Review
Classical iterative minimax optimization algorithms display the unstable dynamics. Their convergence is often sensitive to the parameters and needs to be re-tuned for different problems to ensure convergence. Therefore, there is a practical motivation to develop L2O for minimax problems, so that we could meta-le... |
ICLR | Title
Learning A Minimax Optimizer: A Pilot Study
Abstract
Solving continuous minimax optimization is of extensive practical interest, yet notoriously unstable and difficult. This paper introduces the learning to optimize (L2O) methodology to the minimax problems for the first time and addresses its accompanying unique... | 1. What is the focus of the paper, and what are the author's contributions to the field of minimax problems?
2. What are the strengths of the paper, particularly in terms of its organization and clarity?
3. What are the weaknesses of the paper, regarding the lack of clear motivation, groundbreaking idea, and convincing... | Review | Review
Summary
The paper introduces the learning to optimize (L2O) framework into the solution of minimax problems. The base model is composed of two decoupled LSTMs with a shared objective, with the two LSTMs being respectively responsible for the update of the min and max variables. On top of this, the authors furthe... |
ICLR | Title
C3PO: Learning to Achieve Arbitrary Goals via Massively Entropic Pretraining
Abstract
Given a particular embodiment, we propose a novel method (C3PO) that learns policies able to achieve any arbitrary position and pose. Such a policy would allow for easier control, and would be re-useable as a key building block ... | 1. What is the main contribution of the paper regarding unsupervised reinforcement learning?
2. What are the strengths and weaknesses of the proposed approach, particularly in its comparison to other methods?
3. Do you have any questions or concerns about the methodology, analysis, or results presented in the paper?
4.... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
this paper is proposing a new unsupervised reinforcement learning scheme for being able to train a more taskable agent that can reach a large base of goals in the environment. the motivation for this work is to not only collect the data and have the agent be able to explore but at the same time be ... |
ICLR | Title
C3PO: Learning to Achieve Arbitrary Goals via Massively Entropic Pretraining
Abstract
Given a particular embodiment, we propose a novel method (C3PO) that learns policies able to achieve any arbitrary position and pose. Such a policy would allow for easier control, and would be re-useable as a key building block ... | 1. What is the main contribution of the paper regarding goal-conditioned policy learning?
2. What are the strengths and weaknesses of the proposed method, particularly in its exploration strategy and theoretical analysis?
3. Do you have any concerns or suggestions regarding the comparison with other methods, ablation s... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper presents a method called Entropy-Based Conditioned Continuous Control Policy Optimization (C3PO) that tackles the problem of learning a general goal-conditioned policy in two stages. In the first stage, using an exploration algorithm called ChronoGEM, an exploration dataset consisting of... |
ICLR | Title
C3PO: Learning to Achieve Arbitrary Goals via Massively Entropic Pretraining
Abstract
Given a particular embodiment, we propose a novel method (C3PO) that learns policies able to achieve any arbitrary position and pose. Such a policy would allow for easier control, and would be re-useable as a key building block ... | 1. What is the focus and contribution of the paper regarding exploration methods for simulated environments?
2. What are the strengths and weaknesses of the proposed approach, particularly in terms of its sample efficiency and applicability to various tasks?
3. How does the reviewer assess the clarity, quality, novelty... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
The authors present a method that performs massive uniform exploration of simulated environments and then trains goal-conditioned SAC with an annealed success condition to achieve states discovered during exploration. They demonstrate this exploration procedure to be superior on locomotion environm... |
ICLR | Title
SPC-Net: A New Scalable Point Cloud Compression Framework for Both Machine and Human Vision Tasks
Abstract
Recently, point cloud process and analysis have attracted increasing attention in various machine vision tasks. Therefore, some point cloud compression algorithms are developed. However, such compression alg... | 1. What is the focus of the paper regarding semantic correspondence?
2. What are the strengths and weaknesses of the proposed method in representing semantic correspondence?
3. Do you have any concerns about the representation used in the paper?
4. What are the limitations of the NeMF approach?
5. How does the reviewer... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper proposes to include an octree depth predictor which is a PointNet followed by Gumbel softmax to choose the depth of the octree. This is then used to split the octree index into 2 parts, one for computer vision tasks with presumably smaller depth (coarser compression) and another part for... |
ICLR | Title
SPC-Net: A New Scalable Point Cloud Compression Framework for Both Machine and Human Vision Tasks
Abstract
Recently, point cloud process and analysis have attracted increasing attention in various machine vision tasks. Therefore, some point cloud compression algorithms are developed. However, such compression alg... | 1. What is the main contribution of the paper on point cloud compression?
2. What are the strengths and weaknesses of the proposed method, particularly regarding its impact on downstream machine vision tasks?
3. Do you have any concerns about the claimed contribution and comparisons with other works in the field?
4. Ho... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper proposed a scalable point cloud compression method and aimed to support the machine vision and human vision tasks. The proposed method used fewer points for the machine vision task while the full point cloud is exploit for the final "human" evaluation. This paper proposed a prediction ne... |
ICLR | Title
SPC-Net: A New Scalable Point Cloud Compression Framework for Both Machine and Human Vision Tasks
Abstract
Recently, point cloud process and analysis have attracted increasing attention in various machine vision tasks. Therefore, some point cloud compression algorithms are developed. However, such compression alg... | 1. What is the focus and contribution of the paper on point cloud compression?
2. What are the strengths of the proposed approach, particularly in terms of its application to both machine and human vision tasks?
3. What are the weaknesses of the paper, especially regarding the octree depth level predictor?
4. How does ... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper proposes a new scalable point cloud compression framework for both machine and human vision tasks. Unlike many previous works, this paper considers the purpose of different tasks and the characteristics of different point clouds and designs a new depth level predictor to guide the divisi... |
ICLR | Title
SPC-Net: A New Scalable Point Cloud Compression Framework for Both Machine and Human Vision Tasks
Abstract
Recently, point cloud process and analysis have attracted increasing attention in various machine vision tasks. Therefore, some point cloud compression algorithms are developed. However, such compression alg... | 1. What is the main contribution of the paper on scalable PCC?
2. What are the strengths of the proposed approach, particularly in terms of its application to machine vision tasks?
3. What are the weaknesses of the paper regarding its claims and comparisons with other works?
4. How does the reviewer assess the clarity,... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
The paper presents a scalable PCC framework for both machine vision and human vision tasks. It mainly proposes a novel octree depth level predictor to predict the optimal octree depth used for machine vision tasks. Experimental results demonstrated its superiority compared with the fixed depth leve... |
ICLR | Title
SPC-Net: A New Scalable Point Cloud Compression Framework for Both Machine and Human Vision Tasks
Abstract
Recently, point cloud process and analysis have attracted increasing attention in various machine vision tasks. Therefore, some point cloud compression algorithms are developed. However, such compression alg... | 1. What is the focus and contribution of the paper on point cloud compression?
2. What are the strengths of the proposed approach, particularly in its application to various tasks?
3. What are the weaknesses of the paper, especially regarding its limitation to a single baseline compression approach?
4. How does the rev... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper proposes SPC-NET, a new compression method for point cloud. The paper claims it is the first to address point-cloud compression for both ML tasks and human vision. The key idea of SPC-NET is to train a short neural network to select the octree depth (~= the resolution of the point cloud)... |
ICLR | Title
UNITER: Learning UNiversal Image-TExt Representations
Abstract
Joint image-text embedding is the bedrock for most Vision-and-Language (V+L) tasks, where multimodality inputs are jointly processed for visual and textual understanding. In this paper, we introduce UNITER, a UNiversal Image-TExt Representation, learn... | 1. What is the focus of the paper regarding image-text representations, and what are the strengths and weaknesses of the proposed approach?
2. Are there any concerns regarding the clarity and motivation of certain parts of the method, and how can they be addressed?
3. How does the novelty of the paper compare to prior ... | Review | Review
# 1. Summary
The authors introduce a new pre-training procedure for image-text representations. The idea is to train the model on a huge collection of different image-text datasets and the use the model for downstream tasks. The difference between the proposal wrt the concurrent work is that conditioned masking ... |
ICLR | Title
UNITER: Learning UNiversal Image-TExt Representations
Abstract
Joint image-text embedding is the bedrock for most Vision-and-Language (V+L) tasks, where multimodality inputs are jointly processed for visual and textual understanding. In this paper, we introduce UNITER, a UNiversal Image-TExt Representation, learn... | 1. What are the advantages of using a single-stream transformer over a two-stream transformer?
2. Can the authors provide visualizations of attention weights to help understand the model's behavior?
3. What is the significance of the modification made to the existing pre-training procedure by conditional masking?
4. Ho... | Review | Review
This paper presents a novel method for image-text representations called UNITER. The proposed method has been subsequently tested in many downstream tasks. A detailed ablation study helps to understand the role of each pretrained task in the proposed model.
Although the empirical results are nice, performing th... |
ICLR | Title
UNITER: Learning UNiversal Image-TExt Representations
Abstract
Joint image-text embedding is the bedrock for most Vision-and-Language (V+L) tasks, where multimodality inputs are jointly processed for visual and textual understanding. In this paper, we introduce UNITER, a UNiversal Image-TExt Representation, learn... | 1. What is the focus and contribution of the paper on transformer-based image and text representation?
2. What are the strengths of the proposed approach, particularly in terms of its performance in various tasks?
3. What are the weaknesses of the paper, especially regarding the lack of understanding of the pre-trained... | Review | Review
This is an impressive paper. LIke BERT, it proposes a tranformer based approach to derive a pre-trained network for representing images and texts. The resulting pre-trained network, used in 9 different tasks, advances the SOTA on all the tasks.
The major limitation of this paper is why. Why does it happen? How ... |
ICLR | Title
An evaluation of quality and robustness of smoothed explanations
Abstract
Explanation methods play a crucial role in helping to understand the decisions of deep neural networks (DNNs) to develop trust that is critical for the adoption of predictive models. However, explanation methods are easily manipulated throu... | 1. What are the key contributions and findings of the paper regarding explanation quality and robustness?
2. What are the strengths of the paper in terms of its writing style, approach, and positives?
3. What are the weaknesses of the paper regarding its ability to generalize beyond specific networks and lack of formal... | Summary Of The Paper
Review | Summary Of The Paper
The paper presents experiments for both post-hoc and ad-hoc explainers to better understand their quality and robustness.
Review
The paper touches on a very important problem - the quality and understanding of (smoothed) explanations. It is very well written and an easy to follow.
It has many posi... |
ICLR | Title
An evaluation of quality and robustness of smoothed explanations
Abstract
Explanation methods play a crucial role in helping to understand the decisions of deep neural networks (DNNs) to develop trust that is critical for the adoption of predictive models. However, explanation methods are easily manipulated throu... | 1. What is the main contribution of the paper regarding smoothed attribution methods?
2. What are the strengths and weaknesses of the proposed non-Lp attacks compared to prior works?
3. How does the reviewer assess the choice of Gini Index for evaluating sparsity in attributions?
4. Are there any related works that sho... | Summary Of The Paper
Review | Summary Of The Paper
The main contributions of this paper are a series of empirical results on smoothed attribution methods that are designed to show several smoothing techniques in the previous literature may produce worse explanations and these smoothing techniques are also not robust to non-Lp attacks.
Review
Stren... |
ICLR | Title
An evaluation of quality and robustness of smoothed explanations
Abstract
Explanation methods play a crucial role in helping to understand the decisions of deep neural networks (DNNs) to develop trust that is critical for the adoption of predictive models. However, explanation methods are easily manipulated throu... | 1. What is the focus of the paper, and what contributions does it make to the field of explainable AI?
2. What are the strengths and weaknesses of the paper regarding its experimental design and evaluation metrics?
3. How does the reviewer assess the quality and robustness of the proposed approaches?
4. What are some c... | Summary Of The Paper
Review | Summary Of The Paper
The authors empirically evaluate the quality and robustness of 3 post-hoc and 2 ad-hoc approaches for robustification of gradient-based attributions under a combination of 3 adversarial attack approaches which they use to target the attributions. They evaluate the robustness via cosine-distance and... |
ICLR | Title
An evaluation of quality and robustness of smoothed explanations
Abstract
Explanation methods play a crucial role in helping to understand the decisions of deep neural networks (DNNs) to develop trust that is critical for the adoption of predictive models. However, explanation methods are easily manipulated throu... | 1. What is the focus of the paper regarding evaluation and explanation approaches?
2. What are the strengths and weaknesses of the paper's experimental analysis?
3. Do you have any concerns about the paper's claims and conclusions?
4. How does the reviewer assess the novelty, significance, technical soundness, clarity,... | Summary Of The Paper
Review | Summary Of The Paper
This paper evaluates the quality and robustness of explanations of three post-hoc smoothing approaches (Smooth Gradient, Uniform Gradient, B-smoothing), and two ad-hoc smoothing approaches (CURE, Adv). It evaluates the quality of explanations based on the model parameter sensitivity, class sensitiv... |
ICLR | Title
On the Necessity of Disentangled Representations for Downstream Tasks
Abstract
A disentangled representation encodes generative factors of data in a separable and compact pattern. Thus it is widely believed that such a representation format benefits downstream tasks. In this paper, we challenge the necessity of d... | 1. What is the main contribution of the paper regarding dimension-wise disentanglement scores and downstream performance?
2. What are the strengths and weaknesses of the paper's investigation of the correlation between disentanglement and downstream performance?
3. How does the reviewer assess the clarity, quality, nov... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper investigates the correlation between dimension-wise disentanglement scores and downstream performance. In particular, it does so when using MLPs or Transformers to perform the task of abstract visual reasoning using the learned representation. After observing a poor correlation on this t... |
ICLR | Title
On the Necessity of Disentangled Representations for Downstream Tasks
Abstract
A disentangled representation encodes generative factors of data in a separable and compact pattern. Thus it is widely believed that such a representation format benefits downstream tasks. In this paper, we challenge the necessity of d... | 1. What is the main contribution of the paper regarding downstream tasks and disentangled representation?
2. What are the strengths of the proposed approach, particularly in terms of experiment design?
3. What are the weaknesses of the paper, especially regarding the inclusion of certain statements and their implicatio... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
The authors call into question the conventional thinking that downstream tasks (the take a representation as input) benefit from a disentangled representation. Their results are that the informativeness of the representation not the disentangled nature of is what results in improved downstream perf... |
ICLR | Title
On the Necessity of Disentangled Representations for Downstream Tasks
Abstract
A disentangled representation encodes generative factors of data in a separable and compact pattern. Thus it is widely believed that such a representation format benefits downstream tasks. In this paper, we challenge the necessity of d... | 1. What is the main contribution of the paper regarding dimension-wise disentangled representations?
2. What are the strengths of the proposed approach, particularly in terms of its ability to challenge the necessity of disentanglement for downstream tasks?
3. What are the weaknesses of the paper, especially regarding ... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper studies dimension-wise disentangled representations for downstream applications. Through extensive experiments, the authors conclude that disentanglement is not a necessity for achieving good performance in downstream tasks, and general-purpose representation learning methods could achie... |
ICLR | Title
On the Necessity of Disentangled Representations for Downstream Tasks
Abstract
A disentangled representation encodes generative factors of data in a separable and compact pattern. Thus it is widely believed that such a representation format benefits downstream tasks. In this paper, we challenge the necessity of d... | 1. What is the main contribution of the paper, and what are the strengths and weaknesses of the proposed approach?
2. What are the concerns regarding the comparison between true disentangled representations and entangled representations learned by a standard VAE?
3. What are the issues with the reporting of accuracy in... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
The paper performs a large scale empirical study to investigate whether disentangled representations provide a clear benefit for the final performance on downstream tasks. First, the ground-truth disentangled representation (normalized true factors) are compared to a rotated version of the same rep... |
ICLR | Title
On the Necessity of Disentangled Representations for Downstream Tasks
Abstract
A disentangled representation encodes generative factors of data in a separable and compact pattern. Thus it is widely believed that such a representation format benefits downstream tasks. In this paper, we challenge the necessity of d... | 1. What is the focus of the paper regarding disentangled representation and downstream tasks?
2. What are the strengths of the proposed approach, particularly in terms of experimental evaluation and informativeness measurement?
3. What are the weaknesses of the paper, especially regarding the comparison between disenta... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper challenges a common belief that a disentangled representation is useful for downstream tasks. Following up Steenkiste et al., 2019 and Locatello et al. 2019b, the authors focused on the informativeness of the representation and its correlation with the performance of downstream tasks.
S... |
ICLR | Title
Class-wise Visual Explanations for Deep Neural Networks
Abstract
Many explainable AI (XAI) methods have been proposed to interpret neural network’s decisions on why they predict what they predict locally through gradient information. Yet, existing works mainly for local explanation lack a global knowledge to show... | 1. What is the main contribution of the paper in terms of learning representations for class explanations?
2. How does the proposed approach differ from other methods such as learning prototypes using auto-encoders or visualizing neurons and layers with tools like Open AI Microscope or Net Dissection?
3. What are the w... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper aims at learning a representation for each class, as a potential explanation - this could be summarized as global explanation for targeted classes - basically segmenting the explanations towards class descriptions.
Strengths And Weaknesses
Unclear how is this different from learning pro... |
ICLR | Title
Class-wise Visual Explanations for Deep Neural Networks
Abstract
Many explainable AI (XAI) methods have been proposed to interpret neural network’s decisions on why they predict what they predict locally through gradient information. Yet, existing works mainly for local explanation lack a global knowledge to show... | 1. What is the main contribution of the paper regarding dataset distillation?
2. What are the strengths and weaknesses of the proposed approach compared to existing techniques?
3. How does the reviewer assess the clarity, quality, novelty, and reproducibility of the paper's content?
4. What are some concerns regarding ... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper proposes to use dataset distillation method to generate a small representative dataset for each class as a visualization and interpretation technique of neural classifiers.
Strengths And Weaknesses
Strengths
This paper is mostly well-written, and the findings in this paper are interesti... |
ICLR | Title
Class-wise Visual Explanations for Deep Neural Networks
Abstract
Many explainable AI (XAI) methods have been proposed to interpret neural network’s decisions on why they predict what they predict locally through gradient information. Yet, existing works mainly for local explanation lack a global knowledge to show... | 1. What is the main contribution of the paper regarding visualization techniques for DNNs?
2. What are the strengths and weaknesses of the proposed approach, particularly in its application in understanding networks and analyzing backdoor training sets?
3. How does the reviewer assess the clarity, quality, novelty, and... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
The paper introduces a novel visualisation of DNNs by learning a small set of training images that leads to a similar set of model weights as those obtained with a full dataset. The demonstrate the utility of this in terms of understanding networks and their classification and particularly in analy... |
ICLR | Title
Class-wise Visual Explanations for Deep Neural Networks
Abstract
Many explainable AI (XAI) methods have been proposed to interpret neural network’s decisions on why they predict what they predict locally through gradient information. Yet, existing works mainly for local explanation lack a global knowledge to show... | 1. What is the focus and contribution of the paper regarding explanation sets?
2. What are the strengths of the proposed approach, particularly in terms of bi-level optimization and imitation learning?
3. What are the weaknesses of the paper, especially regarding quantitative evaluations and comparisons with other work... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper describes a new idea of extracting a class-specific explanation set from the entire training set the set and cast the learning problem into bi-level optimization framework where the inner optimization problem is to find the explanation set and outer optimization problem is to encourage t... |
ICLR | Title
FiD-Light: Efficient and Effective Retrieval-Augmented Text Generation
Abstract
Retrieval-augmented generation models offer many benefits over standalone language models: besides a textual answer to a given query they provide provenance items retrieved from an updateable knowledge base. However, they are also mor... | 1. What is the focus and contribution of the paper on improving the efficiency of the fusion-in-decoder model?
2. What are the strengths of the proposed approach, particularly in terms of its simplicity and effectiveness?
3. What are the weaknesses of the paper, especially regarding some parts that need further clarifi... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
The paper introduces FiD-light, a more efficient variant of the fusion-in-decoder model that maintains/outperforms state-of-the-art performances on the KILT dataset, while drastically increasing the model's efficiency. To achieve this, FiD light compresses the length of input vectors and uses re-ra... |
ICLR | Title
FiD-Light: Efficient and Effective Retrieval-Augmented Text Generation
Abstract
Retrieval-augmented generation models offer many benefits over standalone language models: besides a textual answer to a given query they provide provenance items retrieved from an updateable knowledge base. However, they are also mor... | 1. What are the key contributions and strengths of the paper regarding the modified FID model?
2. What are the weaknesses and limitations of the paper, particularly in terms of clarity and reproducibility?
3. How does the reviewer assess the novelty and experimental value of the proposed modifications?
4. What are the ... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper modifies two aspects of the FID model (retrieval-augmented text generation) in section 3: (1) the authors truncate the passages to speed up the model (2) they modify the explainability component by using a ranking task. Results on KILT show a substantial improvement over the FID model.
... |
ICLR | Title
FiD-Light: Efficient and Effective Retrieval-Augmented Text Generation
Abstract
Retrieval-augmented generation models offer many benefits over standalone language models: besides a textual answer to a given query they provide provenance items retrieved from an updateable knowledge base. However, they are also mor... | 1. What is the focus of the paper regarding improving Fusion-in-decoder's effectiveness and efficiency?
2. What are the strengths of the proposed approach, particularly its simplicity and empirical usefulness?
3. What are the weaknesses of the paper, such as the concern about exaggerated time complexity and lack of dis... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper proposes an extension of Fusion-in-decoder for improving both the effectiveness and efficiency. To improve the efficiency, noting that the decoding step occupies most of the time complexity, the method proposes a “selection-based compression” of the encoded representations, denoted as Fi... |
ICLR | Title
Few-Shot Domain Adaptation For End-to-End Communication
Abstract
The problem of end-to-end learning of a communication system using an autoencoder – consisting of an encoder, channel, and decoder modeled using neural networks – has recently been shown to be an effective approach. A challenge faced in the practica... | 1. What is the focus and contribution of the paper regarding domain adaptation in generative learnt channel models?
2. What are the strengths of the proposed approach, particularly in its extensive evaluation, motivation, and insightfulness?
3. What are the concerns or weaknesses of the paper, such as the claim of obta... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
The paper addresses the problem of handling domain-shifts that arises in generative learnt channel models in E2E communication systems in a few-shot setting.
The proposed domain adaptation approach is tailored around a Mixture Density Network (MDN) representing the channel model. In here, the appro... |
ICLR | Title
Few-Shot Domain Adaptation For End-to-End Communication
Abstract
The problem of end-to-end learning of a communication system using an autoencoder – consisting of an encoder, channel, and decoder modeled using neural networks – has recently been shown to be an effective approach. A challenge faced in the practica... | 1. What is the focus and contribution of the paper regarding channel changes in communication systems?
2. What are the strengths of the proposed approach, particularly in its application to few-shot domain adaptation?
3. What are the weaknesses of the paper, especially regarding the choice of baselines and evaluation m... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
This paper models the changes of channel in a communication system as a few-shot domain adaptation problem. They employ the Gaussian mixture density network to specifically model the channel and propose a transformation to compensate for changes in the channel distribution. They perform experiments... |
ICLR | Title
Few-Shot Domain Adaptation For End-to-End Communication
Abstract
The problem of end-to-end learning of a communication system using an autoencoder – consisting of an encoder, channel, and decoder modeled using neural networks – has recently been shown to be an effective approach. A challenge faced in the practica... | 1. What is the focus and contribution of the paper regarding few-shot domain adaptation?
2. What are the strengths of the proposed approach, particularly in its organization, demonstration, and assumptions?
3. What are the weaknesses of the paper, especially regarding some confusing aspects and non-self-explanatory fig... | Summary Of The Paper
Strengths And Weaknesses
Clarity, Quality, Novelty And Reproducibility | Summary Of The Paper
In this paper, the authors provide a few-shot domain adaptation method to address the channel distribution changes of communication systems. Specifically, using the properties of Gaussian mixtures, they propose a solid domain adaption process for the generative channel model (MDN). Besides, they pr... |
ICLR | Title
Information Lattice Learning
Abstract
Information Lattice Learning (ILL) is a general framework to learn decomposed representations, called rules, of a signal such as an image or a probability distribution. Each rule is a coarsened signal used to gain some human-interpretable insight into what might govern the na... | 1. What is the main contribution of the paper, and how does it differ from other works in the field?
2. How does the reviewer assess the clarity and accessibility of the paper's content, particularly regarding mathematical definitions and notation?
3. Does the reviewer think that the authors' approach can be simplified... | Review | Review
The authors propose an approach to explain a given signal
ξ
(i.e., some function of interest, such as a 2D image, or a probability distribution) by learning simple "rules" that can accurately reconstruct it. They demonstrate their approach on a music dataset and a chemistry dataset.
I like the authors' introduct... |
ICLR | Title
Information Lattice Learning
Abstract
Information Lattice Learning (ILL) is a general framework to learn decomposed representations, called rules, of a signal such as an image or a probability distribution. Each rule is a coarsened signal used to gain some human-interpretable insight into what might govern the na... | 1. What is the main contribution of the paper, and how does it address the challenges of explainability and generalizability in machine learning?
2. How does the proposed framework differ from existing approaches in terms of its ability to handle small data and provide explanations?
3. Are there any concerns regarding ... | Review | Review
This paper has addressed a very ambitious goal about explainability and generalizability from “small data" by generalizing the information lattice defined by Shannon. The topic of this paper is very significant but there are a few questions that I concern:
The paper has tried to answer some well-known challengin... |
ICLR | Title
Information Lattice Learning
Abstract
Information Lattice Learning (ILL) is a general framework to learn decomposed representations, called rules, of a signal such as an image or a probability distribution. Each rule is a coarsened signal used to gain some human-interpretable insight into what might govern the na... | 1. What is the focus and contribution of the paper on information lattice learning?
2. What are the strengths of the proposed approach, particularly in its application to various domains?
3. What are the weaknesses of the paper, especially regarding the complexity and scalability of the algorithm?
4. Do you have any co... | Review | Review
This paper proposes a novel learning framework called information lattice learning. It is formulated as an optimization problem that finds decomposed hierarchical representations that are efficient in explaining data using a two-phased approach. ILL generalizes Shannon's information lattice and authors demonstra... |
ICLR | Title
Information Lattice Learning
Abstract
Information Lattice Learning (ILL) is a general framework to learn decomposed representations, called rules, of a signal such as an image or a probability distribution. Each rule is a coarsened signal used to gain some human-interpretable insight into what might govern the na... | 1. What is the main contribution of the paper regarding data analysis?
2. What are the strengths and weaknesses of the proposed approach in terms of its generality and interpretability?
3. How does the reviewer assess the significance of the paper's content and its impact on solving the fundamental challenge in summari... | Review | Review
The authors perform a descriptive analysis of data by attempting to identify elements in the partial ordering of all partitions on the data which admit a compact definition. Compact definitions are those that are formed by composition of a small number of predefined (prior) set of mathematical operations. Projec... |
ICLR | Title
Extrapolation and learning equations
Abstract
In classical machine learning, regression is treated as a black box process of identifying a suitable function from a hypothesis set without attempting to gain insight into the mechanism connecting inputs and outputs. In the natural sciences, however, finding an inter... | 1. What are the strengths and weaknesses of the paper's approach to extrapolate a given dataset and predict formulae with naturally occurring functions?
2. How does the proposed method differ from existing methods, and what are the advantages and limitations of incorporating functions with 2 or more inputs?
3. Can you ... | Review | Review
Thank you for an interesting perspective on the neural approaches to approximate physical phenomenon. This paper describes a method to extrapolate a given dataset and predict formulae with naturally occurring functions like sine, cosine, multiplication etc. ... |
ICLR | Title
Extrapolation and learning equations
Abstract
In classical machine learning, regression is treated as a black box process of identifying a suitable function from a hypothesis set without attempting to gain insight into the mechanism connecting inputs and outputs. In the natural sciences, however, finding an inter... | 1. What is the focus of the paper regarding physical systems and analytical equations?
2. What are the strengths and weaknesses of the proposed approach in terms of scalability and complexity?
3. How does the reviewer assess the contribution and novelty of the paper's content?
4. What are some concerns regarding the to... | Review | Review
The authors attempt to extract analytical equations governing physical systems from observations - an important task. Being able to capture succinct and interpretable rules which a physical system follows is of great importance. However, the authors do this with simple and naive tools which will not scale to com... |
ICLR | Title
Extrapolation and learning equations
Abstract
In classical machine learning, regression is treated as a black box process of identifying a suitable function from a hypothesis set without attempting to gain insight into the mechanism connecting inputs and outputs. In the natural sciences, however, finding an inter... | 1. What is the focus and contribution of the paper regarding transfer learning and extrapolation?
2. What are the strengths of the proposed EQL model, particularly in terms of its ability to capture system dynamics and interpretability?
3. Do you have any concerns or questions about the multiplication units used in the... | Review | Review
Thank you for an interesting read.
To my knowledge, very few papers have looked at transfer learning with **no** target domain data (the authors called this task as "extrapolation"). This paper clearly shows that the knowledge of the underlying system dynamics is crucial in this case. The experiments clearly s... |
ICLR | Title
Variational Lossy Autoencoder
Abstract
Representation learning seeks to expose certain aspects of observed data in a learned representation that’s amenable to downstream tasks like classification. For instance, a good representation for 2D images might be one that describes only global structure and discards info... | 1. What is the focus of the paper regarding Variational Autoencoders?
2. What are the strengths of the proposed approach, particularly in understanding the latent code?
3. Do you have concerns about the proposed approaches to force the latent variables' use?
4. How does the reviewer assess the clarity and quality of th... | Review | Review
This paper proposes a Variational Autoencoder model that can discard information found irrelevant, in order to learn interesting global representations of the data. This can be seen as a lossy compression algorithm, hence the name Variational Lossy Autoencoder. To achieve such model, the authors combine VAEs wit... |
ICLR | Title
Variational Lossy Autoencoder
Abstract
Representation learning seeks to expose certain aspects of observed data in a learned representation that’s amenable to downstream tasks like classification. For instance, a good representation for 2D images might be one that describes only global structure and discards info... | 1. What is the main contribution of the paper, and how does it relate to VAE-type models?
2. What are the strengths and weaknesses of the proposed approach, particularly regarding its information-theoretical insight and empirical evaluation?
3. How does the paper address the question of whether a latent representation ... | Review | Review
This paper introduces the notion of a "variational lossy autoencoder", where a powerful autoregressive conditional distribution on the inputs x given the latent code z is crippled in a way that forces it to use z in a meaningful way. Its three main contributions are:
(1) It gives an interesting information-theo... |
ICLR | Title
Variational Lossy Autoencoder
Abstract
Representation learning seeks to expose certain aspects of observed data in a learned representation that’s amenable to downstream tasks like classification. For instance, a good representation for 2D images might be one that describes only global structure and discards info... | 1. What is the main contribution of the paper, and how does it combine different techniques?
2. What are the strengths of the paper in terms of its insights and results?
3. Are there any novel aspects or ideas introduced by the paper?
4. How does the reviewer assess the significance and impact of the paper's contributi... | Review | Review
This paper motivates the combination of autoregressive models with Variational Auto-Encoders and how to control the amount the amount of information stored in the latent code. The authors provide state-of-the-art results on MNIST, OMNIGLOT and Caltech-101.
I find that the insights provided in the paper, e.g. wit... |
ICLR | Title
Variational Lossy Autoencoder
Abstract
Representation learning seeks to expose certain aspects of observed data in a learned representation that’s amenable to downstream tasks like classification. For instance, a good representation for 2D images might be one that describes only global structure and discards info... | 1. What are the strengths and weaknesses of the paper regarding its contributions to improving VAEs?
2. Do you have any concerns or disagreements with the theoretical assumptions made in the paper? If so, what are they?
3. How does the reviewer assess the significance and novelty of the proposed approach compared to ot... | Review | Review
The AR prior and its equivalent - the inverse AR posterior - is one of the more elegant ways to improve the unfortunately poor generative qualities of VAE-s. It is only an incremental but important step. Incremental, because, judging by the lack of, say, CIFAR10 pictures of the VLAE in its "creative" regime ( i.... |
ICLR | Title
Semantic Code Repair using Neuro-Symbolic Transformation Networks
Abstract
We study the problem of semantic code repair, which can be broadly defined as automatically fixing non-syntactic bugs in source code. The majority of past work in semantic code repair assumed access to unit tests against which candidate re... | 1. What is the focus of the paper regarding practical code repair?
2. What are the strengths and weaknesses of the proposed neural network architecture?
3. Do you have any concerns about the scope and limitations of the approach?
4. Are there any questions or issues with the experimental design and comparisons? | Review | Review
This paper presents a neural network architecture consisting of the share, specialize and compete parts for repairing code in four cases, i.e., VarReplace, CompReplace, IsSwap, and ClassMember. Experiments on the source codes from Github are conducted and the performance is evaluated against one sequence-to-sequ... |
ICLR | Title
Semantic Code Repair using Neuro-Symbolic Transformation Networks
Abstract
We study the problem of semantic code repair, which can be broadly defined as automatically fixing non-syntactic bugs in source code. The majority of past work in semantic code repair assumed access to unit tests against which candidate re... | 1. What is the main contribution of the paper regarding code repair using neural networks?
2. What are the strengths of the proposed approach compared to prior sequence-to-sequence models?
3. How effective are the output constraints utilized by the proposed model in improving its performance?
4. Are there any concerns ... | Review | Review
This paper introduces a neural network architecture for fixing semantic bugs in code. Focusing on four specific types of bugs, the proposed two-stage approach first generates a set of candidate repairs and then scores the repair candidates using a neural network trained on synthetically introduced bug/repair ex... |
ICLR | Title
Semantic Code Repair using Neuro-Symbolic Transformation Networks
Abstract
We study the problem of semantic code repair, which can be broadly defined as automatically fixing non-syntactic bugs in source code. The majority of past work in semantic code repair assumed access to unit tests against which candidate re... | 1. What is the main contribution of the paper in terms of the neural network architecture?
2. What are the strengths of the paper regarding its organization, technical description, and problem significance?
3. What are the limitations of the paper regarding the scope of the addressed bug categories?
4. How does the rev... | Review | Review
This paper describes the application of a neural network architecture, called Share, Specialize, and Compete, to the problem of automatically generating big fixes when the bugs fall into 4 specific categories. The approach is validated using both real and injected bugs based on a software corpus of 19,000 github... |
ICLR | Title
Toward Efficient Low-Precision Training: Data Format Optimization and Hysteresis Quantization
Abstract
As the complexity and size of deep neural networks continue to increase, lowprecision training has been extensively studied in the last few years to reduce hardware overhead. Training performance is largely affe... | 1. What are the main contributions of the paper regarding numeric precision for neural network training?
2. What are the strengths of the proposed methods, particularly in dealing with low precision representations?
3. Do you have any concerns or suggestions regarding the paper's content, such as citations, clarity, or... | Summary Of The Paper
Review | Summary Of The Paper
The authors propose 2 impactful methods to aid in the design of numeric precision for neural network training: a method to quickly determine which formats work for weights and activations using angular deviation of gradients between low precision and FP32, and a hysteresis method for dealing with l... |
ICLR | Title
Toward Efficient Low-Precision Training: Data Format Optimization and Hysteresis Quantization
Abstract
As the complexity and size of deep neural networks continue to increase, lowprecision training has been extensively studied in the last few years to reduce hardware overhead. Training performance is largely affe... | 1. What is the focus of the paper regarding quantization methods?
2. What are the strengths of the proposed approach, particularly in terms of error angle estimation and hardware overhead?
3. What are the weaknesses of the paper, especially regarding the magnitude of the error and the choice of FP134?
4. Do you have an... | Summary Of The Paper
Review | Summary Of The Paper
This paper proposes a method to find an optimal quantization format based on error angle estimation and hardware overhead. The authors also present an hysteresis-based quantization method to reduce fluctuation of exponent values such that training (from the scratch) using only 4-bit weights can res... |
ICLR | Title
Toward Efficient Low-Precision Training: Data Format Optimization and Hysteresis Quantization
Abstract
As the complexity and size of deep neural networks continue to increase, lowprecision training has been extensively studied in the last few years to reduce hardware overhead. Training performance is largely affe... | 1. What is the focus and contribution of the paper regarding numeric format optimization?
2. What are the strengths of the proposed approach, particularly in evaluating performance and mitigating fluctuation issues?
3. Do you have any concerns about the proposed metric's advantages compared to other metrics?
4. How doe... | Summary Of The Paper
Review | Summary Of The Paper
The authors propose a method to predict the performance of different numeric formats, which allows determining the optimal data format for various neural network architectures, datasets, and tasks efficiently. By comparing 498 formats in total, the authors find an optimal 8-bit format suitable for ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.