review stringlengths 5 16.6k | score stringclasses 5
values | area stringclasses 12
values | text stringlengths 31 5.65k |
|---|---|---|---|
The paper examines data poisoning attacks and defense for joint language-vision model (CLIP) in a retrieval setting. Expanding on Carlini et al. 2022, the authors propose attacks and defenses on both modalities instead of just vision signal and show vulnerability in both.
The paper proposes three attacks, all try to l... | Recommendation: 6: marginally above the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
The paper examines data poisoning attacks and defense for joint language-vision model (CLIP) in a retrieval setting. Expanding on Carlini et al. 2022, the authors propose attacks and defenses on both modalities instead of just vision signal and show vulnerability in both.
The paper proposes three attacks, all ... |
The paper proposes a Blurring Diffusion Model. It is a type of diffusion model based on heat dissipation, or blurring. The model obtains better performance compared with some SOTA models (e.g., Denoising Diffusion, IHDM).
Strength:
(1) It makes sense for combining heat dissipation and blurring into the diffusion model.... | Recommendation: 5: marginally below the acceptance threshold | Area: Generative models | Review:
The paper proposes a Blurring Diffusion Model. It is a type of diffusion model based on heat dissipation, or blurring. The model obtains better performance compared with some SOTA models (e.g., Denoising Diffusion, IHDM).
Strength:
(1) It makes sense for combining heat dissipation and blurring into the diffusio... |
This paper proposed a new pipeline that includes 3 stages for detecting out-of-distribution data. First, a graph is generated for an image by using its output from a pre-trained object-detection network. Secondly, the graph-kernel-based method is used to generate the whole-graph embedding from the graph. Finally, given... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This paper proposed a new pipeline that includes 3 stages for detecting out-of-distribution data. First, a graph is generated for an image by using its output from a pre-trained object-detection network. Secondly, the graph-kernel-based method is used to generate the whole-graph embedding from the graph. Finall... |
This paper considers the optimization of the logistic regression problem with separable data assumption. They observe that when the iteration variable is far from zero, the smoothness parameter decreases (i.e., the function is smoother), which allows more aggressively long step size. They prove the linear convergence o... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper considers the optimization of the logistic regression problem with separable data assumption. They observe that when the iteration variable is far from zero, the smoothness parameter decreases (i.e., the function is smoother), which allows more aggressively long step size. They prove the linear conve... |
This paper presents a novel adversarial framework to train driving policies under learned traffic flow in simulation. It first extends traffic flow learned with reinforcement learning by exposing each other’s intrinsic social value orientations (SVO). Next, it uses this exposed SVO to train adversarial agents as well a... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper presents a novel adversarial framework to train driving policies under learned traffic flow in simulation. It first extends traffic flow learned with reinforcement learning by exposing each other’s intrinsic social value orientations (SVO). Next, it uses this exposed SVO to train adversarial agents a... |
This manuscript introduces a framework to model data generation where the many bias-inducing factors are allowed for an exploration of the bias inheritance mechanism. Through the parametric framework, the authors analyze the data imbalance problem, investigate the various sources of bias, and propose a novel mitigation... | Recommendation: 5: marginally below the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This manuscript introduces a framework to model data generation where the many bias-inducing factors are allowed for an exploration of the bias inheritance mechanism. Through the parametric framework, the authors analyze the data imbalance problem, investigate the various sources of bias, and propose a novel mi... |
This paper studies the covariance structures of each convolution filter in deep learning models for classification problems. It builds a parametric model for these structures and proposes to directly sample a multivariate Gaussian distribution as an initialization for a family of CNNs. Numerical results show that in so... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper studies the covariance structures of each convolution filter in deep learning models for classification problems. It builds a parametric model for these structures and proposes to directly sample a multivariate Gaussian distribution as an initialization for a family of CNNs. Numerical results show th... |
This paper presents an efficient model, PMLP, which achieves the GNN-level generalization and accuracy at the cost of training an MLP (which is much cheaper than training a GNN). Specifically, the training of PMLP is identical to that of a normal MLP, where edge information in the graph is completely ignored. During in... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper presents an efficient model, PMLP, which achieves the GNN-level generalization and accuracy at the cost of training an MLP (which is much cheaper than training a GNN). Specifically, the training of PMLP is identical to that of a normal MLP, where edge information in the graph is completely ignored. D... |
This work is looking into the multi-tenant federated learning problem, which is considering training multiple federated learning tasks at the same time. The goal of this work is to minimize power consumption while maximizing the performance of training results. This work proposes using a multiple-task share-model techn... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This work is looking into the multi-tenant federated learning problem, which is considering training multiple federated learning tasks at the same time. The goal of this work is to minimize power consumption while maximizing the performance of training results. This work proposes using a multiple-task share-mod... |
The paper gives the test risk guarantee on the minimum $\ell_2$ norm zero-loss solution (via combination of Lemma 1 and Theorem 1), which is where overparameterized model converges to via SGD. The bound, when simplified, leads to several interesting observations such as double descent via task diversity. Authors also p... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The paper gives the test risk guarantee on the minimum $\ell_2$ norm zero-loss solution (via combination of Lemma 1 and Theorem 1), which is where overparameterized model converges to via SGD. The bound, when simplified, leads to several interesting observations such as double descent via task diversity. Author... |
The authors present a method to automatically locate referents in scenes using a combination of embodied gesture signals and natural language descriptions. Their key contribution is the implementation of the "virtual touch-line", which is the extended line connecting the eye and the fingertip to localize objects in sce... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The authors present a method to automatically locate referents in scenes using a combination of embodied gesture signals and natural language descriptions. Their key contribution is the implementation of the "virtual touch-line", which is the extended line connecting the eye and the fingertip to localize object... |
This paper presents a multiscale PDE surrogate, where a coarse-grained numerical model and a neural operator are added. The neural operator corrects for the errors which the numerical model makes.
The paper promises grid independent solutions, and quasi-linear runtime complexity.
Learning multiscale PDE surrogates is... | Recommendation: 3: reject, not good enough | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This paper presents a multiscale PDE surrogate, where a coarse-grained numerical model and a neural operator are added. The neural operator corrects for the errors which the numerical model makes.
The paper promises grid independent solutions, and quasi-linear runtime complexity.
Learning multiscale PDE surro... |
In this paper, the mixed-precision layer problem is formulated as a traditional NP hard problem and the problem can be solved by low cost methods without fine-tuning. The experimental results show that the proposed method is better than the current SOTA method.
Strengths:
1. Based on the total differential calculati... | Recommendation: 5: marginally below the acceptance threshold | Area: General Machine Learning | Review:
In this paper, the mixed-precision layer problem is formulated as a traditional NP hard problem and the problem can be solved by low cost methods without fine-tuning. The experimental results show that the proposed method is better than the current SOTA method.
Strengths:
1. Based on the total differential c... |
This paper studies if explicitly modeling the behavior policy is beneficial in offline RL. Focusing on offline RL methods based on value function penalizations, the authors argue that multiple previous methods all design the penalty in a way that reduces the chance of overestimating the value of out-of-support state-ac... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper studies if explicitly modeling the behavior policy is beneficial in offline RL. Focusing on offline RL methods based on value function penalizations, the authors argue that multiple previous methods all design the penalty in a way that reduces the chance of overestimating the value of out-of-support ... |
This paper focuses on addressing the over-reliance on contextual biases, and proposes a new method based on the attention mechanism. It draws inspiration from the causal intervention, and leverages attention together with feature sampling/shuffling to realize the function. Experimental results show that the proposed me... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper focuses on addressing the over-reliance on contextual biases, and proposes a new method based on the attention mechanism. It draws inspiration from the causal intervention, and leverages attention together with feature sampling/shuffling to realize the function. Experimental results show that the pro... |
The paper presents a self-attention based meta learning framework for the learned Gaussian ESs and tests the performance on neuroevolution tasks. The metaBBO module includes steps like Meta-sampling, Inner loop search, meta normalize, and Meta updating. Limited evaluation results on standard datasets were provided.
S... | Recommendation: 6: marginally above the acceptance threshold | Area: General Machine Learning | Review:
The paper presents a self-attention based meta learning framework for the learned Gaussian ESs and tests the performance on neuroevolution tasks. The metaBBO module includes steps like Meta-sampling, Inner loop search, meta normalize, and Meta updating. Limited evaluation results on standard datasets were provi... |
This paper aims to explore the problem of data set imbalance in face identification systems. They specifically focus on imbalance with respect to gender presentation. Aiming at the imbalances(both in terms of identities or images per identity) in the train set and the test set, the author conducted several experiments ... | Recommendation: 3: reject, not good enough | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This paper aims to explore the problem of data set imbalance in face identification systems. They specifically focus on imbalance with respect to gender presentation. Aiming at the imbalances(both in terms of identities or images per identity) in the train set and the test set, the author conducted several expe... |
This article is interested in the so-called "Inversion effect" in human vision: the fact that although humans are as a rule excellent at recognising and discriminating faces, performance falls to very low levels when faces are seen upside down. This is an interesting effect as we are generally apt at recognising object... | Recommendation: 5: marginally below the acceptance threshold | Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces) | Review:
This article is interested in the so-called "Inversion effect" in human vision: the fact that although humans are as a rule excellent at recognising and discriminating faces, performance falls to very low levels when faces are seen upside down. This is an interesting effect as we are generally apt at recognisin... |
This paper use an information-theoretic framework to analyze the generalization ability of hypotheses and
learning algorithm of unsupervised domain adapation problem.
Strength:
1、The authors rigorously prove some generalization error bound. One of the bounds is associated only
with the learning algorithm, which is very... | Recommendation: 8: accept, good paper | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper use an information-theoretic framework to analyze the generalization ability of hypotheses and
learning algorithm of unsupervised domain adapation problem.
Strength:
1、The authors rigorously prove some generalization error bound. One of the bounds is associated only
with the learning algorithm, which... |
This paper investigates an improved version of Chain-of-thought prompting by leveraging self consistency and shows empirical evidence that their self consistency prompting indeed improve reasoning tasks performance compared with the original chain-of-thoguht prompting.
Strength:
1. The self-consistency method is ver... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper investigates an improved version of Chain-of-thought prompting by leveraging self consistency and shows empirical evidence that their self consistency prompting indeed improve reasoning tasks performance compared with the original chain-of-thoguht prompting.
Strength:
1. The self-consistency metho... |
The paper proposes to use an iterative decoding scheme for entropy model based on masked image modeling to improve video compression. This scheme has the advantage that a fixed autoregressive order is not used and thus leading to a better modeling of the latents. Further, SWIN transformer based model is used to improve... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper proposes to use an iterative decoding scheme for entropy model based on masked image modeling to improve video compression. This scheme has the advantage that a fixed autoregressive order is not used and thus leading to a better modeling of the latents. Further, SWIN transformer based model is used to... |
The authors present a meta-learning framework to infer a system's or circuit's inductive bias. In their work, the authors claim that their method connects architectural design choices to function space features. This work demonstrates the usability of the method in inferring the inductive bias for relatively simple mod... | Recommendation: 6: marginally above the acceptance threshold | Area: General Machine Learning | Review:
The authors present a meta-learning framework to infer a system's or circuit's inductive bias. In their work, the authors claim that their method connects architectural design choices to function space features. This work demonstrates the usability of the method in inferring the inductive bias for relatively si... |
This paper proposes to train one-time-step SNNs with a Hoyer regularizer and Hoyer spike layer. The proposed Hoyer spike layer uses adaptive threshold based on the Hoyer extremum of membrane potentials, and a Hoyer regularization for membrane potentials is added in the loss function. Experiments on static image classif... | Recommendation: 5: marginally below the acceptance threshold | Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces) | Review:
This paper proposes to train one-time-step SNNs with a Hoyer regularizer and Hoyer spike layer. The proposed Hoyer spike layer uses adaptive threshold based on the Hoyer extremum of membrane potentials, and a Hoyer regularization for membrane potentials is added in the loss function. Experiments on static image... |
This paper is basically an implementation of the prospective configuration algoithm (Yuhang Song, et al, Inferring neural activity before plasticity: A foundation for learning beyond backpropagation) where each layer of a heirarchical Gaussian generative model (with the further assumption that the covariance matrix of ... | Recommendation: 3: reject, not good enough | Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces) | Review:
This paper is basically an implementation of the prospective configuration algoithm (Yuhang Song, et al, Inferring neural activity before plasticity: A foundation for learning beyond backpropagation) where each layer of a heirarchical Gaussian generative model (with the further assumption that the covariance ma... |
The paper proposes a new method to build robust FL. The paper performs theoretical analysis and evaluation on multiple datasets and baselines.
Strength
+ A new robust FL method is proposed.
+ Theoretical analysis is performed on the proposed method to show its robustness.
Weakness
- Some baseline attacks are not... | Recommendation: 6: marginally above the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
The paper proposes a new method to build robust FL. The paper performs theoretical analysis and evaluation on multiple datasets and baselines.
Strength
+ A new robust FL method is proposed.
+ Theoretical analysis is performed on the proposed method to show its robustness.
Weakness
- Some baseline attacks... |
This paper focuses on the analysis of hyperparameters in binary neural networks (BNN). The hyperparameters could explain the BNNs with latent real-valued weights during training. However, the magnitude of binary weights is not interpretable with these hyperparameters yet. This paper provides an interpretation of these ... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper focuses on the analysis of hyperparameters in binary neural networks (BNN). The hyperparameters could explain the BNNs with latent real-valued weights during training. However, the magnitude of binary weights is not interpretable with these hyperparameters yet. This paper provides an interpretation o... |
This paper introduces voxurf - a method for surface reconstruction that combines explicit voxel representations with SDF-based volume rendering. On top of naive combination of existing techniques, the key ideas are: employing a coarse-to-fine strategy, such that coarse geometry is estimated first; a dual color network,... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper introduces voxurf - a method for surface reconstruction that combines explicit voxel representations with SDF-based volume rendering. On top of naive combination of existing techniques, the key ideas are: employing a coarse-to-fine strategy, such that coarse geometry is estimated first; a dual color ... |
This work introduces PaLI, a new large-scale vision-language pretraining model with multilingual enhancement. The architecture follows the previous scheme that leverages language pretraining as the main component which takes in vision and language feature tokens. The main contributions of this work are three folds: A n... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This work introduces PaLI, a new large-scale vision-language pretraining model with multilingual enhancement. The architecture follows the previous scheme that leverages language pretraining as the main component which takes in vision and language feature tokens. The main contributions of this work are three fo... |
This paper combines continuous time state-space models with transformer themes. The method is applied to large language and speech modelling tasks, and is compared to some baselines. The method appears to perform well. Some analysis of the temporal characteristics of the learned model are explored. As far as I can ... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper combines continuous time state-space models with transformer themes. The method is applied to large language and speech modelling tasks, and is compared to some baselines. The method appears to perform well. Some analysis of the temporal characteristics of the learned model are explored. As far a... |
This paper introduces Make-A-Video, a text-video generation approach trained based on a text-image model. The core idea of Make-A-Video is to take use of learned text-vision correlation from well-trained text-image model to accelerate the learning of text-video generation. It also claims that no paired text-video data ... | Recommendation: 8: accept, good paper | Area: Generative models | Review:
This paper introduces Make-A-Video, a text-video generation approach trained based on a text-image model. The core idea of Make-A-Video is to take use of learned text-vision correlation from well-trained text-image model to accelerate the learning of text-video generation. It also claims that no paired text-vid... |
This paper proposes an interpretation method for object detector. The authors slightly modify the existing Grad-CAM method to make it location-sensitive. In addition, ODAM-Train is also proposed for improved interpretation for overlapping objects. The experiments show that the proposed method provides better interpreta... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes an interpretation method for object detector. The authors slightly modify the existing Grad-CAM method to make it location-sensitive. In addition, ODAM-Train is also proposed for improved interpretation for overlapping objects. The experiments show that the proposed method provides better in... |
This paper describes an image captioning task to represent language acquisition through its structure. The learner or "speaker" is the image captioner. The feedback is provided via a "listener" that provides feedback in the form of a ground truth caption. The innovation comes from the inclusion, in the speaker model ... | Recommendation: 6: marginally above the acceptance threshold | Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces) | Review:
This paper describes an image captioning task to represent language acquisition through its structure. The learner or "speaker" is the image captioner. The feedback is provided via a "listener" that provides feedback in the form of a ground truth caption. The innovation comes from the inclusion, in the speake... |
The authors propose the use of sparse-variational GPs with a deep kernel and a transformer architecture to conduct hyperparameter optimization across different search spaces. They conduct an empirical comparison on three different tasks against most of the state-of-the-art.
**Strengths**
- Interesting idea
- Many exper... | Recommendation: 5: marginally below the acceptance threshold | Area: Optimization (eg, convex and non-convex optimization) | Review:
The authors propose the use of sparse-variational GPs with a deep kernel and a transformer architecture to conduct hyperparameter optimization across different search spaces. They conduct an empirical comparison on three different tasks against most of the state-of-the-art.
**Strengths**
- Interesting idea
- Ma... |
This paper proposes a generalisation of the family of linear networks (SGC, SSGC, APPNP, etc.) to heterophilous graphs. In contrast to existing methods which work well with homophilous networks, this work studies an objective which can work well with heterophilous graphs. Authors demonstrate the least squares based sol... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes a generalisation of the family of linear networks (SGC, SSGC, APPNP, etc.) to heterophilous graphs. In contrast to existing methods which work well with homophilous networks, this work studies an objective which can work well with heterophilous graphs. Authors demonstrate the least squares b... |
The work claims there is a trade-off between two properties of representation learning 1. When a model is pre-trained, the learned representation will be useful for downstream tasks with a small number of labels. 2. The representation is useful for different downstream tasks. i.e. the average accuracy on multiple downs... | Recommendation: 8: accept, good paper | Area: Unsupervised and Self-supervised learning | Review:
The work claims there is a trade-off between two properties of representation learning 1. When a model is pre-trained, the learned representation will be useful for downstream tasks with a small number of labels. 2. The representation is useful for different downstream tasks. i.e. the average accuracy on multip... |
This paper is a benchmark for out of distribution generalization in object detection. The authors create a benchmark to evaluate out of distribution generalization algorithms specifically for the task of object detection (object classification and bounding box regression), using multiple well known datasets in specific... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper is a benchmark for out of distribution generalization in object detection. The authors create a benchmark to evaluate out of distribution generalization algorithms specifically for the task of object detection (object classification and bounding box regression), using multiple well known datasets in ... |
This paper proposes SAGE, a method that extracts semantic-aware global explanations that can be applied to NLP in general and specifically experiments on name entity recognition.
### Strengths:
* The proposed method, SAGE, is potentially useful.
### Weaknesses:
* The paper may need major revision in its writing.
* T... | Recommendation: 3: reject, not good enough | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This paper proposes SAGE, a method that extracts semantic-aware global explanations that can be applied to NLP in general and specifically experiments on name entity recognition.
### Strengths:
* The proposed method, SAGE, is potentially useful.
### Weaknesses:
* The paper may need major revision in its writin... |
The paper addresses the problem of unsupervised semantic segmentation from images, which is relatively new in the literature. The methodology is based on saliency detection, clustering of self-supervised features (e.g., DINO) within the salient regions to obtain pseudo-masks, followed by a few iterations of self-traini... | Recommendation: 6: marginally above the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
The paper addresses the problem of unsupervised semantic segmentation from images, which is relatively new in the literature. The methodology is based on saliency detection, clustering of self-supervised features (e.g., DINO) within the salient regions to obtain pseudo-masks, followed by a few iterations of sel... |
This paper addresses the problem of inferring individual treatment effects from observational data using representation learning via a discrepancy constraint between the representations of the treatment and control groups. In particular, the authors address the problem of dealing with the mini batch sampling which occu... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper addresses the problem of inferring individual treatment effects from observational data using representation learning via a discrepancy constraint between the representations of the treatment and control groups. In particular, the authors address the problem of dealing with the mini batch sampling wh... |
The paper investigates the mechanism by which MLM pre-training may result if fine-tuned models that are more robust to spurious features.
The paper proposes a setting where there is a spurious feature that can predict a classification decision with a simple decision boundary and high but non-perfect accuracy, and a ro... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper investigates the mechanism by which MLM pre-training may result if fine-tuned models that are more robust to spurious features.
The paper proposes a setting where there is a spurious feature that can predict a classification decision with a simple decision boundary and high but non-perfect accuracy, ... |
A framework called DecomP for solving multi-step reasoning problems with large language models is proposed. A task is "decomposed" into a sequence of smaller subtasks, where each subtask calls a reusable submodule (itself a LLM call or an external knowledge retrieval); a simple syntax for control flow allowing substitu... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
A framework called DecomP for solving multi-step reasoning problems with large language models is proposed. A task is "decomposed" into a sequence of smaller subtasks, where each subtask calls a reusable submodule (itself a LLM call or an external knowledge retrieval); a simple syntax for control flow allowing ... |
This paper studies general-sum Markov games where the probability transition admits a low-rank structure, and proposes algorithms that exploit the underlying structure via representation learning to efficiently learn the (approximate) equilibrium policy. Both model-based and model-free methods are provided and theoreti... | Recommendation: 8: accept, good paper | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper studies general-sum Markov games where the probability transition admits a low-rank structure, and proposes algorithms that exploit the underlying structure via representation learning to efficiently learn the (approximate) equilibrium policy. Both model-based and model-free methods are provided and ... |
The paper proposes three types of conditioning (weak, strong, and pure) to unify some conditioning methods in the literature. Two empirical testing studies show that strong conditioning can perform better than weak conditioning and more efficiently than pure conditioning.
Strengths:
1. A general framework of condition... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The paper proposes three types of conditioning (weak, strong, and pure) to unify some conditioning methods in the literature. Two empirical testing studies show that strong conditioning can perform better than weak conditioning and more efficiently than pure conditioning.
Strengths:
1. A general framework of c... |
A variation of a triplet loss for deep metric learning, dubbed NPLB, is proposed. It is inspired by the condition that distance between positive and negative examples should be bigger than distance between anchor and positive. It is illustrated that optimizing such objective leads to more compact clusters. Empirical re... | Recommendation: 5: marginally below the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
A variation of a triplet loss for deep metric learning, dubbed NPLB, is proposed. It is inspired by the condition that distance between positive and negative examples should be bigger than distance between anchor and positive. It is illustrated that optimizing such objective leads to more compact clusters. Empi... |
This paper proposes several modifications such as adding dropout, moving the position of masked tokens, which provides incremental performance gain over MAE across vision tasks.
Strength: consistent performance gain (over different tasks) achieved by simple modifications (i.e. dropout, position of masked tokens)
Weakn... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This paper proposes several modifications such as adding dropout, moving the position of masked tokens, which provides incremental performance gain over MAE across vision tasks.
Strength: consistent performance gain (over different tasks) achieved by simple modifications (i.e. dropout, position of masked tokens... |
From the assumption that more and more models are proposed and evaluated in a multi-task setting, this paper proposes to explore the multi-task scaling laws, with a focus on multilingual machine translation. This focus is motivated by the abundance of benchmarks for this task and the existence on previous work about th... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
From the assumption that more and more models are proposed and evaluated in a multi-task setting, this paper proposes to explore the multi-task scaling laws, with a focus on multilingual machine translation. This focus is motivated by the abundance of benchmarks for this task and the existence on previous work ... |
Compared to the standard distributionally robust optimization (DRO, Namkoong & Duchi 2016), this paper constructs a new uncertainty set. The uncertainty set of DRO is an f-divergence ball whose center is the uniform distribution of all training samples. The new uncertainty set is a distributional metric ball whose cent... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
Compared to the standard distributionally robust optimization (DRO, Namkoong & Duchi 2016), this paper constructs a new uncertainty set. The uncertainty set of DRO is an f-divergence ball whose center is the uniform distribution of all training samples. The new uncertainty set is a distributional metric ball wh... |
This paper proposed a new approach for uncertainty estimation in image reconstruction, which uses masking mechanism to identify the more certain regions of the reconstructed image, thus narrowing the distance between masked ground truth and reconstructed images. The experiments are conducted on three reconstruction tas... | Recommendation: 5: marginally below the acceptance threshold | Area: General Machine Learning | Review:
This paper proposed a new approach for uncertainty estimation in image reconstruction, which uses masking mechanism to identify the more certain regions of the reconstructed image, thus narrowing the distance between masked ground truth and reconstructed images. The experiments are conducted on three reconstruc... |
This paper extended the HyperTransformer and proposed an Incremental HyperTransformer(IHT). The proposed IHT re-used the old weights as an input to generate the new weights for the incoming task in the continual sequence. This mechanism encourages the new model to utilize the knowledge in the old model. Experiments on ... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper extended the HyperTransformer and proposed an Incremental HyperTransformer(IHT). The proposed IHT re-used the old weights as an input to generate the new weights for the incoming task in the continual sequence. This mechanism encourages the new model to utilize the knowledge in the old model. Experim... |
The paper proposes a synthetic data generation method for differential privacy guarantee for large language models. More specifically, the author applies the PPLM-based gradient approach with a discriminator. The proposed method is evaluate on SST-2 and AG datasets.
Strength:
The paper addresses an important problem o... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper proposes a synthetic data generation method for differential privacy guarantee for large language models. More specifically, the author applies the PPLM-based gradient approach with a discriminator. The proposed method is evaluate on SST-2 and AG datasets.
Strength:
The paper addresses an important p... |
The paper tries to answer when prior learning can help in inverse problems using unsupervised ML methods. I don’t think this is an easy question to answer yet and understandably the paper considers a few simpler cases. The paper starts off with traditional dictionary learning methods and shows that one can only learn ... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The paper tries to answer when prior learning can help in inverse problems using unsupervised ML methods. I don’t think this is an easy question to answer yet and understandably the paper considers a few simpler cases. The paper starts off with traditional dictionary learning methods and shows that one can onl... |
The paper claims that transformer networks can be represented by a constant-size formula of first-order logic with majority quantifiers; in turn, this means that the computation of such networks can be reduced to division, as division is complete for such problems.
If correct, the claims in this paper are provocative a... | Recommendation: 3: reject, not good enough | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The paper claims that transformer networks can be represented by a constant-size formula of first-order logic with majority quantifiers; in turn, this means that the computation of such networks can be reduced to division, as division is complete for such problems.
If correct, the claims in this paper are provo... |
This paper proposes to add backdoor by designing some specific "malicious" data augmentation methods. Some important parts of the paper is not clear to me. Please see my comments below.
I have the following questions:
1. In traditional backdoor attacks, an identical transformation T is applied on both poisoned traini... | Recommendation: 5: marginally below the acceptance threshold | Area: General Machine Learning | Review:
This paper proposes to add backdoor by designing some specific "malicious" data augmentation methods. Some important parts of the paper is not clear to me. Please see my comments below.
I have the following questions:
1. In traditional backdoor attacks, an identical transformation T is applied on both poisone... |
This paper presents an approach to model-free transfer learning in RL called Random Features for Model-Free Planning (RaMP). RaMP works by learning fixed horizon open-loop value functions (predicting the total reward received if H specific actions are selected in sequence starting from a state) for each of k randomly g... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper presents an approach to model-free transfer learning in RL called Random Features for Model-Free Planning (RaMP). RaMP works by learning fixed horizon open-loop value functions (predicting the total reward received if H specific actions are selected in sequence starting from a state) for each of k ra... |
Update; I have read the rebuttal and decided to increase the score.
--------
This paper proposes a neural surrogate (WiNeRT) for a ray tracer that models the propagation of wireless signals. WiNeRT is a hybrid heuristic/learned ray tracer that replaces some heuristic ray tracing functionality, especially the Ray-Surfa... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
Update; I have read the rebuttal and decided to increase the score.
--------
This paper proposes a neural surrogate (WiNeRT) for a ray tracer that models the propagation of wireless signals. WiNeRT is a hybrid heuristic/learned ray tracer that replaces some heuristic ray tracing functionality, especially the R... |
Paper propose a method for multi-agent reinforcement learning in non-cooperative partially observable environments with communication. The proposed method, TSP, adds imaginary rewards using the peer prediction method by evaluating the validity of information exchanged between agents. TSP has guaranteed convergence to t... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
Paper propose a method for multi-agent reinforcement learning in non-cooperative partially observable environments with communication. The proposed method, TSP, adds imaginary rewards using the peer prediction method by evaluating the validity of information exchanged between agents. TSP has guaranteed converge... |
The authors propose Depthwise Federated Learning (DepthFL) framework (includes mutual self-distillation) to ensure that the global model accuracy improves compared to exclusive FL (excluding resource-constrained clients which can not train global models)) when performing aggregation of local models in FL on heterogene... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The authors propose Depthwise Federated Learning (DepthFL) framework (includes mutual self-distillation) to ensure that the global model accuracy improves compared to exclusive FL (excluding resource-constrained clients which can not train global models)) when performing aggregation of local models in FL on he... |
This paper discusses the data ownership problem from an economic perspective. The authors propose to use a compensation mechanism in the Modern Property Right Theory for solving data pricing problems in machine learning. Transferring the property right or ownership requires compensation, which is calculated by a modifi... | Recommendation: 8: accept, good paper | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This paper discusses the data ownership problem from an economic perspective. The authors propose to use a compensation mechanism in the Modern Property Right Theory for solving data pricing problems in machine learning. Transferring the property right or ownership requires compensation, which is calculated by ... |
In the present manuscript, author(s) offer a causality based solution to anomaly detection in multivariate time series data. Such data can be ubiquitously found in real world scenarios and one might be interested in finding any anomaly in this data and its cause. Existing set of solutions either perform separate univar... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
In the present manuscript, author(s) offer a causality based solution to anomaly detection in multivariate time series data. Such data can be ubiquitously found in real world scenarios and one might be interested in finding any anomaly in this data and its cause. Existing set of solutions either perform separat... |
This paper proposes a new method, DensePure, designed to improve the certified robustness of a pretrained model (i.e. classifier). Specifically, DensePure uses the diffusion model to denoise the adversarial input to get multiple reversed samples, which are then passed through the off-the-shelf classifier, followed by m... | Recommendation: 6: marginally above the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This paper proposes a new method, DensePure, designed to improve the certified robustness of a pretrained model (i.e. classifier). Specifically, DensePure uses the diffusion model to denoise the adversarial input to get multiple reversed samples, which are then passed through the off-the-shelf classifier, follo... |
This paper proposes an interesting 'Hierarchical Part-Whole Attention' for multi-object tracking. The proposed module is integrated with transformer network and achieves good performance (comparable or even better results than SOTA mot trackers). The overall training efficiency is also good, i.e., 4 hours on 4*v100 GPU... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposes an interesting 'Hierarchical Part-Whole Attention' for multi-object tracking. The proposed module is integrated with transformer network and achieves good performance (comparable or even better results than SOTA mot trackers). The overall training efficiency is also good, i.e., 4 hours on 4*... |
The paper studies the trade-off between robustness and test error in a setting in which (i) the teacher is a quadratic function, (ii) infinite training data are available, and (iii) a proportional scaling between the input dimension and the neural network width is assumed. The authors provide results for 3 different re... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The paper studies the trade-off between robustness and test error in a setting in which (i) the teacher is a quadratic function, (ii) infinite training data are available, and (iii) a proportional scaling between the input dimension and the neural network width is assumed. The authors provide results for 3 diff... |
This paper tackles the problem of fragment-based molecular generation. The authors propose MiCaM that includes a data-driven algorithm to mine a connection-aware motif vocabulary from a molecule library, as well as a connection-aware generator for de novo molecular generation. For motif vocabulary, the authors evaluate... | Recommendation: 6: marginally above the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This paper tackles the problem of fragment-based molecular generation. The authors propose MiCaM that includes a data-driven algorithm to mine a connection-aware motif vocabulary from a molecule library, as well as a connection-aware generator for de novo molecular generation. For motif vocabulary, the authors ... |
This paper introduces several modules to stabilize and accelerate the training of the vision transformers. In particular, the CenterNorm, scaled cosine similarity attention, and spectral initialization are proposed, which are the counterpart of the LayerNorm, standard self-attention, and Xavier/Kaiming initialization ... | Recommendation: 6: marginally above the acceptance threshold | Area: Optimization (eg, convex and non-convex optimization) | Review:
This paper introduces several modules to stabilize and accelerate the training of the vision transformers. In particular, the CenterNorm, scaled cosine similarity attention, and spectral initialization are proposed, which are the counterpart of the LayerNorm, standard self-attention, and Xavier/Kaiming initial... |
Summary:
The paper considers the case of non-uniform data in a sphere, and gives a way to demonstrate the frequency bias of neural net learning in the NTK regime.
Strengths:
The paper is well-written and the key ideas in the Theorems are reasonably easy to understand.
Weaknesses:
1. The main issue I have with the... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
Summary:
The paper considers the case of non-uniform data in a sphere, and gives a way to demonstrate the frequency bias of neural net learning in the NTK regime.
Strengths:
The paper is well-written and the key ideas in the Theorems are reasonably easy to understand.
Weaknesses:
1. The main issue I have ... |
This paper studies how to learn a global model in FL from multiple distributed source domains and generalize the model to new clients in unseen domains at inference time. The authors propose client-agnostic learning with mixed instance-global statistics
for local training along with zero-shot adaptation with estimated... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper studies how to learn a global model in FL from multiple distributed source domains and generalize the model to new clients in unseen domains at inference time. The authors propose client-agnostic learning with mixed instance-global statistics
for local training along with zero-shot adaptation with e... |
This paper proposes that a robust spectral alignment map may exist between graphs and partial graphs (which could be subgraphs in the original graph). The claims are driven by empirical observations on various real-world datasets.
Strengths:
Alignment between graphs and their sub-graphs is an interesting problem. The... | Recommendation: 3: reject, not good enough | Area: General Machine Learning | Review:
This paper proposes that a robust spectral alignment map may exist between graphs and partial graphs (which could be subgraphs in the original graph). The claims are driven by empirical observations on various real-world datasets.
Strengths:
Alignment between graphs and their sub-graphs is an interesting prob... |
This paper builds on the deep operator network (DeepONet) for learning operators between function spaces, for examples for PDE solving. This paper proposes HyperDeepONet which replaces the network with a hypernetwork, in other words making the target function input-dependent. This method is shown theoretically to be mo... | Recommendation: 8: accept, good paper | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This paper builds on the deep operator network (DeepONet) for learning operators between function spaces, for examples for PDE solving. This paper proposes HyperDeepONet which replaces the network with a hypernetwork, in other words making the target function input-dependent. This method is shown theoretically ... |
The paper studies the relaxed attention method on the Transformer architecture, across a variety of tasks including automatic speech recognition, lip reading, machine translation, image classification. The technical contributions include exploring relaxed attention on the self-attention module, utilizing it on both tra... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper studies the relaxed attention method on the Transformer architecture, across a variety of tasks including automatic speech recognition, lip reading, machine translation, image classification. The technical contributions include exploring relaxed attention on the self-attention module, utilizing it on ... |
This paper studies how to utilize unimodal pretrained models to improve vision-language downstream tasks through distillation. In particular, the paper proposes to use both visual and textual teachers to supervise a student VL model during the finetuning stage. A group of methods/tricks have been explored, including ad... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This paper studies how to utilize unimodal pretrained models to improve vision-language downstream tasks through distillation. In particular, the paper proposes to use both visual and textual teachers to supervise a student VL model during the finetuning stage. A group of methods/tricks have been explored, incl... |
The key idea is to share common modules among tasks to improve accuracy through cross-task knowledge transfer. Specifically, the paper proposes an evolutionary algorithm that iteratively trains the model over tasks where its sub-network for each task is evolved sequentially by mutating subsets of modules or hyper-param... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The key idea is to share common modules among tasks to improve accuracy through cross-task knowledge transfer. Specifically, the paper proposes an evolutionary algorithm that iteratively trains the model over tasks where its sub-network for each task is evolved sequentially by mutating subsets of modules or hyp... |
The paper provides theoretical results on training three-layer ViTs for classification tasks. The authors quantify the importance of self-attention on sample complexity for zero generalization error, as well as the sparsity of attention maps when being trained by SGD. The authors then also show that token sparsificatio... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The paper provides theoretical results on training three-layer ViTs for classification tasks. The authors quantify the importance of self-attention on sample complexity for zero generalization error, as well as the sparsity of attention maps when being trained by SGD. The authors then also show that token spars... |
This paper is interested in building language models that can generalize to new tasks when there is only unlabeled data for that task. The authors introduce a method called DEFT, where unlabeled instances for the task at hand are used to retrieve the most similar labeled prompted data in a pool of prompted instances of... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper is interested in building language models that can generalize to new tasks when there is only unlabeled data for that task. The authors introduce a method called DEFT, where unlabeled instances for the task at hand are used to retrieve the most similar labeled prompted data in a pool of prompted inst... |
The paper follows the framework of decision-estimation coefficient (DEC) proposed by (Foster et al. 2021). The major contribution of this work is to combine DEC with tempered aggregation to design algorithms for several problems (e.g., regret minimization, PAC-learning and reward-free learning) in DMSO (decision making... | Recommendation: 5: marginally below the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The paper follows the framework of decision-estimation coefficient (DEC) proposed by (Foster et al. 2021). The major contribution of this work is to combine DEC with tempered aggregation to design algorithms for several problems (e.g., regret minimization, PAC-learning and reward-free learning) in DMSO (decisio... |
This paper proposes a new way to pre-train language models. The main idea is to include sentence-level hierarchy information during the pre-training. Instead of considering only neighbor sentences, they consider more relations between sentences such as if they are in the same paragraph or if they are in the same docume... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes a new way to pre-train language models. The main idea is to include sentence-level hierarchy information during the pre-training. Instead of considering only neighbor sentences, they consider more relations between sentences such as if they are in the same paragraph or if they are in the sam... |
While many MoE research focused on improving routing policies to encourage expert diversity and specialization, this paper studies another aspect of expert scalability, i.e., gradually increasing the portion of experts being activated per time. The authors show that by making MoEs smoothly scalable to the number of exp... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
While many MoE research focused on improving routing policies to encourage expert diversity and specialization, this paper studies another aspect of expert scalability, i.e., gradually increasing the portion of experts being activated per time. The authors show that by making MoEs smoothly scalable to the numbe... |
This paper considers federated learning with non-iid data. Under the non-iid data, standard methods do not work well. For this problem, the authors first consider the effectiveness of proportional aggregation. Then, they find a trade-off between convergence rate and convergence error. Based on this finding, they propos... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper considers federated learning with non-iid data. Under the non-iid data, standard methods do not work well. For this problem, the authors first consider the effectiveness of proportional aggregation. Then, they find a trade-off between convergence rate and convergence error. Based on this finding, the... |
This draft studies the problem of learning with a distribution shift. The authors show that in the worst case of label shift or group-covariate shift, with the measure of minimax excess risk, no other algorithm can provably outperform the undersampling algorithm without further investigating the structure of distributi... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This draft studies the problem of learning with a distribution shift. The authors show that in the worst case of label shift or group-covariate shift, with the measure of minimax excess risk, no other algorithm can provably outperform the undersampling algorithm without further investigating the structure of di... |
The paper revisits the idea of using higher-order gradient in multi-agent RL with two improvements: (1) using LOLA and LA for preserving higher-order gradients and (2) use a hierarchical reasoning approach to coordinate agents in team (cooperation) scenario.
Pros:
- The LOLA and LA approximations makes preserving high-... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper revisits the idea of using higher-order gradient in multi-agent RL with two improvements: (1) using LOLA and LA for preserving higher-order gradients and (2) use a hierarchical reasoning approach to coordinate agents in team (cooperation) scenario.
Pros:
- The LOLA and LA approximations makes preservi... |
This work proposes a theoretical explanation for the observation of imbalanced frequency sensitivity in CNNs. The paper studies linear CNNs under weight penalties, and derives justification for the dependence of such CNNs' frequency sensitivity on the distribution of power in the data spectrum. Two empirical experiment... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This work proposes a theoretical explanation for the observation of imbalanced frequency sensitivity in CNNs. The paper studies linear CNNs under weight penalties, and derives justification for the dependence of such CNNs' frequency sensitivity on the distribution of power in the data spectrum. Two empirical ex... |
This paper raises an important question as to how one can do operator learning when equispaced discretizations of the functions are not available. But the supposed solution proposed in this paper is quite unconvincing.
There is a total lack of transparency in this paper as to what is the new loss function - and this a... | Recommendation: 3: reject, not good enough | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This paper raises an important question as to how one can do operator learning when equispaced discretizations of the functions are not available. But the supposed solution proposed in this paper is quite unconvincing.
There is a total lack of transparency in this paper as to what is the new loss function - an... |
In this work, the authors study the phenomenon of robust overfitting during adversarial training (AT) of deep neural networks — specifically about the deviations that arise due to optimization at different layers of these networks. The paper demonstrates that if the deeper layers of the network are frozen or optimized ... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
In this work, the authors study the phenomenon of robust overfitting during adversarial training (AT) of deep neural networks — specifically about the deviations that arise due to optimization at different layers of these networks. The paper demonstrates that if the deeper layers of the network are frozen or op... |
The paper focuses on SGDA with random reshuffling (SGDA-RR) for solving finite-sum min-max optimization problems. In particular, it studies simultaneous and alternative SGDA-RR for two different classes of problems nonconvex-PL and primal-PL-PL. The proposed analysis extends to the mini-batch regime and as a result, ma... | Recommendation: 8: accept, good paper | Area: Optimization (eg, convex and non-convex optimization) | Review:
The paper focuses on SGDA with random reshuffling (SGDA-RR) for solving finite-sum min-max optimization problems. In particular, it studies simultaneous and alternative SGDA-RR for two different classes of problems nonconvex-PL and primal-PL-PL. The proposed analysis extends to the mini-batch regime and as a re... |
This paper presents partial advantage estimation for PPO instead of using all the (truncated) advantage functions. PPO uses the lambda return method to estimate the advantage function. The proposed algorithm takes a partial coefficient \epsilon as input and discards trajectory for time steps greater than \epsilon, the ... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper presents partial advantage estimation for PPO instead of using all the (truncated) advantage functions. PPO uses the lambda return method to estimate the advantage function. The proposed algorithm takes a partial coefficient \epsilon as input and discards trajectory for time steps greater than \epsil... |
This paper proposes to apply SAM in the decentralized learning scenario to alleviate the distribution shift, termed DFedSAM. Convergence results are provided for smooth non-convex objectives under a bounded gradient assumption. Numerical experiments are conducted on several datasets.
Strengths:
- The ablation study pro... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes to apply SAM in the decentralized learning scenario to alleviate the distribution shift, termed DFedSAM. Convergence results are provided for smooth non-convex objectives under a bounded gradient assumption. Numerical experiments are conducted on several datasets.
Strengths:
- The ablation s... |
This paper designs a deep dynamic supervision mechanism that can be migrated into existing MIM methods.
It proposes to dynamically focus on patch reconstructions with different degrees of difficulty at different pretraining phases and depths of the model.
Further experiments demonstrate the effectiveness of proposed m... | Recommendation: 3: reject, not good enough | Area: Unsupervised and Self-supervised learning | Review:
This paper designs a deep dynamic supervision mechanism that can be migrated into existing MIM methods.
It proposes to dynamically focus on patch reconstructions with different degrees of difficulty at different pretraining phases and depths of the model.
Further experiments demonstrate the effectiveness of pr... |
Authors extend implicit differentiation to constraint bilevel optimization problem. Assuming usual qualification conditions, they provide a implicit differentiation formula. Experiments are proposed on toy bilevel problem, and real adversarial learning.
Weaknesses:
**Literature review** Non-smooth optimization
- The... | Recommendation: 8: accept, good paper | Area: Optimization (eg, convex and non-convex optimization) | Review:
Authors extend implicit differentiation to constraint bilevel optimization problem. Assuming usual qualification conditions, they provide a implicit differentiation formula. Experiments are proposed on toy bilevel problem, and real adversarial learning.
Weaknesses:
**Literature review** Non-smooth optimizati... |
The paper derives near-optimal generalization bound under the notion of $L_q$-stability, extending previous work on distribution free uniform stability. The authors then apply their results to derive excess risk bounds to inexact $L_0$-ERM.
The paper significantly improves the previous result under the notion of $L_q$ ... | Recommendation: 8: accept, good paper | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The paper derives near-optimal generalization bound under the notion of $L_q$-stability, extending previous work on distribution free uniform stability. The authors then apply their results to derive excess risk bounds to inexact $L_0$-ERM.
The paper significantly improves the previous result under the notion o... |
The authors propose a new way to sample tensor trains via efficient linear layers in deep learning frameworks. By further leveraging automatic differentiation, they propose to fit tensor trains to data by stochastic gradient descent and backpropagation. This gives a method that is robust to noise and that can be sample... | Recommendation: 6: marginally above the acceptance threshold | Area: General Machine Learning | Review:
The authors propose a new way to sample tensor trains via efficient linear layers in deep learning frameworks. By further leveraging automatic differentiation, they propose to fit tensor trains to data by stochastic gradient descent and backpropagation. This gives a method that is robust to noise and that can b... |
The paper considers a set of recent defenses against adversarial attacks on the image domain and uses existing attacks or develops them to capture a game-theoretic interaction between the attacks and defenses. To obtain the utility functions, they evaluate the effectiveness of different attacks on different defenses, t... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper considers a set of recent defenses against adversarial attacks on the image domain and uses existing attacks or develops them to capture a game-theoretic interaction between the attacks and defenses. To obtain the utility functions, they evaluate the effectiveness of different attacks on different def... |
This paper proposes a method for blind SR in which a teacher network is used to estimate degradation from LR and HR to guide the student network to get the degradation from just LR. The experiment results show the proposed method performs better than existing methods (especially for the synthetic experiments).
Strength... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposes a method for blind SR in which a teacher network is used to estimate degradation from LR and HR to guide the student network to get the degradation from just LR. The experiment results show the proposed method performs better than existing methods (especially for the synthetic experiments).
... |
The paper approaches meta-learning from a mirror descent perspective, considering a setting where the potential of the Bregman divergence is meta-learned. It proposes a method that can be efficiently implemented by restricting the form of the potential and using the IFT to be practical. Experiments show improved perfor... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper approaches meta-learning from a mirror descent perspective, considering a setting where the potential of the Bregman divergence is meta-learned. It proposes a method that can be efficiently implemented by restricting the form of the potential and using the IFT to be practical. Experiments show improve... |
The paper introduces MERL, Multimodal End-to-end Reinforcement Learning, a framework that combines multimodal (namely vision and proprioception) representation learning and RL.
The paper is well written, clear and structured in a nice way. The method is introduced in a clear way, as well as the experimental setup.
Some... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper introduces MERL, Multimodal End-to-end Reinforcement Learning, a framework that combines multimodal (namely vision and proprioception) representation learning and RL.
The paper is well written, clear and structured in a nice way. The method is introduced in a clear way, as well as the experimental set... |
The paper proposes a new method for training neural networks, combining forward mode auto-differentiation with directional gradients (forward gradient), weight permutation, and a novel way of using local losses. When combined with a new, complimentary architecture they propose (Local-Mixer), they show that their method... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The paper proposes a new method for training neural networks, combining forward mode auto-differentiation with directional gradients (forward gradient), weight permutation, and a novel way of using local losses. When combined with a new, complimentary architecture they propose (Local-Mixer), they show that thei... |
This paper models Multi-agent adversarial reinforcement learning (MaARL) as a as a mean-field quantitative differential game. A generalization error bound for MaARL is derived in terms of number of samples.
+: The paper says that "this is the first work on developing theoretical foundations for adversarial reinforceme... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper models Multi-agent adversarial reinforcement learning (MaARL) as a as a mean-field quantitative differential game. A generalization error bound for MaARL is derived in terms of number of samples.
+: The paper says that "this is the first work on developing theoretical foundations for adversarial rei... |
In the context of data augmentation for knowledge distillation, this paper proposes a method AugPro to address one significant and fundamental problem in representation learning for NLP: how to invert continuous representation to discrete tokens. AugPro finds tokens of which representations are close to the representat... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
In the context of data augmentation for knowledge distillation, this paper proposes a method AugPro to address one significant and fundamental problem in representation learning for NLP: how to invert continuous representation to discrete tokens. AugPro finds tokens of which representations are close to the rep... |
This work proposes high order methods for solving both SDE and ODE, by approximating high order gradients in Taylar expansion. It seems that this method can be extended to arbitrary order by computing some constants. Experiments are conducted on CIFAR10 and CelebA 64.
Strength:
This work proposes high order methods f... | Recommendation: 5: marginally below the acceptance threshold | Area: Generative models | Review:
This work proposes high order methods for solving both SDE and ODE, by approximating high order gradients in Taylar expansion. It seems that this method can be extended to arbitrary order by computing some constants. Experiments are conducted on CIFAR10 and CelebA 64.
Strength:
This work proposes high order m... |
The authors propose an algorithm, called CHAOS (Context and History Aware Other-Shaping) with the goal of capturing both learning context and history.
Strength:
- Some empirical results.
Weaknesses:
- The novelty is unclear.
- Presentation lacks clarity and precision. The theory background is incomplete and vague,... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The authors propose an algorithm, called CHAOS (Context and History Aware Other-Shaping) with the goal of capturing both learning context and history.
Strength:
- Some empirical results.
Weaknesses:
- The novelty is unclear.
- Presentation lacks clarity and precision. The theory background is incomplete an... |
The work extends piKL (an existing work for learning human-like policies) to coordinate with humans. They showcase their results on Hanabi benchmark.
Strengths :
1. I agree to the problem statement of being of high importance with upcoming HiL methods where coordination with the human model / policy should be account... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The work extends piKL (an existing work for learning human-like policies) to coordinate with humans. They showcase their results on Hanabi benchmark.
Strengths :
1. I agree to the problem statement of being of high importance with upcoming HiL methods where coordination with the human model / policy should be... |
Motivated by the over conservativity of existing offline RL algorithms, the paper proposes a Distance-sensitive Offline RL with better GEneralization (DOGE) method. In fact, DOGE describes a constraint set of possible policies, relying on a state-conditioned distance function. Such a distance function accounts for the ... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
Motivated by the over conservativity of existing offline RL algorithms, the paper proposes a Distance-sensitive Offline RL with better GEneralization (DOGE) method. In fact, DOGE describes a constraint set of possible policies, relying on a state-conditioned distance function. Such a distance function accounts ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.