review
stringlengths
5
16.6k
score
stringclasses
5 values
area
stringclasses
12 values
text
stringlengths
31
5.65k
the paper studies a method which combines MPC with DP that bypasses utility challenges of federated learning with local DP (with small datasets). authors show that the method achieves good performance by reporting their submission entry being 1st place for an iDASH 2021 challenge, at the cost of substantially more comp...
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 studies a method which combines MPC with DP that bypasses utility challenges of federated learning with local DP (with small datasets). authors show that the method achieves good performance by reporting their submission entry being 1st place for an iDASH 2021 challenge, at the cost of substantially m...
The paper presents a new benchmark for evaluating the robustness of models for motion forecasting of autonomous vehicles. The authors collect human-annotated labels of causal agents on the Waymo Open Motion Dataset, and perform various perturbations of the data using these labels. This data is used to evaluate the robu...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper presents a new benchmark for evaluating the robustness of models for motion forecasting of autonomous vehicles. The authors collect human-annotated labels of causal agents on the Waymo Open Motion Dataset, and perform various perturbations of the data using these labels. This data is used to evaluate ...
This paper introduces a method for blind single image super-resolution. Contrary to the mainstream the idea of this method is to design an implicit degradation estimator that can extract information regarding the degradation without having an explicit model. This is done using ideas from Knowledge distillation where fi...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper introduces a method for blind single image super-resolution. Contrary to the mainstream the idea of this method is to design an implicit degradation estimator that can extract information regarding the degradation without having an explicit model. This is done using ideas from Knowledge distillation ...
This paper improves the efficiency of MAE training by exploiting the redundancy in reconstructed tokens. They propose to use the similarity to mean token as an emprical criterior to prune the tokens, which leads to savings in computation. They achieve 1.5x-1.9x speed up compared with MAE, while maintain similar perform...
Recommendation: 6: marginally above the acceptance threshold
Area: Unsupervised and Self-supervised learning
Review: This paper improves the efficiency of MAE training by exploiting the redundancy in reconstructed tokens. They propose to use the similarity to mean token as an emprical criterior to prune the tokens, which leads to savings in computation. They achieve 1.5x-1.9x speed up compared with MAE, while maintain similar...
Authors present a generalized TD learning for the MARL setting, with local updates occurring for K > 1 iterations for each instance of communication. Sample complexities at the inner loop (local TD updates) and the outer loop (consensus updates) are computed based on mild assumptions. Theoretical formulation predicts a...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: Authors present a generalized TD learning for the MARL setting, with local updates occurring for K > 1 iterations for each instance of communication. Sample complexities at the inner loop (local TD updates) and the outer loop (consensus updates) are computed based on mild assumptions. Theoretical formulation pr...
The authors propose a novel multi-agent policy gradient algorithm called Advantage Constrained Proximal Policy Optimization (ACPPO). Strength: 1. The author presents a constraint coefficient to the local advantage, which is estimated by the difference between the local and fictitious joint advantage functions, to ensur...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The authors propose a novel multi-agent policy gradient algorithm called Advantage Constrained Proximal Policy Optimization (ACPPO). Strength: 1. The author presents a constraint coefficient to the local advantage, which is estimated by the difference between the local and fictitious joint advantage functions, ...
In this paper, the authors studied why training with the mixup loss for extra epochs often degrades test classification accuracy. They argued, through empirical observation, theoretical analysis and synthetic experiments, that the mixup loss introduces label noise, and a model may overfit to the label noise during exte...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: In this paper, the authors studied why training with the mixup loss for extra epochs often degrades test classification accuracy. They argued, through empirical observation, theoretical analysis and synthetic experiments, that the mixup loss introduces label noise, and a model may overfit to the label noise dur...
This paper presents a benchmark for partial domain adaptation (PDA) to evaluate the model selection strategies for different PDA approaches on two different real-world datasets. The experimental results show that 1) Target labels are critical for model selection strategies; 2) only one method and model selection pair p...
Recommendation: 5: marginally below the acceptance threshold
Area: Unsupervised and Self-supervised learning
Review: This paper presents a benchmark for partial domain adaptation (PDA) to evaluate the model selection strategies for different PDA approaches on two different real-world datasets. The experimental results show that 1) Target labels are critical for model selection strategies; 2) only one method and model selectio...
This paper studies a score-based generative model (SGM) for tabular data. They found there's a difficulty in adopting SGM to tabular modeling that the training process is unstable. Hence they introduced a self-paced learning algorithm, a variation of curriculum learning, to train SGM. In experiments, the proposed metho...
Recommendation: 8: accept, good paper
Area: Generative models
Review: This paper studies a score-based generative model (SGM) for tabular data. They found there's a difficulty in adopting SGM to tabular modeling that the training process is unstable. Hence they introduced a self-paced learning algorithm, a variation of curriculum learning, to train SGM. In experiments, the propos...
This paper proposes a method to perform activation compressed training (ACT) for pointwise non-linear activation functions. Instead of storing a quantized version of the input x, the proposed approach stores a quantized version of the activation function's gradient f'(x), which is multiplied with the gradient in the ba...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper proposes a method to perform activation compressed training (ACT) for pointwise non-linear activation functions. Instead of storing a quantized version of the input x, the proposed approach stores a quantized version of the activation function's gradient f'(x), which is multiplied with the gradient i...
The paper reveals an interesting and important failure pattern of the pre-trained vision-language models (VLMs): they are insensitive to object attributes, relations, and even word orders. They created several tests from Visual Genome, COCO caption, and Flickr30K, and show several representative VLMs (BLIP, CLIP, etc.)...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: The paper reveals an interesting and important failure pattern of the pre-trained vision-language models (VLMs): they are insensitive to object attributes, relations, and even word orders. They created several tests from Visual Genome, COCO caption, and Flickr30K, and show several representative VLMs (BLIP, CLI...
The paper mainly investigates the principle differences between contrastive learning (CL) and masked image modeling (MIM). That’s the CL is shape-biased, which learns low-frequencies, and the MIM is texture-biased, which exploits high-frequencies. The Conclusion is interesting and the analysis is thorough. Strength: ...
Recommendation: 6: marginally above the acceptance threshold
Area: Unsupervised and Self-supervised learning
Review: The paper mainly investigates the principle differences between contrastive learning (CL) and masked image modeling (MIM). That’s the CL is shape-biased, which learns low-frequencies, and the MIM is texture-biased, which exploits high-frequencies. The Conclusion is interesting and the analysis is thorough. Stre...
This paper study the problem of multiple objective reinforcement learning. As previous methods that search for Pareto front are not sample efficient. The paper propose the Q-Pensieve method, which updates the policy with learned Q-networks from past iterations. The paper provide some theoretical analysis. Finally, exp...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper study the problem of multiple objective reinforcement learning. As previous methods that search for Pareto front are not sample efficient. The paper propose the Q-Pensieve method, which updates the policy with learned Q-networks from past iterations. The paper provide some theoretical analysis. Fina...
The paper investigates the capability of transformer-based in-context learners (ICL) to implicitly implement learning algorithms. The authors consider a study-case of linear regression models to validate their hypothesis that ICL encode context-specific parametric models: 1) ICL implement linear models by encoding grad...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: The paper investigates the capability of transformer-based in-context learners (ICL) to implicitly implement learning algorithms. The authors consider a study-case of linear regression models to validate their hypothesis that ICL encode context-specific parametric models: 1) ICL implement linear models by encod...
The paper proposed dense correlation fields for action recognition. Based on CorrNet, the paper proposed to model temporal long-term correlation by computing correlation for frames that are far apart. The paper also designs a spatial hierarchical architecture to aggregate the information at different granularities. The...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper proposed dense correlation fields for action recognition. Based on CorrNet, the paper proposed to model temporal long-term correlation by computing correlation for frames that are far apart. The paper also designs a spatial hierarchical architecture to aggregate the information at different granularit...
This paper proposes a generative modeling setup for weak supervision in images. The claim is that by doing so, there are improvements both to generative modeling and to the pseudolabeling qualities of the model, and they work in concert. They do this through proofs and experimental evaluations. The setup is a GAN arc...
Recommendation: 6: marginally above the acceptance threshold
Area: General Machine Learning
Review: This paper proposes a generative modeling setup for weak supervision in images. The claim is that by doing so, there are improvements both to generative modeling and to the pseudolabeling qualities of the model, and they work in concert. They do this through proofs and experimental evaluations. The setup is a...
This paper is an empirical study of the generalization abilities of the deep RL algorithm IMPALA pre-trained on multiple tasks. Pre-training is done on variants of a single game from the Atari benchmark and fine-tuning/testing is done on held-out variants. The authors show that by limiting to variants of a single game,...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper is an empirical study of the generalization abilities of the deep RL algorithm IMPALA pre-trained on multiple tasks. Pre-training is done on variants of a single game from the Atari benchmark and fine-tuning/testing is done on held-out variants. The authors show that by limiting to variants of a sing...
This paper proposes a novel specialized attention mechanism for CLIP models to induce hierarchical feature discovery in vision and language each modality. The authors successfully validate their claims with various experimental results, and they demonstrate the significant performance improvement of CLIP (Contrastive ...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: This paper proposes a novel specialized attention mechanism for CLIP models to induce hierarchical feature discovery in vision and language each modality. The authors successfully validate their claims with various experimental results, and they demonstrate the significant performance improvement of CLIP (Cont...
This work focuses on improving the use of knowledge in knowledge-augmented Pre-Trained Language Models (PTLM). Authors hypothesize that using knowledge for all instances can backfire and lead the model towards incorrect predictions, but simultaneously for some instances, external knowledge is required. To combat this i...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This work focuses on improving the use of knowledge in knowledge-augmented Pre-Trained Language Models (PTLM). Authors hypothesize that using knowledge for all instances can backfire and lead the model towards incorrect predictions, but simultaneously for some instances, external knowledge is required. To comba...
The authors proposed SMART, a new automatic evaluation metric text generation models. - Proposal 1: To deal with multiple sentences, they proposed SMART-N and SMART-L, in which the calculation unit of ROUGE-N and ROUGE-L is changed from words to sentences. In SMART, several metrics such as BLEURT and ANLI are used to s...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The authors proposed SMART, a new automatic evaluation metric text generation models. - Proposal 1: To deal with multiple sentences, they proposed SMART-N and SMART-L, in which the calculation unit of ROUGE-N and ROUGE-L is changed from words to sentences. In SMART, several metrics such as BLEURT and ANLI are u...
Mode collapse is a problem in imitating multi-modal trajectories. Hierarchical method use latent code to represent the agent type or context variable which is inferred during the training and later used at test time, and the policy should be conditioned on the latent code. Context variable include internal (intrinsic s...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: Mode collapse is a problem in imitating multi-modal trajectories. Hierarchical method use latent code to represent the agent type or context variable which is inferred during the training and later used at test time, and the policy should be conditioned on the latent code. Context variable include internal (int...
This paper proposes an out-of-distribution (OOD) detection method for text generation based on the concept of information measure. More specifically, the author considers two measurements, the Renyi divergence, and the Fisher-Rao distance under both the no-reference and the reference scenarios. The empirical results sh...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper proposes an out-of-distribution (OOD) detection method for text generation based on the concept of information measure. More specifically, the author considers two measurements, the Renyi divergence, and the Fisher-Rao distance under both the no-reference and the reference scenarios. The empirical re...
The paper proposes a novel benchmark, called CAB, to compare the efficiency of different attention mechanisms in transformers. The current widely used benchmark LRA focusses only on noncausal self-attention. CAB seeks to evaluate four types of attention mechanisms: the combinations of causal/ non-causal and self/ cros...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: The paper proposes a novel benchmark, called CAB, to compare the efficiency of different attention mechanisms in transformers. The current widely used benchmark LRA focusses only on noncausal self-attention. CAB seeks to evaluate four types of attention mechanisms: the combinations of causal/ non-causal and se...
This paper investigates systematic generalization of multi-label classifications in settings where the input space is shared between the different labels. The authors suggest that deep learning models are biased towards feature reuse, which conflicts with systematic generalization to new combinations of known classes. ...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper investigates systematic generalization of multi-label classifications in settings where the input space is shared between the different labels. The authors suggest that deep learning models are biased towards feature reuse, which conflicts with systematic generalization to new combinations of known c...
This paper proposes to use parametric transforms such as exponential function or stick-breaking transformation on the outputs of Bayesian neural network (BNN) and turn them into positive random vectors or simplex vectors. This new transformed BNN module can be plugged into probabilistic graphic models as a replacement ...
Recommendation: 3: reject, not good enough
Area: Unsupervised and Self-supervised learning
Review: This paper proposes to use parametric transforms such as exponential function or stick-breaking transformation on the outputs of Bayesian neural network (BNN) and turn them into positive random vectors or simplex vectors. This new transformed BNN module can be plugged into probabilistic graphic models as a repl...
This paper proposes a new topic-aware transformer that alleviates the gap between the pretrained language model and the target domain. The paper introduces an additional topic latent variable $z$ as an additional condition when generating new tokens. The new topic latent variables come from the topic steering layer, wh...
Recommendation: 6: marginally above the acceptance threshold
Area: Generative models
Review: This paper proposes a new topic-aware transformer that alleviates the gap between the pretrained language model and the target domain. The paper introduces an additional topic latent variable $z$ as an additional condition when generating new tokens. The new topic latent variables come from the topic steering l...
This paper studies reducing selection bias and confounders bias in estimating average causal effects (ATE) in observational data. This paper provides the SC-CFR algorithm for simultaneously addressing confounder and collider bias to achieve unbiased ATE estimation. Specifically, SC-CFR first computes the magnitude of t...
Recommendation: 5: marginally below the acceptance threshold
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: This paper studies reducing selection bias and confounders bias in estimating average causal effects (ATE) in observational data. This paper provides the SC-CFR algorithm for simultaneously addressing confounder and collider bias to achieve unbiased ATE estimation. Specifically, SC-CFR first computes the magnit...
The paper proposes a data valuation method that is oblivious to the downstream learning algorithm. The main idea is to evaluate the training data by a class-wise Wasserstein distance between the training and the validation set. They prove that the class-wise Wasserstein distance approximates the performance for any giv...
Recommendation: 8: accept, good paper
Area: General Machine Learning
Review: The paper proposes a data valuation method that is oblivious to the downstream learning algorithm. The main idea is to evaluate the training data by a class-wise Wasserstein distance between the training and the validation set. They prove that the class-wise Wasserstein distance approximates the performance for...
The paper presents a semi-supervised learning method for semantic segmentation, which learns a multi-prototype representation for each semantic class and a feature refinement step based on those prototypes. To achieve this, it develops a multi-prototype contrastive loss function and an attention-based prototype-to-feat...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper presents a semi-supervised learning method for semantic segmentation, which learns a multi-prototype representation for each semantic class and a feature refinement step based on those prototypes. To achieve this, it develops a multi-prototype contrastive loss function and an attention-based prototype...
The paper develops techniques for distributed matrix multiplication with adversarially corrupt nodes and stragglers. A error correction coding scheme is developed that simultaneously detects corrupt computations via random-key-based verification, and can decode in the presence of stragglers. Strengths: + The simultan...
Recommendation: 3: reject, not good enough
Area: General Machine Learning
Review: The paper develops techniques for distributed matrix multiplication with adversarially corrupt nodes and stragglers. A error correction coding scheme is developed that simultaneously detects corrupt computations via random-key-based verification, and can decode in the presence of stragglers. Strengths: + The ...
The paper aims to make CNN suitable for data of arbitrary resolution, dimensionality and length without any structural changes. A Continuous CNN is proposed by introducing continuous convolutional kernels which is a data independent parameterization for convolutional weight. The proposed CCNN can work on on sequential ...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper aims to make CNN suitable for data of arbitrary resolution, dimensionality and length without any structural changes. A Continuous CNN is proposed by introducing continuous convolutional kernels which is a data independent parameterization for convolutional weight. The proposed CCNN can work on on seq...
This paper considers a new type of adversary that chooses to only perturb a subset of data. The authors propose a defensive strategy that is formulated as a minimax problem that involves a worst-case subset selection procedure. This paper uses a greedy algorithm to realize the worst-case subset selection. The empirical...
Recommendation: 6: marginally above the acceptance threshold
Area: General Machine Learning
Review: This paper considers a new type of adversary that chooses to only perturb a subset of data. The authors propose a defensive strategy that is formulated as a minimax problem that involves a worst-case subset selection procedure. This paper uses a greedy algorithm to realize the worst-case subset selection. The e...
The paper proposes an application of SoftHebb to deep convolutional neural networks. SoftHebb has been proposed before (supposedly by the same authors?), it is a soft winner-take-all version of the Hebbian learning rule implemented using the softmax function. The novelty of the paper lies in making SoftHebb scale to mu...
Recommendation: 6: marginally above the acceptance threshold
Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces)
Review: The paper proposes an application of SoftHebb to deep convolutional neural networks. SoftHebb has been proposed before (supposedly by the same authors?), it is a soft winner-take-all version of the Hebbian learning rule implemented using the softmax function. The novelty of the paper lies in making SoftHebb sca...
The authors evaluate the relation between episodic and global novelty bonus with regard to contextual MDPs. They show two simplified examples for demonstrating the different advantages of the two novelty bonus types. Additionally, they explore 6 different combinations of the episodic E3B bonus with global novelty bonus...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The authors evaluate the relation between episodic and global novelty bonus with regard to contextual MDPs. They show two simplified examples for demonstrating the different advantages of the two novelty bonus types. Additionally, they explore 6 different combinations of the episodic E3B bonus with global novel...
The paper proposes a new method based on the CLIP model for continual vision-language representation learning. The authors find that simple continual training in the CLIP model degenerates the performance on multimodal retrieval tasks, named Cognitive Disorder (CD). To tackle CD, they suggest Mod-X that selectively ali...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: The paper proposes a new method based on the CLIP model for continual vision-language representation learning. The authors find that simple continual training in the CLIP model degenerates the performance on multimodal retrieval tasks, named Cognitive Disorder (CD). To tackle CD, they suggest Mod-X that selecti...
This paper proposes to combine meta learning with few-shot adaptation of language models, by essentially building upon methods such as Frozen (Tsimpoukelli et al., 2021) which maps image representations into language model token space, but adding a meta-mapper network, acting as a meta-learner, to more efficiently perf...
Recommendation: 3: reject, not good enough
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper proposes to combine meta learning with few-shot adaptation of language models, by essentially building upon methods such as Frozen (Tsimpoukelli et al., 2021) which maps image representations into language model token space, but adding a meta-mapper network, acting as a meta-learner, to more efficien...
The authors present a novel application of differential geometry and Hamiltonian flows to graph neural networks and demonstrate its applicability to the common GNN problem of node classification. The theory gives rise to a GNN model which is then shown to perform relatively well on standard datasets and somewhat to res...
Recommendation: 5: marginally below the acceptance threshold
Area: General Machine Learning
Review: The authors present a novel application of differential geometry and Hamiltonian flows to graph neural networks and demonstrate its applicability to the common GNN problem of node classification. The theory gives rise to a GNN model which is then shown to perform relatively well on standard datasets and somewha...
This paper proposes, based on SIREN, a new interpretable INR architecture for time series called iSIREN. Building up on that, the paper proposes to use the iSIREN set-up in the context of hypernetworks for time series generating. Both methods differ from its plain counter version (SIREN and SIREN-based hypernetwork) in...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper proposes, based on SIREN, a new interpretable INR architecture for time series called iSIREN. Building up on that, the paper proposes to use the iSIREN set-up in the context of hypernetworks for time series generating. Both methods differ from its plain counter version (SIREN and SIREN-based hypernet...
This paper proposes a new hierarchy of expressive isomorphism test algorithm and GNN model, with combining k-WL tuple idea and rooted subgraph idea from subgraph GNNs. More specifically, the author still work on subgraph GNNs with each node representing the encoding of d-hop rooted subgraph around the node. Unliking 1-...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper proposes a new hierarchy of expressive isomorphism test algorithm and GNN model, with combining k-WL tuple idea and rooted subgraph idea from subgraph GNNs. More specifically, the author still work on subgraph GNNs with each node representing the encoding of d-hop rooted subgraph around the node. Unl...
This paper proposes a metrics called "susceptibility" that measure the model's resistance to memorization by using randomly labeled data. The authors provide both theoretical and empirical observations that the models which are resistant to memorization will have high test accuracies. Therefore, the extent of memorizat...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper proposes a metrics called "susceptibility" that measure the model's resistance to memorization by using randomly labeled data. The authors provide both theoretical and empirical observations that the models which are resistant to memorization will have high test accuracies. Therefore, the extent of m...
This work proposes the striking empirical phenomenon that, accounting for permutations, two independently trained networks of the same architecture will have no energy barrier on the linear path between them. Furthermore, the authors demonstrate an issue with naive interpolation for deeper networks where the activation...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: This work proposes the striking empirical phenomenon that, accounting for permutations, two independently trained networks of the same architecture will have no energy barrier on the linear path between them. Furthermore, the authors demonstrate an issue with naive interpolation for deeper networks where the ac...
The paper proposes the idea of using delayed preconditioning by an average of gradients. The idea is motivated by the supposed empirical observation that the gradient geometry does not change significantly over a period of time. The strength of the paper is the novel idea of using preconditioning in this smart way. I ...
Recommendation: 6: marginally above the acceptance threshold
Area: Optimization (eg, convex and non-convex optimization)
Review: The paper proposes the idea of using delayed preconditioning by an average of gradients. The idea is motivated by the supposed empirical observation that the gradient geometry does not change significantly over a period of time. The strength of the paper is the novel idea of using preconditioning in this smart...
This work proposes a method to unify rule-based control with reinforcement learning for building management and control. The work provides both the online and offline setting variants. The idea is to extend the previous work of TD3 + BC by replacing the behavior policy with a dynamically weighted policy that chooses ac...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This work proposes a method to unify rule-based control with reinforcement learning for building management and control. The work provides both the online and offline setting variants. The idea is to extend the previous work of TD3 + BC by replacing the behavior policy with a dynamically weighted policy that ch...
This paper proposes a novel technique for segmentation, especially for data with fine-scale structure. The authors questioned the conventional segmentation technique, which evaluates the segmentation on a pixel-by-pixel basis and overlooks the perspective of topological structure, and proposed a method to solve this pr...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper proposes a novel technique for segmentation, especially for data with fine-scale structure. The authors questioned the conventional segmentation technique, which evaluates the segmentation on a pixel-by-pixel basis and overlooks the perspective of topological structure, and proposed a method to solve...
This paper extends prior work which represents compactly a large number RL policies via a linear combination of their parameters, by making the linear combination dynamic, being able to grow incrementally as the number of policies increase and more model capacity is needed. The paper provides a heuristic to control thi...
Recommendation: 8: accept, good paper
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper extends prior work which represents compactly a large number RL policies via a linear combination of their parameters, by making the linear combination dynamic, being able to grow incrementally as the number of policies increase and more model capacity is needed. The paper provides a heuristic to con...
This paper proposes ProbDropBlock, an adaptive version of DropBlock in which the drop probability of the mask is defined to be negatively correlated to the absolute value of the centroid entry. Experiments are conducted on 3 NLP datasets (MNLI, QNLI, RTE) and 3 CV datasets (Cifar-10, Cifar-100, Imagenet). Strength: 1....
Recommendation: 5: marginally below the acceptance threshold
Area: General Machine Learning
Review: This paper proposes ProbDropBlock, an adaptive version of DropBlock in which the drop probability of the mask is defined to be negatively correlated to the absolute value of the centroid entry. Experiments are conducted on 3 NLP datasets (MNLI, QNLI, RTE) and 3 CV datasets (Cifar-10, Cifar-100, Imagenet). Stren...
This work hypothesizes that the limit maps produced by DDPMs coincide with the optimal transport maps, or they are very close to each other with high similarity. The theoretical proofs are given for the cases of the normal source distributions, and experimental results are given for more general distributions, such ...
Recommendation: 6: marginally above the acceptance threshold
Area: Generative models
Review: This work hypothesizes that the limit maps produced by DDPMs coincide with the optimal transport maps, or they are very close to each other with high similarity. The theoretical proofs are given for the cases of the normal source distributions, and experimental results are given for more general distribution...
This paper identifies the problem of 'split tradeoff', where common train/validation splits for data result in either less data to train on or poorer model evaluation. Instead, the paper introduces Proximal Validation Protocol (PVP), which, instead of splitting the validation set from a train set, creates a validation ...
Recommendation: 5: marginally below the acceptance threshold
Area: General Machine Learning
Review: This paper identifies the problem of 'split tradeoff', where common train/validation splits for data result in either less data to train on or poorer model evaluation. Instead, the paper introduces Proximal Validation Protocol (PVP), which, instead of splitting the validation set from a train set, creates a val...
The paper develops a methodology based on supervised learning (as opposed to reinforcement learning) for the purpose of neural combinatorial optimization (NCO), and in particular for the traveling salesman problem (TSP). In this direction, the authors first propose a set of four data augmentation methods (rotation, sym...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper develops a methodology based on supervised learning (as opposed to reinforcement learning) for the purpose of neural combinatorial optimization (NCO), and in particular for the traveling salesman problem (TSP). In this direction, the authors first propose a set of four data augmentation methods (rotat...
This paper theoretically investigates the implications of pre-training for generalization in RL in terms of possible benefits and limitations. Specifically, the paper shows that in an asymptotic limit (where the agent can interact $K \rightarrow \infty$ times with its environment and knows the MDP distribution D) pre-t...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper theoretically investigates the implications of pre-training for generalization in RL in terms of possible benefits and limitations. Specifically, the paper shows that in an asymptotic limit (where the agent can interact $K \rightarrow \infty$ times with its environment and knows the MDP distribution ...
This paper proposes a new Graph Transformer architecture, named dual-encoding Transformer (DET), which has a structural encoder to aggregate information from near neighbors and a semantic encoder to focus on useful semantically close neighbors. The empirical results demonstrate that the proposed DET achieves superior p...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper proposes a new Graph Transformer architecture, named dual-encoding Transformer (DET), which has a structural encoder to aggregate information from near neighbors and a semantic encoder to focus on useful semantically close neighbors. The empirical results demonstrate that the proposed DET achieves su...
This paper presents a new data reconstruction attack for text data in federated learning. In the proposed attack, a dishonest server drafts corrupted model parameters and sends them to the clients. The server can reconstruct sequences of text by observing the gradients returned by the clients using the corrupted model ...
Recommendation: 1: strong reject
Area: Deep Learning and representational learning
Review: This paper presents a new data reconstruction attack for text data in federated learning. In the proposed attack, a dishonest server drafts corrupted model parameters and sends them to the clients. The server can reconstruct sequences of text by observing the gradients returned by the clients using the corrupte...
This work proposes a Pareto manifold learning approach to produce a continuous Pareto front for a given multi-task learning (MTL) problem in a single run. The MTL problem is formulated as a multi-objective optimization problem, and the proposed method can be treated as an ensemble approach for multiple single-task mode...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This work proposes a Pareto manifold learning approach to produce a continuous Pareto front for a given multi-task learning (MTL) problem in a single run. The MTL problem is formulated as a multi-objective optimization problem, and the proposed method can be treated as an ensemble approach for multiple single-t...
This paper presents a new Convolutional Neural Network, Contextual Convolutional Network, for visual recognition. Most existing convolutional backbones follow the representation-toclassification paradigm, where input representations are first generated by category-agnostic convolutional operations and then fed into per...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper presents a new Convolutional Neural Network, Contextual Convolutional Network, for visual recognition. Most existing convolutional backbones follow the representation-toclassification paradigm, where input representations are first generated by category-agnostic convolutional operations and then fed ...
The paper presents a method to learn a shared set of object representations from paired views captured across 3D scenes, in a self-unsupervised manner. The core difference to existing 3D object-centric learning work is that it learns reoccurring objects across scenes and explicitly localize the learned objects, which a...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper presents a method to learn a shared set of object representations from paired views captured across 3D scenes, in a self-unsupervised manner. The core difference to existing 3D object-centric learning work is that it learns reoccurring objects across scenes and explicitly localize the learned objects,...
This paper introduces self-supervised adversarial learning into adversarial meta-learning, and proposes a transferable robust meta-learning via bilevel attack (TROBA) method by using a bilevel attack scheme. Specifically, TROBA is built on BOIL and TRADES by adding a self-supervised loss. Extensive experiments effectiv...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper introduces self-supervised adversarial learning into adversarial meta-learning, and proposes a transferable robust meta-learning via bilevel attack (TROBA) method by using a bilevel attack scheme. Specifically, TROBA is built on BOIL and TRADES by adding a self-supervised loss. Extensive experiments ...
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 able to train a goal ...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: 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 able to train...
This paper proves under certain assumptions, FedAvg can converge linearly to the optimal solution even under heterogeneous clients. The convergence relies on specific network architectures and parameter initialization. Strength: 1. A global and linear convergence result for FedAvg. In this sense, the result is new and ...
Recommendation: 3: reject, not good enough
Area: Optimization (eg, convex and non-convex optimization)
Review: This paper proves under certain assumptions, FedAvg can converge linearly to the optimal solution even under heterogeneous clients. The convergence relies on specific network architectures and parameter initialization. Strength: 1. A global and linear convergence result for FedAvg. In this sense, the result is ...
This paper presents an initial study on the trade-off and connections between two key data regularization principles, “the right to be forgotten” and “the right to recourse”. The authors formalize the new recourse robustness problem through outcome and action instability, and subsequently upper bounds the recourse inst...
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 presents an initial study on the trade-off and connections between two key data regularization principles, “the right to be forgotten” and “the right to recourse”. The authors formalize the new recourse robustness problem through outcome and action instability, and subsequently upper bounds the recou...
To recover the parameters of an unknown reward function, this work introduces the notion of the Bellman score - corresponding to the (vector-valued) gradients of the log probabilities of the true optimal policy with respect to the true unknown reward. Hence, it proposes an algorithm to estimate this quantity via approx...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: To recover the parameters of an unknown reward function, this work introduces the notion of the Bellman score - corresponding to the (vector-valued) gradients of the log probabilities of the true optimal policy with respect to the true unknown reward. Hence, it proposes an algorithm to estimate this quantity vi...
This paper introduces prompt learning to multi-source UDA. A simple two-stage framework is proposed. In the first stage, individual prompts for each source and target pair are learned. In the second stage, Multi-Prompt Alignment (MPA) is proposed to align the learned prompts. The experimental results show the effective...
Recommendation: 8: accept, good paper
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper introduces prompt learning to multi-source UDA. A simple two-stage framework is proposed. In the first stage, individual prompts for each source and target pair are learned. In the second stage, Multi-Prompt Alignment (MPA) is proposed to align the learned prompts. The experimental results show the e...
In the paper, the authors propose SarNet, a method to tackle the hate speech detection task. The authors argue that previous methods tend to judge satirical speech as hate speech, resulting in false positives. Their main goal was to extract the degree of hate and sarcasm from a tweet to get a more realistic comprehensi...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: In the paper, the authors propose SarNet, a method to tackle the hate speech detection task. The authors argue that previous methods tend to judge satirical speech as hate speech, resulting in false positives. Their main goal was to extract the degree of hate and sarcasm from a tweet to get a more realistic com...
The authors propose a method to train an auto-encoder in which the mapping to a latent space is invertible, making the (exact) likelihood tractable and so allowing maximum likelihood training. The method involves augmenting the data with additional variables (obtained from a learnable function of the data) and then run...
Recommendation: 8: accept, good paper
Area: Generative models
Review: The authors propose a method to train an auto-encoder in which the mapping to a latent space is invertible, making the (exact) likelihood tractable and so allowing maximum likelihood training. The method involves augmenting the data with additional variables (obtained from a learnable function of the data) and ...
In this paper, the authors proposed a model named TransEQ for hyper-relational knowledge graph modeling. In the proposed pipeline, they first convert the hyper-relational knowledge graph into normal knowledge graphs by transforming hyper-relations into mediator entities and relations while keeping the structural and se...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: In this paper, the authors proposed a model named TransEQ for hyper-relational knowledge graph modeling. In the proposed pipeline, they first convert the hyper-relational knowledge graph into normal knowledge graphs by transforming hyper-relations into mediator entities and relations while keeping the structura...
This paper proposes an extension of the mixup data augmentation method where all examples in a batch are mixed with coefficients sampled from Dirichlet distribution, and the number of mixup examples can be as many as one wishes with more Dirichlet samples. On top of this, the method further adds ensemble distillation a...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper proposes an extension of the mixup data augmentation method where all examples in a batch are mixed with coefficients sampled from Dirichlet distribution, and the number of mixup examples can be as many as one wishes with more Dirichlet samples. On top of this, the method further adds ensemble distil...
This paper aims to address the resource challenge of federated learning. Instead of training the same server model across all clients, it proposes scaling the server model along the depth dimension instead of the width dimension to meet the resource limitation of each client. It also found that distilling knowledge fro...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper aims to address the resource challenge of federated learning. Instead of training the same server model across all clients, it proposes scaling the server model along the depth dimension instead of the width dimension to meet the resource limitation of each client. It also found that distilling knowl...
This paper presents a probabilistic mixture model representation of the attention mechanism in transformers. The probabilistic representation allows the authors to define priors and posteriors over the mixture distributions and ultimately redefine the transformer as a nonparametric variational autoencoder. They show e...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper presents a probabilistic mixture model representation of the attention mechanism in transformers. The probabilistic representation allows the authors to define priors and posteriors over the mixture distributions and ultimately redefine the transformer as a nonparametric variational autoencoder. The...
To construct the noise probability matrix, existing methods assume that there exists anchor points which belong to a certain class probability one or assume a perfect posterior estimator for the noisy examples. A new transition matrix estimation is proposed that utilizes an alternate optimisation routine of the neural ...
Recommendation: 6: marginally above the acceptance threshold
Area: General Machine Learning
Review: To construct the noise probability matrix, existing methods assume that there exists anchor points which belong to a certain class probability one or assume a perfect posterior estimator for the noisy examples. A new transition matrix estimation is proposed that utilizes an alternate optimisation routine of the...
This paper presents a relatively thorough study of the effect of $\beta$ for the case of hierarchical VAEs. Specifically, the authors study the rate-distortion performance of two-layer VAEs with various combinations of $\beta$s and show that different tasks require different settings of $\beta$s. The paper also presen...
Recommendation: 6: marginally above the acceptance threshold
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: This paper presents a relatively thorough study of the effect of $\beta$ for the case of hierarchical VAEs. Specifically, the authors study the rate-distortion performance of two-layer VAEs with various combinations of $\beta$s and show that different tasks require different settings of $\beta$s. The paper als...
This paper presents a proactive multi-camera collaboration method for 3D multi-person human pose estimation with unmanned aerial vehicles (UAVs). The method is based on multi-agent reinforcement learning that treats cameras as agents and utilizes a world dynamics model to improve the performance of the model. Specifica...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper presents a proactive multi-camera collaboration method for 3D multi-person human pose estimation with unmanned aerial vehicles (UAVs). The method is based on multi-agent reinforcement learning that treats cameras as agents and utilizes a world dynamics model to improve the performance of the model. S...
The paper considers training neural networks with SGD and weight decay. It contains two main theoretical results: (1) When the batch size is small, convergence of SGD to parameters $W$ implies that the parameters matrices $W^{ij}$ are close to low-rank matrices. (2) Unless the dataset is degenerate (i.e., patches of ea...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: The paper considers training neural networks with SGD and weight decay. It contains two main theoretical results: (1) When the batch size is small, convergence of SGD to parameters $W$ implies that the parameters matrices $W^{ij}$ are close to low-rank matrices. (2) Unless the dataset is degenerate (i.e., patch...
This paper presents a method to expand the distance between centers of different classes. However, the contribution is not clear, and the article is an unfinished work. In section 2, nothing is revisited but the title. The writing is terrible. There are too many spelling and grammatical errors in Section 3. In general,...
Recommendation: 1: strong reject
Area: Deep Learning and representational learning
Review: This paper presents a method to expand the distance between centers of different classes. However, the contribution is not clear, and the article is an unfinished work. In section 2, nothing is revisited but the title. The writing is terrible. There are too many spelling and grammatical errors in Section 3. In ...
This paper considers a particular setting for causal discovery from non-stationary time series. In particular, the non-stationary behavior is modeled as stationarity conditioned on a set of state variables. The authors show the identifiability of their model, under the assumption that state variables are observed and ...
Recommendation: 5: marginally below the acceptance threshold
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: This paper considers a particular setting for causal discovery from non-stationary time series. In particular, the non-stationary behavior is modeled as stationarity conditioned on a set of state variables. The authors show the identifiability of their model, under the assumption that state variables are obser...
The paper studies zero-sum polymatrix games where there are several kinds of delayed feedbacks. One such type is random delay, and another type is fixed delay. The paper gives new analyses for single-timescale and two-timescale OMWU proving last iterate convergence for the former and finite-time convergence for the lat...
Recommendation: 6: marginally above the acceptance threshold
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: The paper studies zero-sum polymatrix games where there are several kinds of delayed feedbacks. One such type is random delay, and another type is fixed delay. The paper gives new analyses for single-timescale and two-timescale OMWU proving last iterate convergence for the former and finite-time convergence for...
The manuscript cleverly combines the ability of: 1. theorem provers like Isabelle to accept `sorry` statements, in which unproved statements can be accepted as if true; 2. large language models to fill in masked text. It proposes a 'draft, sketch and prove' methodology that draws on the large corpus of informal (hum...
Recommendation: 8: accept, good paper
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: The manuscript cleverly combines the ability of: 1. theorem provers like Isabelle to accept `sorry` statements, in which unproved statements can be accepted as if true; 2. large language models to fill in masked text. It proposes a 'draft, sketch and prove' methodology that draws on the large corpus of infor...
This paper designs a novel neural ePDO. PDO has wide applications but needs linearity to ensure the translation equivariance. This paper proposes to use an equivariant MLP as the neural ePDO to realize the translation equivariance. The authors give comprehensive theory and experiments. I am impressed by the designed me...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: This paper designs a novel neural ePDO. PDO has wide applications but needs linearity to ensure the translation equivariance. This paper proposes to use an equivariant MLP as the neural ePDO to realize the translation equivariance. The authors give comprehensive theory and experiments. I am impressed by the des...
The paper proposes a novel training method (SABR) that creates models balancing standard and certifiable accuracy. Conceptually, SABR combines the best of adversarial training (using strong heuristic attacks as a lower bound on the worst-case loss) and certified training (using overapproximations of the adversarial out...
Recommendation: 8: accept, good paper
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: The paper proposes a novel training method (SABR) that creates models balancing standard and certifiable accuracy. Conceptually, SABR combines the best of adversarial training (using strong heuristic attacks as a lower bound on the worst-case loss) and certified training (using overapproximations of the adversa...
Inspired by the previous observation that the network is able to learn complex features even when it is biasing to simple features. This paper propose to further investigate how much the complex features are learned compared with the simple features. They find that the simple features are replicated multiple times over...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: Inspired by the previous observation that the network is able to learn complex features even when it is biasing to simple features. This paper propose to further investigate how much the complex features are learned compared with the simple features. They find that the simple features are replicated multiple ti...
This paper studies the top-k classification problem. Different from the existing top-k classification setting, in this paper the labels (including the ground truth label) are ranked. It proposes a three-stage approach to this problem: 1. base classifier construction, 2. training data construction with relabeling, and...
Recommendation: 5: marginally below the acceptance threshold
Area: General Machine Learning
Review: This paper studies the top-k classification problem. Different from the existing top-k classification setting, in this paper the labels (including the ground truth label) are ranked. It proposes a three-stage approach to this problem: 1. base classifier construction, 2. training data construction with relabel...
The authors propose a light link prediction framework ComHG by combining link heuristics and the GNN. Link heuristics in CombHG are encoded into trainable embeddings and combined with the representations produced by a GNN. Strengths of the paper: Well-written and easy to follow. Experiments are conducted on a number of...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: The authors propose a light link prediction framework ComHG by combining link heuristics and the GNN. Link heuristics in CombHG are encoded into trainable embeddings and combined with the representations produced by a GNN. Strengths of the paper: Well-written and easy to follow. Experiments are conducted on a n...
This paper presents new family of open-source code large language models called CodeGen of size upto 16B parameters. This model outperforms Codex 12B model on the HumanEval dataset. The paper also presents a new multi-turn programming dataset where the specification for a single task is divided into multiple sub-tasks ...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: This paper presents new family of open-source code large language models called CodeGen of size upto 16B parameters. This model outperforms Codex 12B model on the HumanEval dataset. The paper also presents a new multi-turn programming dataset where the specification for a single task is divided into multiple su...
The authors established a connection between contrastive learning and the Lovasz theta problem. They show that with certain assumption the original loss function corresponds to Lovasz theta with an empty similarity graph. Then, by considering Lovasz theta on weighted graphs, they designed a new loss function that incop...
Recommendation: 6: marginally above the acceptance threshold
Area: Unsupervised and Self-supervised learning
Review: The authors established a connection between contrastive learning and the Lovasz theta problem. They show that with certain assumption the original loss function corresponds to Lovasz theta with an empty similarity graph. Then, by considering Lovasz theta on weighted graphs, they designed a new loss function th...
This paper presents an offline reinforcement learning approach which is able to capture longer range dependencies than a traditional sequence modeling approaches such as a Decision Transformer (DT). Similar to DT, Decision S4 views RL as a sequence modeling problem, but using the implicit S4 model instead of attention ...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper presents an offline reinforcement learning approach which is able to capture longer range dependencies than a traditional sequence modeling approaches such as a Decision Transformer (DT). Similar to DT, Decision S4 views RL as a sequence modeling problem, but using the implicit S4 model instead of at...
The paper presents a contrastive learning approach to learning hierarchical document representations for multilingual and cross-lingual retrieval. The approach encodes a document in a hierarchical fashion by encoding each sentence in a document into a single fixed-length vector with an XLM-R encoder. The sequence of se...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper presents a contrastive learning approach to learning hierarchical document representations for multilingual and cross-lingual retrieval. The approach encodes a document in a hierarchical fashion by encoding each sentence in a document into a single fixed-length vector with an XLM-R encoder. The sequen...
This paper studied the performance bound when transferring model or policy between HiP-MDPs. The authors introduced some assumptions on the model/policy Lipschitz continuty and established the Lipschitz continuty property of (optimal) value functions in HiP-MDPs. In Sec. 4 & 5, they derived the upper bound when transfe...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper studied the performance bound when transferring model or policy between HiP-MDPs. The authors introduced some assumptions on the model/policy Lipschitz continuty and established the Lipschitz continuty property of (optimal) value functions in HiP-MDPs. In Sec. 4 & 5, they derived the upper bound when...
This paper introduces a novel path regularizer for Generative Flow Networks (GFlowNets, Bengio et al., 2021), based on concepts from Optimal Transport (OT). This regularizer, defined in terms of directed distances in the GFlowNet, is in general expensive to compute. Fortunately, the authors show that this regularizer c...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper introduces a novel path regularizer for Generative Flow Networks (GFlowNets, Bengio et al., 2021), based on concepts from Optimal Transport (OT). This regularizer, defined in terms of directed distances in the GFlowNet, is in general expensive to compute. Fortunately, the authors show that this regul...
This paper proposes an extension to GCN-style GNNs, where the propagation operator is extended with a ω factor. This allows for expressing non-smoothing transformations. The authors show theory backing the design of their model, and then perform a sequence of experiments to show its effectiveness. === Strengths === ...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper proposes an extension to GCN-style GNNs, where the propagation operator is extended with a ω factor. This allows for expressing non-smoothing transformations. The authors show theory backing the design of their model, and then perform a sequence of experiments to show its effectiveness. === Strength...
In the context of multi-agent reinforcement learning, this work addresses the problem of inventory management, where a large number of stock keeping units need to learn how to optimally make replenishment decisions, under a shared inventory capacity. The work contributes the formulation of the shared-resource stochasti...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: In the context of multi-agent reinforcement learning, this work addresses the problem of inventory management, where a large number of stock keeping units need to learn how to optimally make replenishment decisions, under a shared inventory capacity. The work contributes the formulation of the shared-resource s...
The paper presents a new pruning approach called, node-path balancing principle, based on the intuition that both effective nodes and effective paths need to be preserved high such that training sparse neural networks from scratch can be performed well. The method is essentially done by tuning the schedule of (random) ...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: The paper presents a new pruning approach called, node-path balancing principle, based on the intuition that both effective nodes and effective paths need to be preserved high such that training sparse neural networks from scratch can be performed well. The method is essentially done by tuning the schedule of (...
Temporally structured environments involve multiple learning processes operating at different time-scales. The paper provides a unifying view of learning in these temporally structured environments. The authors begin by formalizing the multi-scale learning setup, where the weights are decomposed into sub-weights, each ...
Recommendation: 6: marginally above the acceptance threshold
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: Temporally structured environments involve multiple learning processes operating at different time-scales. The paper provides a unifying view of learning in these temporally structured environments. The authors begin by formalizing the multi-scale learning setup, where the weights are decomposed into sub-weight...
Current SSL representations are pretrained to be invariant to a prespecified fixed set of augmentations. This paper provides a simple way of pretraining representations that can be modified to be invariant to any subset of the pretraining augmentations. They essentially learn a function(al) that maps a set of augmentat...
Recommendation: 6: marginally above the acceptance threshold
Area: Unsupervised and Self-supervised learning
Review: Current SSL representations are pretrained to be invariant to a prespecified fixed set of augmentations. This paper provides a simple way of pretraining representations that can be modified to be invariant to any subset of the pretraining augmentations. They essentially learn a function(al) that maps a set of a...
The authors study model-based reinforcement learning in episodic Markov decision process (MDP) and in particular the exploration-exploitation dilemma. Precisely they consider Posterior sampling reinforcement learning (PSRL) under approximate inference. They show that PSRL can be sub-optimal under approximate inference...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The authors study model-based reinforcement learning in episodic Markov decision process (MDP) and in particular the exploration-exploitation dilemma. Precisely they consider Posterior sampling reinforcement learning (PSRL) under approximate inference. They show that PSRL can be sub-optimal under approximate i...
This paper proposes to use adaptive pairwise critics and adaptive asymptotic maximum entropy to address the estimation errors. Pros: (1) The paper writing is clear. (2) The experiments show the benefit of the proposed algorithm in several tasks. Cons: (1) The main concern I have is why a per-state adaptive variable/w...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper proposes to use adaptive pairwise critics and adaptive asymptotic maximum entropy to address the estimation errors. Pros: (1) The paper writing is clear. (2) The experiments show the benefit of the proposed algorithm in several tasks. Cons: (1) The main concern I have is why a per-state adaptive va...
The authors propose low-precision training techniques to lower the number of bits to represent parameters, gradients, and moments. SGDM optimizer is assumed while low-precision training can improve the model accuracy by using two main principles: unbiased stochastic quantization and microbatching. Overall, memory consu...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: The authors propose low-precision training techniques to lower the number of bits to represent parameters, gradients, and moments. SGDM optimizer is assumed while low-precision training can improve the model accuracy by using two main principles: unbiased stochastic quantization and microbatching. Overall, memo...
This paper focuses on producing strong and diverse policies in Dec-POMDPs. One important aspect of the proposed method is to prevent the adversary agent from identifying whether it is self-playing or cross-playing by randomizing between the two scenarios. It is also important to bear in mind that in the studied setting...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper focuses on producing strong and diverse policies in Dec-POMDPs. One important aspect of the proposed method is to prevent the adversary agent from identifying whether it is self-playing or cross-playing by randomizing between the two scenarios. It is also important to bear in mind that in the studied...
This paper presents an approach to quantify the uncertainty in value based RL algorithms such as TD learning and Q-learning. The approach is based on prior work that uses a state-space modeling approach to derive a Kalman filtering algorithm for TD learning (KTD and KOVA). Unless the function approximation is linear a...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper presents an approach to quantify the uncertainty in value based RL algorithms such as TD learning and Q-learning. The approach is based on prior work that uses a state-space modeling approach to derive a Kalman filtering algorithm for TD learning (KTD and KOVA). Unless the function approximation is ...
In this paper, the authors first theoretically present the bottleneck of graph transformers’ performance with depth. The authors then propose a simple but effective substructure token based local attention mechanism in graph transformer, promoting focus on local substructure features of deeper graph transformer. Empiri...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: In this paper, the authors first theoretically present the bottleneck of graph transformers’ performance with depth. The authors then propose a simple but effective substructure token based local attention mechanism in graph transformer, promoting focus on local substructure features of deeper graph transformer...
The paper studies the depth requirements for exactly representing the maximum of $n$ inputs using networks with integer weights. They show that $\lceil \log_2 n \rceil$ depth is necessary. Note that the simple binary tree construction that computes maximum of two inputs at a time achieves this depth. For this class of ...
Recommendation: 8: accept, good paper
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: The paper studies the depth requirements for exactly representing the maximum of $n$ inputs using networks with integer weights. They show that $\lceil \log_2 n \rceil$ depth is necessary. Note that the simple binary tree construction that computes maximum of two inputs at a time achieves this depth. For this c...
This paper uses the Fourier transform to learn neural operators that can handle long-range spatial dependencies. By factorizing the transform, using better residual connections, and improving the training setup, the proposed F-FNO outperforms the state of the art on PDEs on a variety of geometries and domains. Pros: ...
Recommendation: 6: marginally above the acceptance threshold
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: This paper uses the Fourier transform to learn neural operators that can handle long-range spatial dependencies. By factorizing the transform, using better residual connections, and improving the training setup, the proposed F-FNO outperforms the state of the art on PDEs on a variety of geometries and domains. ...
This paper proposes a method that learns disentangled representations of objects determined by interaction-relevant and interaction-irrelevant latents. The proposed method is based on OP3, but with a formulation that encourages the desired disentanglement. In experiments, the authors show that the interaction-relevant ...
Recommendation: 6: marginally above the acceptance threshold
Area: Generative models
Review: This paper proposes a method that learns disentangled representations of objects determined by interaction-relevant and interaction-irrelevant latents. The proposed method is based on OP3, but with a formulation that encourages the desired disentanglement. In experiments, the authors show that the interaction-r...