review
stringlengths
5
16.6k
score
stringclasses
5 values
area
stringclasses
12 values
text
stringlengths
31
5.65k
This paper presents an early attempt at learning geometric lengths from trails and explores how to transfer the learned geometric knowledge to solve a different task. Besides offering a problem formulation, this paper presents an evaluation framework based on finding evaluation correlations against ground truth lengths...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper presents an early attempt at learning geometric lengths from trails and explores how to transfer the learned geometric knowledge to solve a different task. Besides offering a problem formulation, this paper presents an evaluation framework based on finding evaluation correlations against ground truth...
This paper proposes to use sinusoidal embeddings to represent m/z and intensity values when modeling metabolomics mass spectrometry data using deep learning models. The idea is sensible though not particularly novel. Such embeddings have been used previously for mass spectrometry data (as referenced in the related wo...
Recommendation: 5: marginally below the acceptance threshold
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: This paper proposes to use sinusoidal embeddings to represent m/z and intensity values when modeling metabolomics mass spectrometry data using deep learning models. The idea is sensible though not particularly novel. Such embeddings have been used previously for mass spectrometry data (as referenced in the re...
The paper studies how to learn models that satisfy various fairness desiderata (e.g., demographic parity and equalized odds) while satisfying differential privacy. Like prior work, it writes down a loss function encoding some weighted combination of accuracy and fairness constraints and aims to develop a private method...
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 how to learn models that satisfy various fairness desiderata (e.g., demographic parity and equalized odds) while satisfying differential privacy. Like prior work, it writes down a loss function encoding some weighted combination of accuracy and fairness constraints and aims to develop a privat...
This paper proposes a novel conformal prediction method for time-series data, called Copula Conformal Prediction for multi-step time series forecasting (CopulaCPTS), for uncertainty quantification. In particular, the paper uses the concept of “copula” from statistics; the copula is a joint CDF on data, which fully capt...
Recommendation: 3: reject, not good enough
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: This paper proposes a novel conformal prediction method for time-series data, called Copula Conformal Prediction for multi-step time series forecasting (CopulaCPTS), for uncertainty quantification. In particular, the paper uses the concept of “copula” from statistics; the copula is a joint CDF on data, which fu...
This paper shows a few shot GAN by embed latent factor into an existing GAN to transfer to a new style. This paper tries to mix pre-trained GAN with few shot learning. Their contribution can be concluded as: -propose a simple procedure to utilize a GAN trained on large-scale source-data to generate samples from a ta...
Recommendation: 8: accept, good paper
Area: Generative models
Review: This paper shows a few shot GAN by embed latent factor into an existing GAN to transfer to a new style. This paper tries to mix pre-trained GAN with few shot learning. Their contribution can be concluded as: -propose a simple procedure to utilize a GAN trained on large-scale source-data to generate samples f...
This paper proposes a method which combines the benefits of iterative optimization and a learned encoder-decoder for the task of image steganography. Similar to the style of LISTA, the paper learns individual optimization blocks in an E2E fashion while applying the blocks iteratively at inference time. Experiment resul...
Recommendation: 8: accept, good paper
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper proposes a method which combines the benefits of iterative optimization and a learned encoder-decoder for the task of image steganography. Similar to the style of LISTA, the paper learns individual optimization blocks in an E2E fashion while applying the blocks iteratively at inference time. Experime...
The authors propose a new DST algorithm that utilizes only sampled connections to reduce peak memory usage while previous DST algorithms rely on computing gradients of all connections. For some selected models, the proposed method can obtain similar model accuracy using only 4% as a size of sampled connections compared...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: The authors propose a new DST algorithm that utilizes only sampled connections to reduce peak memory usage while previous DST algorithms rely on computing gradients of all connections. For some selected models, the proposed method can obtain similar model accuracy using only 4% as a size of sampled connections ...
The aim of this paper is the generation of molecules with desired chemical and biological properties learning the joint distribution of molecules and properties . In order to achieve this the authors propose an energy based generative model that augments a top down generative model (conditional autoregressive model) wi...
Recommendation: 5: marginally below the acceptance threshold
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: The aim of this paper is the generation of molecules with desired chemical and biological properties learning the joint distribution of molecules and properties . In order to achieve this the authors propose an energy based generative model that augments a top down generative model (conditional autoregressive m...
The paper aims to learn better visual representation by leveraging both contrastive learning (CL) and masked image modeling (MIM). The authors claim that simultaneously performing CL and MIM pertaining will lead to worse results. To mitigate this issue, the paper proposes Layer Grafted Pre-training, which finetunes a p...
Recommendation: 5: marginally below the acceptance threshold
Area: Unsupervised and Self-supervised learning
Review: The paper aims to learn better visual representation by leveraging both contrastive learning (CL) and masked image modeling (MIM). The authors claim that simultaneously performing CL and MIM pertaining will lead to worse results. To mitigate this issue, the paper proposes Layer Grafted Pre-training, which finet...
Fourier Neural Operator (Li 2020) has become a popular tool in solving PDEs numerically. The main contribution of the paper is to replace the classic Fourier Layer in FNO with the quantum Fourier layer. The authors argue that the proposed algorithm is provably substantially faster (using quantum hardware) than the clas...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: Fourier Neural Operator (Li 2020) has become a popular tool in solving PDEs numerically. The main contribution of the paper is to replace the classic Fourier Layer in FNO with the quantum Fourier layer. The authors argue that the proposed algorithm is provably substantially faster (using quantum hardware) than ...
This paper investigated the possibility of decomposing the trust region surrogate over joint policies into the respective surrogates for each individual agent's policies for cooperative multi-agent reinforcement learning. The reported experiment results show that the newly developed DPO algorithm based on the decompose...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper investigated the possibility of decomposing the trust region surrogate over joint policies into the respective surrogates for each individual agent's policies for cooperative multi-agent reinforcement learning. The reported experiment results show that the newly developed DPO algorithm based on the d...
The paper proposes a diversified query strategy for an anomaly detector that can be applied in an active learning setup. The querying strategy is based on querying diverse cluster centers seeded by k-means++. 1. Abstract: "However, correctly identifying anomalies requires an estimate of the fraction of anomalies in the...
Recommendation: 3: reject, not good enough
Area: Unsupervised and Self-supervised learning
Review: The paper proposes a diversified query strategy for an anomaly detector that can be applied in an active learning setup. The querying strategy is based on querying diverse cluster centers seeded by k-means++. 1. Abstract: "However, correctly identifying anomalies requires an estimate of the fraction of anomalie...
The paper proposes an approach to estimate feature importance. Multiple shallow mask models are trained with different random seeds. These resulting weights and then averaged to produce a global model that can be inferior in accuracy but better identify the global feature importance. I found the proposed approach inte...
Recommendation: 3: reject, not good enough
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: The paper proposes an approach to estimate feature importance. Multiple shallow mask models are trained with different random seeds. These resulting weights and then averaged to produce a global model that can be inferior in accuracy but better identify the global feature importance. I found the proposed appro...
The authors introduce a method to learn Lagrangian dynamics from images. In line with previous work, the authors simplify the learning problem by: (1) representing the Lagrangian as the difference in kinetic and potential energy (both learned), and (2) using Cartesian coordinates to represent the positions of the syste...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The authors introduce a method to learn Lagrangian dynamics from images. In line with previous work, the authors simplify the learning problem by: (1) representing the Lagrangian as the difference in kinetic and potential energy (both learned), and (2) using Cartesian coordinates to represent the positions of t...
The paper tackles the problem experiments reproducibility with specific reference to inferential reproducibility which proposes to interpret the variation of performance values as due to the following factors; data characteristics, meta-parameter settings, includng also their interactions. The paper starts from the rat...
Recommendation: 8: accept, good paper
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: The paper tackles the problem experiments reproducibility with specific reference to inferential reproducibility which proposes to interpret the variation of performance values as due to the following factors; data characteristics, meta-parameter settings, includng also their interactions. The paper starts from...
The paper studies the the phenomenon of "Edge-of-Statility" (EOS) training dynamics and analyses the gradient dynamics on a simple example (the example is simple but the analysis is quite complicated). The EOS of training dynamics, initially observed by [Cohen et al. 2021], refers the phenomenon that when running grad...
Recommendation: 5: marginally below the acceptance threshold
Area: Optimization (eg, convex and non-convex optimization)
Review: The paper studies the the phenomenon of "Edge-of-Statility" (EOS) training dynamics and analyses the gradient dynamics on a simple example (the example is simple but the analysis is quite complicated). The EOS of training dynamics, initially observed by [Cohen et al. 2021], refers the phenomenon that when runn...
To tackle the problem of joint luminance enhancement and denoising in low-light imaging, the author proposed 1) a new network architecture, UHDFour, that utilizes authors' observations on noise and signal luminance's relation in the amplitude and phase images in the frequency domain, and 2) a new dataset, UHD-LL, that ...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: To tackle the problem of joint luminance enhancement and denoising in low-light imaging, the author proposed 1) a new network architecture, UHDFour, that utilizes authors' observations on noise and signal luminance's relation in the amplitude and phase images in the frequency domain, and 2) a new dataset, UHD-L...
The paper proposes to use a planner solving a locally quadratic program to improve the action selection during the rollouts. The better action selection should improve the learning performance and enable the agent to achieve a higher reward with fewer samples. The experiments show this improved sample efficiency and th...
Recommendation: 8: accept, good paper
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The paper proposes to use a planner solving a locally quadratic program to improve the action selection during the rollouts. The better action selection should improve the learning performance and enable the agent to achieve a higher reward with fewer samples. The experiments show this improved sample efficienc...
This paper explores extending the idea of fast weight with outer-product based to human-interpretable domains beyond network weight space, and examines the idea with the example of natural image generation. The slow-weight network, now termed Fast Weight Painter now progressively refines the pixel values of a 3D image ...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper explores extending the idea of fast weight with outer-product based to human-interpretable domains beyond network weight space, and examines the idea with the example of natural image generation. The slow-weight network, now termed Fast Weight Painter now progressively refines the pixel values of a 3...
The submission provides an extensive empirical study on supervised (SL), unsupervised (autoencoder, AE), and self-supervised (SSL) representation learning algorithms in a distribution shift scenario. The key contribution is comparing these algorithms when the representation is learned on the source task while the class...
Recommendation: 8: accept, good paper
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: The submission provides an extensive empirical study on supervised (SL), unsupervised (autoencoder, AE), and self-supervised (SSL) representation learning algorithms in a distribution shift scenario. The key contribution is comparing these algorithms when the representation is learned on the source task while t...
In this paper, the authors improve multi-view representation learning by splitting documents and aligning viewer tokens along with different parts. The experiments conducted on three datasets demonstrate that the proposed CAMVR performs better than MVR. The analysis also shows that CAMVR has better interpretability. S...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: In this paper, the authors improve multi-view representation learning by splitting documents and aligning viewer tokens along with different parts. The experiments conducted on three datasets demonstrate that the proposed CAMVR performs better than MVR. The analysis also shows that CAMVR has better interpretabi...
This paper proposes an end-to-end color quantization transformer that is able to discover the color naming system under the need of perception and machine. The framework contains two branches, respectively for structure mining and color localization. The proposed CQFormer quantizes the color space of the input image an...
Recommendation: 6: marginally above the acceptance threshold
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: This paper proposes an end-to-end color quantization transformer that is able to discover the color naming system under the need of perception and machine. The framework contains two branches, respectively for structure mining and color localization. The proposed CQFormer quantizes the color space of the input ...
This paper proposes group-wise verifiable coded computing with coding techniques and group-wise verification to tackle adversarial workers and the effects of stragglers. The authors demonstrate the performance of group-wise verifiable coded computing in term of overall processing time and verification time. (1)Accordin...
Recommendation: 3: reject, not good enough
Area: General Machine Learning
Review: This paper proposes group-wise verifiable coded computing with coding techniques and group-wise verification to tackle adversarial workers and the effects of stragglers. The authors demonstrate the performance of group-wise verifiable coded computing in term of overall processing time and verification time. (1)...
The paper presents generalization problems of the network in performing the low-level vision task, i.e. authors perform a study by performing the different deraining experiments and convey that when trained with a less complex background, networks learn the less complex element in the image content and degradation to r...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper presents generalization problems of the network in performing the low-level vision task, i.e. authors perform a study by performing the different deraining experiments and convey that when trained with a less complex background, networks learn the less complex element in the image content and degradat...
This paper focuses on learning a robust deepfake detector against adversarial attacks. The authors propose a method named Disjoint Deepfake Detection (D3). The method is motivated by the observation that redundancy exists in the frequency space, which means fewer signals are enough to make correct predictions. Based on...
Recommendation: 5: marginally below the acceptance threshold
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: This paper focuses on learning a robust deepfake detector against adversarial attacks. The authors propose a method named Disjoint Deepfake Detection (D3). The method is motivated by the observation that redundancy exists in the frequency space, which means fewer signals are enough to make correct predictions. ...
This paper presents a neural program-based method for an abstract reasoning (ARC from Chollet 2019) style task. The model contains an object-centric representation layer (based on slot attention I believe), a controller (encoding the examples and predicting the program), and an executor (which takes the program represe...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper presents a neural program-based method for an abstract reasoning (ARC from Chollet 2019) style task. The model contains an object-centric representation layer (based on slot attention I believe), a controller (encoding the examples and predicting the program), and an executor (which takes the program...
This paper introduces a PLL approach named ML-PLL to address a more challenging setting–competitive label noise. It addresses the competitive noisy labels by following components: label correction, prediction network training with mutual learning, and transformation based label association learning, which makes couple ...
Recommendation: 8: accept, good paper
Area: General Machine Learning
Review: This paper introduces a PLL approach named ML-PLL to address a more challenging setting–competitive label noise. It addresses the competitive noisy labels by following components: label correction, prediction network training with mutual learning, and transformation based label association learning, which makes...
The paper proposes a latent variable model to capture concept-specific laws from images/videos. The laws are encoded as Latent Random Functions (specifically, Neural Processes), and can be composed with one another. Strengths: - Multiple datasets with different focus - Illustration of compositionalilty - Demonstration...
Recommendation: 6: marginally above the acceptance threshold
Area: Generative models
Review: The paper proposes a latent variable model to capture concept-specific laws from images/videos. The laws are encoded as Latent Random Functions (specifically, Neural Processes), and can be composed with one another. Strengths: - Multiple datasets with different focus - Illustration of compositionalilty - Demon...
This paper addresses the problem of reward-free reinforcement learning under (possibly mismatching) cost constraints in both the exploration phase and the planning phase. Crucially, the paper shows how to exploit the knowledge of a safe baseline policy to achieve zero constraints violations while matching the sample co...
Recommendation: 8: accept, good paper
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: This paper addresses the problem of reward-free reinforcement learning under (possibly mismatching) cost constraints in both the exploration phase and the planning phase. Crucially, the paper shows how to exploit the knowledge of a safe baseline policy to achieve zero constraints violations while matching the s...
The paper propose a method for explaining intermediate activations of a neural network using concepts. In a nutshell, f(x) and g(x) are the networks that take activations x from an intermediate layer as input and respectively predict class and concept. The relevance of a concept c to a class y is measured using the pro...
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 propose a method for explaining intermediate activations of a neural network using concepts. In a nutshell, f(x) and g(x) are the networks that take activations x from an intermediate layer as input and respectively predict class and concept. The relevance of a concept c to a class y is measured using...
The paper proposed a new method for complex and large action space. The proposed method uses listwise RL for the retrieval task which is further used for action selection. Strengths: - The paper motivates the problem very well. The abstract and introduction are highly aligned with the problem targeted. - The paper us...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The paper proposed a new method for complex and large action space. The proposed method uses listwise RL for the retrieval task which is further used for action selection. Strengths: - The paper motivates the problem very well. The abstract and introduction are highly aligned with the problem targeted. - The ...
The authors aim to propose a framework for unsupervised domain adaptation of time series by doing a weird combination of existing models without good justification/motivation for what they introduce. Specifically, they combine the model introduced in “domain adversarial training of neural networks” by a type of contra...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: The authors aim to propose a framework for unsupervised domain adaptation of time series by doing a weird combination of existing models without good justification/motivation for what they introduce. Specifically, they combine the model introduced in “domain adversarial training of neural networks” by a type o...
This paper focuses on refining the semantic prototypes in ZSL. The authors top a V2SM network to the generator, mapping visual features to a semantic-related space. On the other hand, they transfer the semantic embeddings by another VOPE module. The outputs of V2SM and VOPE are aligned by cosine similarity and l2 losse...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper focuses on refining the semantic prototypes in ZSL. The authors top a V2SM network to the generator, mapping visual features to a semantic-related space. On the other hand, they transfer the semantic embeddings by another VOPE module. The outputs of V2SM and VOPE are aligned by cosine similarity and ...
The authors investigate the classification problem with the penalization of the difference in conditional accuracy. They provide a tight characterization between the empirical DCA and variance of 0-1 losses. By combining it with the result of Xie et al., they derive the group-wise distributionally robust optimization f...
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 authors investigate the classification problem with the penalization of the difference in conditional accuracy. They provide a tight characterization between the empirical DCA and variance of 0-1 losses. By combining it with the result of Xie et al., they derive the group-wise distributionally robust optimi...
This paper describes an approach for pose estimation for objects with symmetries. The approach leverages SO(3)-equivariance to predict distributions over 3D rotations from single images. Image features are obtained from a pre-trained ResNet. These features are orthographically projected to the sphere where the features...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: This paper describes an approach for pose estimation for objects with symmetries. The approach leverages SO(3)-equivariance to predict distributions over 3D rotations from single images. Image features are obtained from a pre-trained ResNet. These features are orthographically projected to the sphere where the ...
The paper tackles the problem of endowing Transformers with the ability to encode information about the past via recurrence. The proposed architecture can leverage the recurrent connections to improve the sample efficiency while maintaining expressivity due to the use of self-attention. Strengths: - The paper is easy...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper tackles the problem of endowing Transformers with the ability to encode information about the past via recurrence. The proposed architecture can leverage the recurrent connections to improve the sample efficiency while maintaining expressivity due to the use of self-attention. Strengths: - The paper...
The authors in this paper discuss the pros and cons of how variance and bias affect gradient estimator, to better understand how gradients are approximated by brains. The authors argue that while bias and variance generally affect training data learning negatively, some amount of bias, variance can be beneficial for ge...
Recommendation: 5: marginally below the acceptance threshold
Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces)
Review: The authors in this paper discuss the pros and cons of how variance and bias affect gradient estimator, to better understand how gradients are approximated by brains. The authors argue that while bias and variance generally affect training data learning negatively, some amount of bias, variance can be beneficia...
This paper presents a GNN-based framework for graph-level anomaly detection, GmapAD. Specifically, GmapAD encapsulate graph structures and node features into node representations and selects the best subset of informative nodes in all possible nodes in graphs for mapping graphs into the new feature space. Then normal a...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper presents a GNN-based framework for graph-level anomaly detection, GmapAD. Specifically, GmapAD encapsulate graph structures and node features into node representations and selects the best subset of informative nodes in all possible nodes in graphs for mapping graphs into the new feature space. Then ...
The paper advocates for an offline training mechanism for memristor devices and proposes a customized training approach (employing noise-aware training and batch normalization) for such devices. The results across a set of small-sized NNs show that using BN and this hardware-restriction-aware training improves the fina...
Recommendation: 3: reject, not good enough
Area: General Machine Learning
Review: The paper advocates for an offline training mechanism for memristor devices and proposes a customized training approach (employing noise-aware training and batch normalization) for such devices. The results across a set of small-sized NNs show that using BN and this hardware-restriction-aware training improves ...
The paper under review proposes a method of selecting a single sound source from a mixture of sounds in a video via a text description of the visual component of the video. The system can be trained on unlabeled data, aka unsupervised training. This is a novel configuration of using a pre-trained audio-visual correspon...
Recommendation: 8: accept, good paper
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper under review proposes a method of selecting a single sound source from a mixture of sounds in a video via a text description of the visual component of the video. The system can be trained on unlabeled data, aka unsupervised training. This is a novel configuration of using a pre-trained audio-visual c...
The paper presents a novel way to train autoregressive models and to sample from them. The authors argue that the standard maximum likelihood approach is overly sensitive to tiny perturbations, assigning low likelihoods to images that have been modified in a way that is Imperceivable to humans. Additionally, they argue...
Recommendation: 5: marginally below the acceptance threshold
Area: Generative models
Review: The paper presents a novel way to train autoregressive models and to sample from them. The authors argue that the standard maximum likelihood approach is overly sensitive to tiny perturbations, assigning low likelihoods to images that have been modified in a way that is Imperceivable to humans. Additionally, th...
This paper observes that the activation distributions are different for clean inputs and backdoor samples. It hence proposes to change activation values of inputs such that the predictions of backdoor samples can be corrected. Particularly, this paper utilizes existing trigger inversion methods to find a set of suspici...
Recommendation: 5: marginally below the acceptance threshold
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: This paper observes that the activation distributions are different for clean inputs and backdoor samples. It hence proposes to change activation values of inputs such that the predictions of backdoor samples can be corrected. Particularly, this paper utilizes existing trigger inversion methods to find a set of...
This paper proposes an approach to certify whether a given machine learning model achieves super-human performance when the dataset labels are (possibly erroneous) human annotations and not (unobserved) ground-truth labels. The proposed approached relies on proving the following results (given $K$ human annotators and ...
Recommendation: 8: accept, good paper
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: This paper proposes an approach to certify whether a given machine learning model achieves super-human performance when the dataset labels are (possibly erroneous) human annotations and not (unobserved) ground-truth labels. The proposed approached relies on proving the following results (given $K$ human annotat...
The paper proposes a self-supervised learning objective using a contrastive loss to learn a medium/language for communication between agents to complete a task (in a decentralized training setting). Similar to Lin et al. (2021), the messages here are proposed to be encodings of observations. To learn these encodings/ m...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The paper proposes a self-supervised learning objective using a contrastive loss to learn a medium/language for communication between agents to complete a task (in a decentralized training setting). Similar to Lin et al. (2021), the messages here are proposed to be encodings of observations. To learn these enco...
The paper proposes the use of few-shot learning together with the use of medical ontologies under the prototypical network architecture for new drug recommendation. The use of few-shot learning and ontologies is motivated by the fact that data related to new drugs is limited. Several tricks are suggested, including the...
Recommendation: 5: marginally below the acceptance threshold
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: The paper proposes the use of few-shot learning together with the use of medical ontologies under the prototypical network architecture for new drug recommendation. The use of few-shot learning and ontologies is motivated by the fact that data related to new drugs is limited. Several tricks are suggested, inclu...
This paper introduces a new data augmentation method for Chinese disease normalization dataset after analysing the unnormalized disease name and standard disease name. The main contribution is a novel data augmentation method adapted to a new dataset, which consists of axis-word replacement and multi-grain aggregation...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper introduces a new data augmentation method for Chinese disease normalization dataset after analysing the unnormalized disease name and standard disease name. The main contribution is a novel data augmentation method adapted to a new dataset, which consists of axis-word replacement and multi-grain agg...
This paper proposes an unsupervised method for image denoise. The noise model is generated by a residual image and a random mask. With the noise model, the input and target of the network are generated from a single noisy image. Experiments are conducted on both synthetic and real-world datasets. Strength: 1. This pape...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper proposes an unsupervised method for image denoise. The noise model is generated by a residual image and a random mask. With the noise model, the input and target of the network are generated from a single noisy image. Experiments are conducted on both synthetic and real-world datasets. Strength: 1. T...
The authors propose a generate-and-test approach to discovering auxiliary tasks in RL. They form a multi-headed network where each head outputs a (general) value function for each task. At the last layer, the gradient update is only applied to the weights between each head and each dedicated set of features, and the re...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The authors propose a generate-and-test approach to discovering auxiliary tasks in RL. They form a multi-headed network where each head outputs a (general) value function for each task. At the last layer, the gradient update is only applied to the weights between each head and each dedicated set of features, an...
This paper proposes the SPC framework that combines automatic curriculum learning (ACL) and hierarchical MARL to learn cooperative behaviors in complex multi-agent domains. Specifically, this paper leverages a multi-armed bandit algorithm for ACL while addressing the following challenges: 1) the varying number of agent...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper proposes the SPC framework that combines automatic curriculum learning (ACL) and hierarchical MARL to learn cooperative behaviors in complex multi-agent domains. Specifically, this paper leverages a multi-armed bandit algorithm for ACL while addressing the following challenges: 1) the varying number ...
Sharpness-aware minimization (SAM), which searches for flat minima by min-max optimization, has been shown to be useful in improving model generalization. However, SAM requires two gradient evaluations per iteration which makes it cost twice more expensive as SGD. One way to reduce this cost is mixing SAM with SGD in a...
Recommendation: 6: marginally above the acceptance threshold
Area: Optimization (eg, convex and non-convex optimization)
Review: Sharpness-aware minimization (SAM), which searches for flat minima by min-max optimization, has been shown to be useful in improving model generalization. However, SAM requires two gradient evaluations per iteration which makes it cost twice more expensive as SGD. One way to reduce this cost is mixing SAM with ...
The paper proposed a deep learning based reinforcement active learning method for image classification. The approach uses the deep-Q network for learning to pick informative data points. The contributions are a method that allows for the selection of multiple data points in each round, to be more amenable to batch base...
Recommendation: 3: reject, not good enough
Area: General Machine Learning
Review: The paper proposed a deep learning based reinforcement active learning method for image classification. The approach uses the deep-Q network for learning to pick informative data points. The contributions are a method that allows for the selection of multiple data points in each round, to be more amenable to ba...
This paper produces more accurate physics-informed neural networks (PINNs) by including adversarial training through a discriminator which is rewarded for predicting PINN errors. Strengths: • Claims are supported by reported results. • Concept is sound and sensible. • Making PINNs more accurate has good imp...
Recommendation: 6: marginally above the acceptance threshold
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: This paper produces more accurate physics-informed neural networks (PINNs) by including adversarial training through a discriminator which is rewarded for predicting PINN errors. Strengths: • Claims are supported by reported results. • Concept is sound and sensible. • Making PINNs more accurate has ...
This paper studies the retraining steps in iterative magnitude pruning from the "budgeted training" perspective. This is used to derive an efficient learning rate schedule for the retraining phase. ### Strengths - The paper does a very good job of explaining existing work and positioning itself in that context. This m...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: This paper studies the retraining steps in iterative magnitude pruning from the "budgeted training" perspective. This is used to derive an efficient learning rate schedule for the retraining phase. ### Strengths - The paper does a very good job of explaining existing work and positioning itself in that context...
The paper proposes Implicit Language Q-Learning (ILQL), a RL method, adapted from Implicit Q-learning, which can learn controlled language generation from a reward signal and a large-scale dataset of mixed quality in an offline fashion. The authors empirically validate their method on a dialogue task and reddit comment...
Recommendation: 8: accept, good paper
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper proposes Implicit Language Q-Learning (ILQL), a RL method, adapted from Implicit Q-learning, which can learn controlled language generation from a reward signal and a large-scale dataset of mixed quality in an offline fashion. The authors empirically validate their method on a dialogue task and reddit...
This work proposes a practical method to jointly estimate the low dimension embedding in Euclidean space and the correspondences between data sets, which can be viewed as the alignment extension of classical embedding work by Multidimensional Scaling (MDS). Unlike some previous works in this domain, the proposed method...
Recommendation: 6: marginally above the acceptance threshold
Area: General Machine Learning
Review: This work proposes a practical method to jointly estimate the low dimension embedding in Euclidean space and the correspondences between data sets, which can be viewed as the alignment extension of classical embedding work by Multidimensional Scaling (MDS). Unlike some previous works in this domain, the propose...
The authors test the hypothesis of if memory-free navigation-based agents build maps of their environment. They use blind agents trained to perform PointNav, which are effectively operating in grid-world environments. They show very convincing and creative experiments controlling for the memory length of the agent, pre...
Recommendation: 8: accept, good paper
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The authors test the hypothesis of if memory-free navigation-based agents build maps of their environment. They use blind agents trained to perform PointNav, which are effectively operating in grid-world environments. They show very convincing and creative experiments controlling for the memory length of the ag...
Optimal transport (OT) distances (a.k.a. Wasserstein's distances) are a powerful computational tool to compare probability distributions and they play an increasingly preponderant role in machine learning, statistics, and computer vision. Since computing OT distances involves a linear program, which takes super-cubic t...
Recommendation: 8: accept, good paper
Area: Optimization (eg, convex and non-convex optimization)
Review: Optimal transport (OT) distances (a.k.a. Wasserstein's distances) are a powerful computational tool to compare probability distributions and they play an increasingly preponderant role in machine learning, statistics, and computer vision. Since computing OT distances involves a linear program, which takes super...
The paper shows convergence to an ε-second-order stationary point for zeroth-order methods. They substantially improve existing bounds, achieving ε^-7/4 dependence on ε and quasi-linear dependence on problem dimension. They present two algorithms: the first algorithm and its analysis are based on the Jin et al’18. The ...
Recommendation: 6: marginally above the acceptance threshold
Area: Optimization (eg, convex and non-convex optimization)
Review: The paper shows convergence to an ε-second-order stationary point for zeroth-order methods. They substantially improve existing bounds, achieving ε^-7/4 dependence on ε and quasi-linear dependence on problem dimension. They present two algorithms: the first algorithm and its analysis are based on the Jin et al’...
This paper studies how geometry of the loss landscape changes throughout training by studying the how gradient vectors of consecutive training steps correlate with each other: high correlations across timestep windows imply a smooth geometry while alternating gradient directions imply a non-convex, “zigzag” geometry. ...
Recommendation: 6: marginally above the acceptance threshold
Area: Optimization (eg, convex and non-convex optimization)
Review: This paper studies how geometry of the loss landscape changes throughout training by studying the how gradient vectors of consecutive training steps correlate with each other: high correlations across timestep windows imply a smooth geometry while alternating gradient directions imply a non-convex, “zigzag” geo...
This paper applied the implicit differentiation to the equilibrium state of the VIN-based path planning pipelines. Since the forward computation of VIN is effectively solving a fixed point of the Bellman equation, it is natural to treat this process as a deep equilibrium model (DEQ Bai et al. 2019), which can backpropa...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper applied the implicit differentiation to the equilibrium state of the VIN-based path planning pipelines. Since the forward computation of VIN is effectively solving a fixed point of the Bellman equation, it is natural to treat this process as a deep equilibrium model (DEQ Bai et al. 2019), which can b...
This work performs reward decomposition with a focus on Input-Driven MDPs. It presents CrystalBox, which creates post-hoc explanations for blackbox RL agents in input-driven environments. This method is evaluated on two tasks. This work uses reward decomposition, which is a promising subtype of XRL methods. It highligh...
Recommendation: 3: reject, not good enough
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: This work performs reward decomposition with a focus on Input-Driven MDPs. It presents CrystalBox, which creates post-hoc explanations for blackbox RL agents in input-driven environments. This method is evaluated on two tasks. This work uses reward decomposition, which is a promising subtype of XRL methods. It ...
Probabilistic circuits (PCs) are a unified framework that encompasses a number of tractable probabilistic models, such as arithmetic circuits and sum-product networks. While recent work has been able to scale them by means of parallelization and vectorization, their performance does not scale with the number of paramet...
Recommendation: 8: accept, good paper
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: Probabilistic circuits (PCs) are a unified framework that encompasses a number of tractable probabilistic models, such as arithmetic circuits and sum-product networks. While recent work has been able to scale them by means of parallelization and vectorization, their performance does not scale with the number of...
The draft proposed an approach for efficient personalized FL by adaptively and efficiently learning sparse local models(a subset of the global one) with a shared global model. With a lightweight trainable gating layer, the proposed algorithm enables clients to reach their full potential in model capacity by generatin...
Recommendation: 6: marginally above the acceptance threshold
Area: General Machine Learning
Review: The draft proposed an approach for efficient personalized FL by adaptively and efficiently learning sparse local models(a subset of the global one) with a shared global model. With a lightweight trainable gating layer, the proposed algorithm enables clients to reach their full potential in model capacity by g...
This paper proposes a Moral Awareness Adaptive Learning (MorAL) to enhance the morality capacity of an agent using a plugin moral-aware learning model. The paper develops a mixture policy to interleave task learning and morality learning. For each episode, the moral policy decodes a set of valid action candidates...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper proposes a Moral Awareness Adaptive Learning (MorAL) to enhance the morality capacity of an agent using a plugin moral-aware learning model. The paper develops a mixture policy to interleave task learning and morality learning. For each episode, the moral policy decodes a set of valid action ca...
The paper focuses on a subset of decision making problems particularly relevant to real world applications: learning _when to act_ along with the appropriate action to execute. While this problem can be framed as a standard RL problem with no-op action, the paper demonstrates why this is suboptimal. To this end, the pa...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The paper focuses on a subset of decision making problems particularly relevant to real world applications: learning _when to act_ along with the appropriate action to execute. While this problem can be framed as a standard RL problem with no-op action, the paper demonstrates why this is suboptimal. To this end...
The authors consider the problem of inferring a hierarchal clustering of dataset instances. The problem has typically been approached as either a discrete optimization problem or a continuous, relaxed form of the discrete problem. In the discrete setting one searches over all possible hierarchies - with each instance...
Recommendation: 5: marginally below the acceptance threshold
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: The authors consider the problem of inferring a hierarchal clustering of dataset instances. The problem has typically been approached as either a discrete optimization problem or a continuous, relaxed form of the discrete problem. In the discrete setting one searches over all possible hierarchies - with each ...
This paper describes a new improved architecture for video recognition based on Uniformer (ICLR 2022), dubbed Uniformer-V2. To this end some of the techniques proposed in Uniformer are re-used and extended to create a video architecture that can benefit from existing pre-trained ViT models (CLIP in particular). The arc...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper describes a new improved architecture for video recognition based on Uniformer (ICLR 2022), dubbed Uniformer-V2. To this end some of the techniques proposed in Uniformer are re-used and extended to create a video architecture that can benefit from existing pre-trained ViT models (CLIP in particular)....
This paper proposed a Continuous-Discrete Convolution (CDConv) for Geometry-Sequence modeling in proteins. The goal is to increase the accuracy of four tasks, protein fold classification, enzyme reaction classification, gene ontology term prediction, and enzyme commission number prediction. The paper also explained how...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper proposed a Continuous-Discrete Convolution (CDConv) for Geometry-Sequence modeling in proteins. The goal is to increase the accuracy of four tasks, protein fold classification, enzyme reaction classification, gene ontology term prediction, and enzyme commission number prediction. The paper also expla...
The paper investigates criticality conditions in deep networks, using the NNGP (neural network Gaussian process) framework in the infinite width limit, focusing on architectures with LayerNorm and residual connections. It introduces an estimator for trainability or training stability, the Averaged partial Jacobian norm...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper investigates criticality conditions in deep networks, using the NNGP (neural network Gaussian process) framework in the infinite width limit, focusing on architectures with LayerNorm and residual connections. It introduces an estimator for trainability or training stability, the Averaged partial Jacob...
This paper extends the dual lottery ticket hypothesis (DLTH), which consists in randomly selecting a subnetwork and transforming it in a winning ticket through training with regularization. In this paper, the authors propose s slightly modified procedure, called UniDLTH, where they introduce a preliminary training phas...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper extends the dual lottery ticket hypothesis (DLTH), which consists in randomly selecting a subnetwork and transforming it in a winning ticket through training with regularization. In this paper, the authors propose s slightly modified procedure, called UniDLTH, where they introduce a preliminary train...
This paper addresses safe reinforcement learning (RL) problems for safety-critical applications where failures during learning may incur high costs. The authors aims to deal with (partially) unknown environments and dynamics, where an agent must discover unsafe state-action pairs during exploration. In this paper, the ...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper addresses safe reinforcement learning (RL) problems for safety-critical applications where failures during learning may incur high costs. The authors aims to deal with (partially) unknown environments and dynamics, where an agent must discover unsafe state-action pairs during exploration. In this pap...
The paper introduces a ‘neural-symbolic recursive machine’ (NSR) to learn compositional rules from limited data that can be applied to unseen combinations in various domains. SotA is reported to be achieved on SCAN, PCFG, and HINT, which suggests at good domain-generalizability. Strengths - NSR is evaluated on three b...
Recommendation: 6: marginally above the acceptance threshold
Area: General Machine Learning
Review: The paper introduces a ‘neural-symbolic recursive machine’ (NSR) to learn compositional rules from limited data that can be applied to unseen combinations in various domains. SotA is reported to be achieved on SCAN, PCFG, and HINT, which suggests at good domain-generalizability. Strengths - NSR is evaluated on...
This paper introduced the Entity-Factored Markov Decision Process (EFMDP) for modeling the entity-based compositional structure in controlling tasks. The authors studied several structured policy architectures that can utilize the factorized discrete entities on a suite of manipulation tasks. Experimental results showe...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper introduced the Entity-Factored Markov Decision Process (EFMDP) for modeling the entity-based compositional structure in controlling tasks. The authors studied several structured policy architectures that can utilize the factorized discrete entities on a suite of manipulation tasks. Experimental resul...
The authors propose a new importance sampling technique for SGD-based optimizers for training deep neural network models. Empirical studies are carried out on image classification tasks using standard benchmark datasets. Pros: - The paper is well organized and easy to follow - Experiments studies to validate the propo...
Recommendation: 5: marginally below the acceptance threshold
Area: Optimization (eg, convex and non-convex optimization)
Review: The authors propose a new importance sampling technique for SGD-based optimizers for training deep neural network models. Empirical studies are carried out on image classification tasks using standard benchmark datasets. Pros: - The paper is well organized and easy to follow - Experiments studies to validate t...
This paper presented a framework that combines self-supervised contrastive learning and neuro-symbolic method for "abstract visual reasoning," specifically grounded on the task of RAVEN's Progression Matrices (RPM). The main framework has four steps. First, it trains a per-object perception model that maps images to di...
Recommendation: 3: reject, not good enough
Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces)
Review: This paper presented a framework that combines self-supervised contrastive learning and neuro-symbolic method for "abstract visual reasoning," specifically grounded on the task of RAVEN's Progression Matrices (RPM). The main framework has four steps. First, it trains a per-object perception model that maps imag...
This paper presents theoretical results on the eigenvalue spectrum of the neural tangent kernel (NTK) based on Hermite polynomial expansions. The results enable expressing the NTK matrices for neural networks of arbitrary depth via power series expansions based on the data points matrix. Bounds on the eigenvalues of th...
Recommendation: 8: accept, good paper
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: This paper presents theoretical results on the eigenvalue spectrum of the neural tangent kernel (NTK) based on Hermite polynomial expansions. The results enable expressing the NTK matrices for neural networks of arbitrary depth via power series expansions based on the data points matrix. Bounds on the eigenvalu...
The paper mainly studies two question, whether the Large Language Models (LLMs) has personality and is it possible to induce a specific personality in the LLMs. For the first question, the author proposes a new dataset MPI to evaluate Large Language Models's machine personality built upon the Big Five Theory. The pap...
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 mainly studies two question, whether the Large Language Models (LLMs) has personality and is it possible to induce a specific personality in the LLMs. For the first question, the author proposes a new dataset MPI to evaluate Large Language Models's machine personality built upon the Big Five Theory....
This paper studies the problem of improving self-supervised learning (SSL) methods on compact neural networks. The authors investigate the relations between data augmentation strength and sizes of neural networks in SSL, and propose a new objective and data augmentation scheme to improve the performance. Strengths: 1. ...
Recommendation: 8: accept, good paper
Area: Unsupervised and Self-supervised learning
Review: This paper studies the problem of improving self-supervised learning (SSL) methods on compact neural networks. The authors investigate the relations between data augmentation strength and sizes of neural networks in SSL, and propose a new objective and data augmentation scheme to improve the performance. Streng...
This paper proposes a new approach for unsupervised meta-learning problem. The key idea of the approach, named Set-SimCLR, is to extend the SimCLR framework with the set representation. The proposed approach augments the set of images and then learns set representation using a set transformer. Additionally, the autho...
Recommendation: 5: marginally below the acceptance threshold
Area: Unsupervised and Self-supervised learning
Review: This paper proposes a new approach for unsupervised meta-learning problem. The key idea of the approach, named Set-SimCLR, is to extend the SimCLR framework with the set representation. The proposed approach augments the set of images and then learns set representation using a set transformer. Additionally, t...
The paper studies the problem of training deep networks to solve visual reasoning problems. It studies PGM and I-Ravens benchmarks, which pose challenging visual reasoning problems for humans, and explores if an end-to-end deep network can solve them. The proposed method uses slot attention to individually encode each...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper studies the problem of training deep networks to solve visual reasoning problems. It studies PGM and I-Ravens benchmarks, which pose challenging visual reasoning problems for humans, and explores if an end-to-end deep network can solve them. The proposed method uses slot attention to individually enc...
This paper proposes an unsupervised domain adaptation framework PAPLUDA under the partial label learning scenario which is formalized as a new problem called partial label unsupervised domain adaptation (PLUDA). The proposed PAPLUDA method disambiguates the irrelevant label noise with the help of a teacher-student mode...
Recommendation: 8: accept, good paper
Area: General Machine Learning
Review: This paper proposes an unsupervised domain adaptation framework PAPLUDA under the partial label learning scenario which is formalized as a new problem called partial label unsupervised domain adaptation (PLUDA). The proposed PAPLUDA method disambiguates the irrelevant label noise with the help of a teacher-stud...
In this paper the authors answer why the size of a Lipschitz neural network in practice is much smaller than the theoretical bounds (which have an exponential in D dependence). The key idea that the authors provide is that number of parameters will vary exponential in the intrinsic dimension if there exists a matrix $A...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: In this paper the authors answer why the size of a Lipschitz neural network in practice is much smaller than the theoretical bounds (which have an exponential in D dependence). The key idea that the authors provide is that number of parameters will vary exponential in the intrinsic dimension if there exists a m...
In the field of unsupervised skill discovery, the authors focus on that the skill discriminator is often used for generating intrinsic reward signals and propose to leverage the skill discriminator to match the intrinsic rewards with extrinsic rewards to solve downstream tasks. They use the EPIC pseudometric to measure...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: In the field of unsupervised skill discovery, the authors focus on that the skill discriminator is often used for generating intrinsic reward signals and propose to leverage the skill discriminator to match the intrinsic rewards with extrinsic rewards to solve downstream tasks. They use the EPIC pseudometric to...
This paper defines a knowledge-ground reinforcement learning (KGRL) problem that an agent learns to follow external guidelines and develop its own policy. It also provides a realization of this problem by using an attention-based actor model which can switch between either a learnable internal policy or external knowle...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper defines a knowledge-ground reinforcement learning (KGRL) problem that an agent learns to follow external guidelines and develop its own policy. It also provides a realization of this problem by using an attention-based actor model which can switch between either a learnable internal policy or externa...
This paper integrates Transformer into NAS for architecture selection by regarding each candidate operation as a patch and also introducing an additional importance indicator token (IT) to calculate cross-attention among the other operational tokens. # Strength: The paper proposes to explore self-attention to selec...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper integrates Transformer into NAS for architecture selection by regarding each candidate operation as a patch and also introducing an additional importance indicator token (IT) to calculate cross-attention among the other operational tokens. # Strength: The paper proposes to explore self-attention ...
The paper proposes a new framework called pFedGate for training personalized models at client devices, such that each model can have different sparsity level depending on the devices computational and memory capacities. The idea is to generate personalized masks with different sparsity levels for each device, using a s...
Recommendation: 5: marginally below the acceptance threshold
Area: General Machine Learning
Review: The paper proposes a new framework called pFedGate for training personalized models at client devices, such that each model can have different sparsity level depending on the devices computational and memory capacities. The idea is to generate personalized masks with different sparsity levels for each device, u...
The paper analyzes sinusoidal neural networks from the Neural Tanget Kernal (NTK) perspective. This analysis leads to a number of important observations. The most important finding, perhaps, is that their NTK approximates a tuneable low-pass filter. This insight is subsequently used to develop guidelines for optimiz...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: The paper analyzes sinusoidal neural networks from the Neural Tanget Kernal (NTK) perspective. This analysis leads to a number of important observations. The most important finding, perhaps, is that their NTK approximates a tuneable low-pass filter. This insight is subsequently used to develop guidelines for...
In this paper, the authors study the problem of imbalance in classification problems. To be specific, they propose a measure to quantify the `semantic scale' of classes and use this measure as a means to analyze the imbalance among classes. Moreover, they use this measure to mitigate the effect of imbalance in various ...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: In this paper, the authors study the problem of imbalance in classification problems. To be specific, they propose a measure to quantify the `semantic scale' of classes and use this measure as a means to analyze the imbalance among classes. Moreover, they use this measure to mitigate the effect of imbalance in ...
This paper investigates the improvement from plain ViT to hierarchical Swin-Transformer step-by-step and proposes a new hierarchical vision transformer that only uses hierarchical patch embedding at the beginning and keeps the global attention at 14x14 level instead of window attention. It shows similar or better perfo...
Recommendation: 8: accept, good paper
Area: Unsupervised and Self-supervised learning
Review: This paper investigates the improvement from plain ViT to hierarchical Swin-Transformer step-by-step and proposes a new hierarchical vision transformer that only uses hierarchical patch embedding at the beginning and keeps the global attention at 14x14 level instead of window attention. It shows similar or bett...
Some of the earlier successful methods for physical modelling (like Schutt et al., 2017 and Bartok et. al, 2013) are unable to fully account for the geometry of the system. To model particle arrangements, they rely on using radial information (which captures inter-particle distances). It should be straightforward to se...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: Some of the earlier successful methods for physical modelling (like Schutt et al., 2017 and Bartok et. al, 2013) are unable to fully account for the geometry of the system. To model particle arrangements, they rely on using radial information (which captures inter-particle distances). It should be straightforwa...
The paper proposes to learn logic rules by recursively encoding subsets of paths into head relations. The paths are samples from the KG. The method to do this is using an RNN to encode each element of the sliding window on the path, selecting one window with a softmax, and using an attention mechanism to predict the su...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: The paper proposes to learn logic rules by recursively encoding subsets of paths into head relations. The paths are samples from the KG. The method to do this is using an RNN to encode each element of the sliding window on the path, selecting one window with a softmax, and using an attention mechanism to predic...
The paper uses a standard off-policy moder-based reinforcement learning algorithm and uses a set of dynamics models (autoregressive models, ensembles & mixture density models) on a single benchmark. They then test the algorithms using a set of metrics and found that auto-regressive models appear to give improved perf...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The paper uses a standard off-policy moder-based reinforcement learning algorithm and uses a set of dynamics models (autoregressive models, ensembles & mixture density models) on a single benchmark. They then test the algorithms using a set of metrics and found that auto-regressive models appear to give impro...
The paper proposes an extension to ProtoPNet that utilizes KNN classifiers. To do this the paper replaces ProtoPNet loss with 3 losses: a) A classification loss $L_{task}$ eq 3 which replaces the regular cross-entropy loss. b) Cluster loss $L_{clst}$ summarized in fig 2; which first calculates the affiliation of the ...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper proposes an extension to ProtoPNet that utilizes KNN classifiers. To do this the paper replaces ProtoPNet loss with 3 losses: a) A classification loss $L_{task}$ eq 3 which replaces the regular cross-entropy loss. b) Cluster loss $L_{clst}$ summarized in fig 2; which first calculates the affiliation...
The paper proposes Poppy, an RL-based approach to learn a population of constructive heuristics for combinatorial optimization problems. The presented architecture is based on the encoder-decoder Attention Model, with a shared encoder and one decoder per agent of the population. Starting from a pretrained model, Popp...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The paper proposes Poppy, an RL-based approach to learn a population of constructive heuristics for combinatorial optimization problems. The presented architecture is based on the encoder-decoder Attention Model, with a shared encoder and one decoder per agent of the population. Starting from a pretrained mod...
This paper studied the factors affecting accuracy in HDC and proposed a more efficient HDC method. Strength: * The paper is mostly well organized and is straightforward to follow. * The study on dimension and accuracy looks very interesting. The result showing using much less dimensions looks very promising. I believe...
Recommendation: 6: marginally above the acceptance threshold
Area: General Machine Learning
Review: This paper studied the factors affecting accuracy in HDC and proposed a more efficient HDC method. Strength: * The paper is mostly well organized and is straightforward to follow. * The study on dimension and accuracy looks very interesting. The result showing using much less dimensions looks very promising. I...
The authors propose a G-Trans module, which incorporates channel-relationship learning into the Transformer structure for multivariate time series modeling. The authors further added a VAE-structured module to model the non-deterministic within both temporal and cross-channel dependencies of MTS. Experiments on both a...
Recommendation: 6: marginally above the acceptance threshold
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: The authors propose a G-Trans module, which incorporates channel-relationship learning into the Transformer structure for multivariate time series modeling. The authors further added a VAE-structured module to model the non-deterministic within both temporal and cross-channel dependencies of MTS. Experiments o...
The authors present an event-based version of GRUs that allows for sparse forward and backward passes that achieves similar (sometimes even better) task performance than vanilla GRU but at a lower compute cost. The authors also present theoretical results indicating that the computation complexity doesn't scale with th...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: The authors present an event-based version of GRUs that allows for sparse forward and backward passes that achieves similar (sometimes even better) task performance than vanilla GRU but at a lower compute cost. The authors also present theoretical results indicating that the computation complexity doesn't scale...
This paper focuses on the gradient-based optimization for a special branch of RL problems. Due to the unstable nature of the system, small deviation leads to exponentially growing effects on the state evolution trajectory and the reward/cost function, which raises issues for gradient-based optimizations. The authors pr...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper focuses on the gradient-based optimization for a special branch of RL problems. Due to the unstable nature of the system, small deviation leads to exponentially growing effects on the state evolution trajectory and the reward/cost function, which raises issues for gradient-based optimizations. The au...
This paper proposed a new similarity function to quantify the similarity of the DNNs in image classification tasks based on transferability of adversarial examples. For a pair of similar DNNs, authors investigate which types of DNN components contribute most to the similarity and their implications to practical scenari...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper proposed a new similarity function to quantify the similarity of the DNNs in image classification tasks based on transferability of adversarial examples. For a pair of similar DNNs, authors investigate which types of DNN components contribute most to the similarity and their implications to practical...
This work focuses on the training of selective networks, where the network knows then to reject to answer for unconfident examples. They propose a curriculum-inspired method to train selective neural works, where they (1) consider the target converge ratio when sampling batches, and (2) use the example difficulty score...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This work focuses on the training of selective networks, where the network knows then to reject to answer for unconfident examples. They propose a curriculum-inspired method to train selective neural works, where they (1) consider the target converge ratio when sampling batches, and (2) use the example difficul...