review stringlengths 5 16.6k | score stringclasses 5
values | area stringclasses 12
values | text stringlengths 31 5.65k |
|---|---|---|---|
The paper proposes an approach to perform code infilling that supports multiple insertion points. The approach is by defining an infilling format that describes the missing code locations and the code to be infilled. The training approach is by the traditional autoregressive next token prediction loss. This paper indee... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper proposes an approach to perform code infilling that supports multiple insertion points. The approach is by defining an infilling format that describes the missing code locations and the code to be infilled. The training approach is by the traditional autoregressive next token prediction loss. This pap... |
This paper proposes a distributed model-based RL algorithm building on MuZero/EfficientZero which is designed to reduce the wall-clock time required to train the agent. While EfficientZero is sample efficient, it still takes a long time to train. This work identifies and addresses several system-level inefficiencies, r... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper proposes a distributed model-based RL algorithm building on MuZero/EfficientZero which is designed to reduce the wall-clock time required to train the agent. While EfficientZero is sample efficient, it still takes a long time to train. This work identifies and addresses several system-level inefficie... |
In this paper, the authors tackle adversarial training. They pay more attention to the valley region of the loss landscape of DNNs. This is where collaborative examples exists. Collaborative examples fall within a bounded region of a benign example while having very small loss values. The authors first show that such e... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
In this paper, the authors tackle adversarial training. They pay more attention to the valley region of the loss landscape of DNNs. This is where collaborative examples exists. Collaborative examples fall within a bounded region of a benign example while having very small loss values. The authors first show tha... |
The paper introduces a novel Neural Process (NP) variant which uses martingale posterior distributions to account for epistemic uncertainty. Martingale posteriors are a recent generalization of Bayesian inference proposed by Fong et al. (2021), in which valid posteriors are specified entirely in terms of the predictive... | Recommendation: 8: accept, good paper | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
The paper introduces a novel Neural Process (NP) variant which uses martingale posterior distributions to account for epistemic uncertainty. Martingale posteriors are a recent generalization of Bayesian inference proposed by Fong et al. (2021), in which valid posteriors are specified entirely in terms of the pr... |
This paper presents an approach for adaptively allocating fine-tuning parameters during transfer of pre-trained models to downstream tasks. The authors propose an SVD inspired decomposition of the adapter matrices and develop various importance scores to assess which triplets in the SVD decomposition are removable. Th... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper presents an approach for adaptively allocating fine-tuning parameters during transfer of pre-trained models to downstream tasks. The authors propose an SVD inspired decomposition of the adapter matrices and develop various importance scores to assess which triplets in the SVD decomposition are remov... |
The paper studies convergence of compressed SGD to a first-order stationary point. The paper considers unbiased compressors and improves state-of-the-art convergence rate and communication complexity for both finite-sum and stochastic settings. The algorithms presented in the paper differ in update rules and their requ... | Recommendation: 6: marginally above the acceptance threshold | Area: Optimization (eg, convex and non-convex optimization) | Review:
The paper studies convergence of compressed SGD to a first-order stationary point. The paper considers unbiased compressors and improves state-of-the-art convergence rate and communication complexity for both finite-sum and stochastic settings. The algorithms presented in the paper differ in update rules and th... |
This paper studies the bias propagation in federated learning, which is an important issue in terms of the fairness. The authors conducted a range of experiments to understand the potential mechanism of bias propagation and present several interesting insights.
Strength
(1) It is a first attempt to systematically anal... | 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 studies the bias propagation in federated learning, which is an important issue in terms of the fairness. The authors conducted a range of experiments to understand the potential mechanism of bias propagation and present several interesting insights.
Strength
(1) It is a first attempt to systematica... |
This paper proposes a minimax game model of backdoor attacks between attackers
and defenders in the federated learning (FL) paradigm. Based on the analysis
of this model, it uses a reverse-engineering technique to defend against
backdoor attacks in the FL process. It provides theoretical analysis and
experimental resu... | 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 proposes a minimax game model of backdoor attacks between attackers
and defenders in the federated learning (FL) paradigm. Based on the analysis
of this model, it uses a reverse-engineering technique to defend against
backdoor attacks in the FL process. It provides theoretical analysis and
experimen... |
This paper studies a video-language model trained using only a single frame, finding that is can do quite well on many existing benchmarks. The paper then proposes new benchmarks on something-something, where more temporal understanding is required.
The paper is well written and easy to understand. The experiments are ... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper studies a video-language model trained using only a single frame, finding that is can do quite well on many existing benchmarks. The paper then proposes new benchmarks on something-something, where more temporal understanding is required.
The paper is well written and easy to understand. The experime... |
This paper improves upon prior approaches that generates furnitures. The proposed method is more controllable, able to generate / complete a scene from either object-level conditioning (think rendered, physically placed objects) or attribute-level conditioning (think word, stylized language description of the scene). T... | Recommendation: 6: marginally above the acceptance threshold | Area: Generative models | Review:
This paper improves upon prior approaches that generates furnitures. The proposed method is more controllable, able to generate / complete a scene from either object-level conditioning (think rendered, physically placed objects) or attribute-level conditioning (think word, stylized language description of the s... |
The paper presents a modification of the NGNN framework of Zhang & Li which uses the embeddings of subgraphs around each node as node embeddings for an outer global message passing loop to DAGs (by defining a total ordering of possible subgraphs and selecting the largest for each node) in order to apply the architectu... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The paper presents a modification of the NGNN framework of Zhang & Li which uses the embeddings of subgraphs around each node as node embeddings for an outer global message passing loop to DAGs (by defining a total ordering of possible subgraphs and selecting the largest for each node) in order to apply the ar... |
The paper focuses on the robustness of motion forecasting models and makes two main contributions: 1. additional labels for the Waymo Open Motion Dataset with causal labels, 2. evaluation of the robustness of several state of the art models using these "causal" labels. The causal labels include agents whose presence in... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper focuses on the robustness of motion forecasting models and makes two main contributions: 1. additional labels for the Waymo Open Motion Dataset with causal labels, 2. evaluation of the robustness of several state of the art models using these "causal" labels. The causal labels include agents whose pre... |
This paper proposes a new method to measure image downscaling algorithms. The core idea is to upsample the downsampled image using blind/one-to-many generative-model-based super-resolution methods and compare the upsampled image with the original image. The similarity will be used as the final result. The authors show ... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposes a new method to measure image downscaling algorithms. The core idea is to upsample the downsampled image using blind/one-to-many generative-model-based super-resolution methods and compare the upsampled image with the original image. The similarity will be used as the final result. The autho... |
The goal of this paper is to try to learn a goal-conditioned policy which is robust to goal-switching, i.e. when the goal given to the policy changes in the middle of the episode. The proposed approach uses a causal transformer, and proposes masking the goal randomly to ensure that the model (GMT) is able to predict th... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The goal of this paper is to try to learn a goal-conditioned policy which is robust to goal-switching, i.e. when the goal given to the policy changes in the middle of the episode. The proposed approach uses a causal transformer, and proposes masking the goal randomly to ensure that the model (GMT) is able to pr... |
The authors proposed TSM that combines time series modeling method HiPPO and neural PDE solver. This proposed method has higher accuracy than existing models in 2-D Navier Stokes equation, and has lower inference latency. The authors generally identified these characteristics in various forcing and Reynolds number envi... | Recommendation: 6: marginally above the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
The authors proposed TSM that combines time series modeling method HiPPO and neural PDE solver. This proposed method has higher accuracy than existing models in 2-D Navier Stokes equation, and has lower inference latency. The authors generally identified these characteristics in various forcing and Reynolds num... |
The authors proposed a novel problem setting of adversary aware partial label learning (PLL) and a novel solution including an adversary aware loss and immature teacher within momentum (ITWM) to solve it. Theoretical analysis are presented and some empirical results are reported.
Strengths:
1. The problem setting is a... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The authors proposed a novel problem setting of adversary aware partial label learning (PLL) and a novel solution including an adversary aware loss and immature teacher within momentum (ITWM) to solve it. Theoretical analysis are presented and some empirical results are reported.
Strengths:
1. The problem sett... |
This work extends a recent approach to train MLPs with teacher GNNs to produce models capable of performing well on relational data while preserving low inference latency by omitting belief propagation. To motivate the paper, the authors identify two major limitations to existing MLPs trained with GNNs 1) loss of posit... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This work extends a recent approach to train MLPs with teacher GNNs to produce models capable of performing well on relational data while preserving low inference latency by omitting belief propagation. To motivate the paper, the authors identify two major limitations to existing MLPs trained with GNNs 1) loss ... |
The paper utilized *Normalizing Flows* models, which are trainable bijective mappings, composed of fully invertible layers. The core idea is to obtain a bounded support in the latent space by design via shifting the base distribution space (that of the latent variables) from a normal distribution to a bounded uniform o... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper utilized *Normalizing Flows* models, which are trainable bijective mappings, composed of fully invertible layers. The core idea is to obtain a bounded support in the latent space by design via shifting the base distribution space (that of the latent variables) from a normal distribution to a bounded u... |
This paper proposes a framework for treatment effect estimation that consists of two components. The first is to balance representations by minimizing group distance and maximizing individual propensity confusion (i.e., PDIG). The second is to use both pre-balancing and post-balancing representations for outcome predic... | Recommendation: 6: marginally above the acceptance threshold | Area: General Machine Learning | Review:
This paper proposes a framework for treatment effect estimation that consists of two components. The first is to balance representations by minimizing group distance and maximizing individual propensity confusion (i.e., PDIG). The second is to use both pre-balancing and post-balancing representations for outcom... |
This paper studies the problem of linear regression under DP constraint and adversarial corruption. The authors propose a kind of variant of DP-SGD with a full-batch GD to improve sample complexity and adaptive clipping to guarantee robustness. Their theoretical results can improve the SOTA sample complexity without ad... | 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 studies the problem of linear regression under DP constraint and adversarial corruption. The authors propose a kind of variant of DP-SGD with a full-batch GD to improve sample complexity and adaptive clipping to guarantee robustness. Their theoretical results can improve the SOTA sample complexity wi... |
This paper proposes a reward shaping scheme for MARL towards fixing QMIX, an existing algorithm suffering from suboptimality in non-monotonic settings. The method uses target shaping by predicting reward and next state uncertainty.
1. There are some important works missing in the related works which need to be discuss... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper proposes a reward shaping scheme for MARL towards fixing QMIX, an existing algorithm suffering from suboptimality in non-monotonic settings. The method uses target shaping by predicting reward and next state uncertainty.
1. There are some important works missing in the related works which need to be... |
This paper mainly studies the problem of multivariate time series forecasting. The authors argue there are three basic challenges and accordingly propose a multi-view time-series graph structure representation method. Extensive results show their improved forecasting performances on some datasets as well as the improve... | Recommendation: 1: strong reject | Area: Deep Learning and representational learning | Review:
This paper mainly studies the problem of multivariate time series forecasting. The authors argue there are three basic challenges and accordingly propose a multi-view time-series graph structure representation method. Extensive results show their improved forecasting performances on some datasets as well as the... |
The paper motivates the study of the relative sizes of regions of attraction of different equilibria, then tackles the case of symmetric, 2x2 coordination games. For this class of games, some partial/preliminary results are given.
I found the paper to be well written and easy to read. It is certainly convincing in term... | Recommendation: 5: marginally below the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The paper motivates the study of the relative sizes of regions of attraction of different equilibria, then tackles the case of symmetric, 2x2 coordination games. For this class of games, some partial/preliminary results are given.
I found the paper to be well written and easy to read. It is certainly convincing... |
This submission focuses on training teacher models with the goal of making them successful in knowledge distillation. The first part of the paper presents necessary conditions under which a teacher model minimizing the empirical loss computed with one-hot labels captures the Bayes classifier probabilities on the traini... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This submission focuses on training teacher models with the goal of making them successful in knowledge distillation. The first part of the paper presents necessary conditions under which a teacher model minimizing the empirical loss computed with one-hot labels captures the Bayes classifier probabilities on th... |
This manuscript recommends an ensemble-like approach for semi-supervised pose estimation. A teacher-student setting where self-supervised pseudo-labels are created by the teacher for unlabeled data is extended to use two teacher-student pairs. The discrepancy between the two teachers is used to assess the quality of th... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This manuscript recommends an ensemble-like approach for semi-supervised pose estimation. A teacher-student setting where self-supervised pseudo-labels are created by the teacher for unlabeled data is extended to use two teacher-student pairs. The discrepancy between the two teachers is used to assess the quali... |
This paper proposes a new method for learning policies first from offline dataset and then from a limited number of interactions with the real environment. The special feature of the method is that it learns a pseudometric that corresponds to the similarity between states in the environment. Then, when during online in... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper proposes a new method for learning policies first from offline dataset and then from a limited number of interactions with the real environment. The special feature of the method is that it learns a pseudometric that corresponds to the similarity between states in the environment. Then, when during o... |
This paper deals with class imbalance from the data augmentation perspective. It is based on and motivated by an analysis on the relationship between data augmentation degree and performance per class.
**Strengths**
- Data augmentation is an interesting dimension to study class imbalance in general.
- The proposed m... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper deals with class imbalance from the data augmentation perspective. It is based on and motivated by an analysis on the relationship between data augmentation degree and performance per class.
**Strengths**
- Data augmentation is an interesting dimension to study class imbalance in general.
- The pr... |
The paper proposes Contrastive Representation Ensemble and Aggregation for Multimodal
FL (CreamFL) to exploit multimodal data from clients in FL settings in a privacy driven world. CreamFL trains large models from clients with heterogeneous architectures and multiple modalities. To fuse multimodal representations, a gl... | Recommendation: 6: marginally above the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
The paper proposes Contrastive Representation Ensemble and Aggregation for Multimodal
FL (CreamFL) to exploit multimodal data from clients in FL settings in a privacy driven world. CreamFL trains large models from clients with heterogeneous architectures and multiple modalities. To fuse multimodal representatio... |
This paper tries to find empirically validated reasoning for the cause of high variance in fair deep learning, where the fairness metric of interest is average odds (AO), i.e., the average disparity between true and false positive rates. This is generally attributed to randomness (what they call non-determinism) in tra... | 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 tries to find empirically validated reasoning for the cause of high variance in fair deep learning, where the fairness metric of interest is average odds (AO), i.e., the average disparity between true and false positive rates. This is generally attributed to randomness (what they call non-determinism... |
The paper proposes a novel multi-agent RL environment which extends existing game Agar with multiple teams, thereby enabling M x N style games. A single agent in the game manages up to 16 growing cloned balls, which need to be increased in size to gain more rewards. The resulting action space has a discrete- (type of a... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper proposes a novel multi-agent RL environment which extends existing game Agar with multiple teams, thereby enabling M x N style games. A single agent in the game manages up to 16 growing cloned balls, which need to be increased in size to gain more rewards. The resulting action space has a discrete- (t... |
This paper introduces a new explainable graph attention network model. The highlight of this model is its multi-channel explanability. Along with outputing node predictions, the model also generates extra edges and nodes importance scores across preset channels. To along these importance scores with multi-explanation c... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper introduces a new explainable graph attention network model. The highlight of this model is its multi-channel explanability. Along with outputing node predictions, the model also generates extra edges and nodes importance scores across preset channels. To along these importance scores with multi-expla... |
This paper proposes an efficient design of Transformer-based models (PatchTST) for multivariate time series forecasting and self-supervised representation learning. It segments time series into patches following similar philosophy of ViT and assume channels are independent. Extensive experiments on 8 eight datasets sho... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposes an efficient design of Transformer-based models (PatchTST) for multivariate time series forecasting and self-supervised representation learning. It segments time series into patches following similar philosophy of ViT and assume channels are independent. Extensive experiments on 8 eight data... |
This paper proposes a new post-processing algorithm (FaiREE) to satisfy group fairness constraints in classification with finite-sample and distribution-free theoretical guarantees. FaiREE can be adapted to satisfy various group fairness notions, e.g., Equality of Opportunity, Equalized Odds, and Demographic Parity. Sy... | 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 a new post-processing algorithm (FaiREE) to satisfy group fairness constraints in classification with finite-sample and distribution-free theoretical guarantees. FaiREE can be adapted to satisfy various group fairness notions, e.g., Equality of Opportunity, Equalized Odds, and Demographic Pa... |
The paper targets a novel {inr2vec} problem setting: to squeeze the weights of a learned implicit neural representation (INR) into compact latent codes for various downstream tasks. By training an encoder-decoder to recover the learned implicit function represented by the INR, the encoded feature can be fed into learni... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The paper targets a novel {inr2vec} problem setting: to squeeze the weights of a learned implicit neural representation (INR) into compact latent codes for various downstream tasks. By training an encoder-decoder to recover the learned implicit function represented by the INR, the encoded feature can be fed int... |
A universal approximator is proposed in this paper using an oscillator NODE (ONODE) whose trajectories can "jump". It was shown that the ONODE is computationally efficient. A number of experiments (including classification tasks and extrapolation on time series) were conducted to validate the model.
**Strength**
The m... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
A universal approximator is proposed in this paper using an oscillator NODE (ONODE) whose trajectories can "jump". It was shown that the ONODE is computationally efficient. A number of experiments (including classification tasks and extrapolation on time series) were conducted to validate the model.
**Strength*... |
Bias creeps into ML models trained from human behavioural data, which can usually be mitigated against but (typically) with labeled data for that purpose. This paper proposes a meta-algorithm for debiasing representations called Unsupervised Locality-based Proxy Label assignment. It is evaluated over five datasets, fro... | Recommendation: 8: accept, good paper | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
Bias creeps into ML models trained from human behavioural data, which can usually be mitigated against but (typically) with labeled data for that purpose. This paper proposes a meta-algorithm for debiasing representations called Unsupervised Locality-based Proxy Label assignment. It is evaluated over five datas... |
This paper proposes a Group Masked Model Learning (GMML), a Self-Supervised Learning (SSL) mechanism
for pretraining vision transformers with the ability to extract the contextual information
present in all the concepts in an image. This is achieved by manipulating
randomly groups of connected tokens, ensuingly coverin... | Recommendation: 3: reject, not good enough | Area: Unsupervised and Self-supervised learning | Review:
This paper proposes a Group Masked Model Learning (GMML), a Self-Supervised Learning (SSL) mechanism
for pretraining vision transformers with the ability to extract the contextual information
present in all the concepts in an image. This is achieved by manipulating
randomly groups of connected tokens, ensuingly... |
The authors propose FedPAC for personalized federated learning, which aims to learn a better representation by leveraging global semantic knowledge. Comprehensive experimental results multiple benchmarks demonstrate the effectiveness of the proposed framework.
Strength
The structure of the proposed FedPAC is reasonabl... | Recommendation: 8: accept, good paper | Area: General Machine Learning | Review:
The authors propose FedPAC for personalized federated learning, which aims to learn a better representation by leveraging global semantic knowledge. Comprehensive experimental results multiple benchmarks demonstrate the effectiveness of the proposed framework.
Strength
The structure of the proposed FedPAC is r... |
CLIP has shown remarkable performance on zero-shot visual recognition. However, adversarial examples still greatly affect CLIP's performance. This work propose a text-guided contrastive adversarial training loss to adopt CLIP to attain adversarial robustness for the datasets that are not seen during adversarial trainin... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
CLIP has shown remarkable performance on zero-shot visual recognition. However, adversarial examples still greatly affect CLIP's performance. This work propose a text-guided contrastive adversarial training loss to adopt CLIP to attain adversarial robustness for the datasets that are not seen during adversarial... |
This paper extends the visual actionable affordance learning method of Where2Act (Mo et. al. 2021) for dual-gripper manipulation. To deal with the quadratic complexity of dual action space, the authors propose to sequence action predictions from two grippers and conditioning the second on the first. This reduces the ac... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper extends the visual actionable affordance learning method of Where2Act (Mo et. al. 2021) for dual-gripper manipulation. To deal with the quadratic complexity of dual action space, the authors propose to sequence action predictions from two grippers and conditioning the second on the first. This reduce... |
The authors attempt to generalize linear layers with layers in which weights are produced by a function on inputs, motivated by the success of Transformers. Motivated by the CP decomposition, they extend the proposed layer to be more computationally efficient, and suggest a variant of a convolutional neural network arc... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The authors attempt to generalize linear layers with layers in which weights are produced by a function on inputs, motivated by the success of Transformers. Motivated by the CP decomposition, they extend the proposed layer to be more computationally efficient, and suggest a variant of a convolutional neural net... |
Counterfactual generation is a multi-model problem in the sense that satisfying all the constraints simultaneously is considered a challenging task. In this paper, the authors propose a stochastic feature-based learning approach to meet all the constraints. The proposed method discretizes each continuous feature and le... | Recommendation: 5: marginally below the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
Counterfactual generation is a multi-model problem in the sense that satisfying all the constraints simultaneously is considered a challenging task. In this paper, the authors propose a stochastic feature-based learning approach to meet all the constraints. The proposed method discretizes each continuous featur... |
The paper is about dealing with partial participation in federated learning. Indeed, in the heterogeneous setting, there is a drift in the obtained solution if not all clients participate. the authors study this discrepancy and propose new algorithms to mitigate it. They consider the idea of sever-aided federated learn... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The paper is about dealing with partial participation in federated learning. Indeed, in the heterogeneous setting, there is a drift in the obtained solution if not all clients participate. the authors study this discrepancy and propose new algorithms to mitigate it. They consider the idea of sever-aided federat... |
The presence of spurious correlations between the labels and features can be an impediment to out-of-sample generalization. A common solution in the literature for this problem is apply a group distributionally robust optimization (G-DRO) to minimize the worst-loss over subgroups in the data. However, prior approaches ... | Recommendation: 5: marginally below the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
The presence of spurious correlations between the labels and features can be an impediment to out-of-sample generalization. A common solution in the literature for this problem is apply a group distributionally robust optimization (G-DRO) to minimize the worst-loss over subgroups in the data. However, prior app... |
The paper present an incremental improvement of axial attention. Instead of performing attention across the two axes for all pixels, feature maps are collapsed along the horizontal and vertical axes into two vectors. Self-attention is performed on these and the updated vectors can then be distributed across the origina... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper present an incremental improvement of axial attention. Instead of performing attention across the two axes for all pixels, feature maps are collapsed along the horizontal and vertical axes into two vectors. Self-attention is performed on these and the updated vectors can then be distributed across the... |
The paper proposes a simple method that leverages the generalization ability of large pre-trained models for domain generalization. The key idea is to use large pre-trained models to estimate the unobserved gradient that minimizes the risks in the target domain, mitigating the gradient biased towards to the source doma... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper proposes a simple method that leverages the generalization ability of large pre-trained models for domain generalization. The key idea is to use large pre-trained models to estimate the unobserved gradient that minimizes the risks in the target domain, mitigating the gradient biased towards to the sou... |
The paper describes a transformer-based language model for SMILES strings. The model is a VAE trained on entire molecules, molecular fragments, or their composition. It can be used for molecular (multi-)property optimization with a stochastic latent space traversal technique. The experiments show that it can be applied... | Recommendation: 3: reject, not good enough | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
The paper describes a transformer-based language model for SMILES strings. The model is a VAE trained on entire molecules, molecular fragments, or their composition. It can be used for molecular (multi-)property optimization with a stochastic latent space traversal technique. The experiments show that it can be... |
The authors study generalization bounds in parametrized supervised learning when training (and test) data are not i.i.d. This setting is more realistic than the typical independence assumptions made in statistical learning theory for problems like time series (or say a Markov chain), where it is expected that the $t$-t... | Recommendation: 5: marginally below the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The authors study generalization bounds in parametrized supervised learning when training (and test) data are not i.i.d. This setting is more realistic than the typical independence assumptions made in statistical learning theory for problems like time series (or say a Markov chain), where it is expected that t... |
This paper proposes enhancing SVGD using importance weights which scales the SVGD update directions by $(\pi / \rho_t)^\beta$. The resulting $\beta$-SVGD is then shown to have an exponential convergence rate in terms of 2-Renyi divergence under a Stein Poincare inequality assumption when $\beta = 1$ and another descent... | Recommendation: 3: reject, not good enough | Area: General Machine Learning | Review:
This paper proposes enhancing SVGD using importance weights which scales the SVGD update directions by $(\pi / \rho_t)^\beta$. The resulting $\beta$-SVGD is then shown to have an exponential convergence rate in terms of 2-Renyi divergence under a Stein Poincare inequality assumption when $\beta = 1$ and another... |
The author proposes a new metric for evaluating the multi-mode image synthesis method, and has tested new metrics. However, method details are limited. In addition, the author's contribution point 1,3 is difficult to capture in the introduction. Besides, the papers investigated are old.
+The author proposes a new metri... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The author proposes a new metric for evaluating the multi-mode image synthesis method, and has tested new metrics. However, method details are limited. In addition, the author's contribution point 1,3 is difficult to capture in the introduction. Besides, the papers investigated are old.
+The author proposes a n... |
This paper argues for stochastic policies that maintain high entropy for high RL performance. In particular, the authors propose to randomly perturb the mean of the output Gaussian distribution to produce more diverse actions. In the experimental evaluation, this perturbation scheme is compared to PPO (with and without... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper argues for stochastic policies that maintain high entropy for high RL performance. In particular, the authors propose to randomly perturb the mean of the output Gaussian distribution to produce more diverse actions. In the experimental evaluation, this perturbation scheme is compared to PPO (with and... |
The paper studies the analysis improvement of existing policy gradient methods. The authors apply the recent new analysis of policy mirror descent to natural policy gradient methods ( and its Q-based version ) under log-linear policy class. The provided convergence results improve the state-of-the-art rates, using eith... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper studies the analysis improvement of existing policy gradient methods. The authors apply the recent new analysis of policy mirror descent to natural policy gradient methods ( and its Q-based version ) under log-linear policy class. The provided convergence results improve the state-of-the-art rates, us... |
This paper proposes LMSER-PIX2SEQ for sketch healing. The method is an encoder-decoder similar to VAE and performs very good with respect to the other baselines.
**Strength**
The paper is well-written and the method shows great performance in the experiments.\
**Weaknesses**
- The method's novelty is limited.
- I... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes LMSER-PIX2SEQ for sketch healing. The method is an encoder-decoder similar to VAE and performs very good with respect to the other baselines.
**Strength**
The paper is well-written and the method shows great performance in the experiments.\
**Weaknesses**
- The method's novelty is limi... |
The paper provides an approach to represent a probabilistic graphical model of relationships between features and a dataset over the same features using a neural network. This neural network can then be used draw samples from the joint distribution of the features, and it can be used to do conditional inference.
The c... | Recommendation: 3: reject, not good enough | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
The paper provides an approach to represent a probabilistic graphical model of relationships between features and a dataset over the same features using a neural network. This neural network can then be used draw samples from the joint distribution of the features, and it can be used to do conditional inference... |
The paper proposesa Topology-guided Sampling Strategy (TGSS) to mitigate the distribution gap between sampled and global data points for Zero-Shot Learning. In addition, a Topology Alignment Module (TAM) is proposed to perserve multi-dimensional geometry structure in latent visual and semantic space. The proposed metho... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper proposesa Topology-guided Sampling Strategy (TGSS) to mitigate the distribution gap between sampled and global data points for Zero-Shot Learning. In addition, a Topology Alignment Module (TAM) is proposed to perserve multi-dimensional geometry structure in latent visual and semantic space. The propos... |
This work proposes studies federated learning under differential privacy with heterogeneous users, where the goal is to learn simultaneously learn good global and local models. The authors propose to only share weights of the representation networks and locally train the user-specific heads for personalization. Theoret... | Recommendation: 8: accept, good paper | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This work proposes studies federated learning under differential privacy with heterogeneous users, where the goal is to learn simultaneously learn good global and local models. The authors propose to only share weights of the representation networks and locally train the user-specific heads for personalization.... |
This paper presents a novel UDA method that utilizes generative models trained in the feature space to alleviate a domain gap. The generative model is trained in a feature space for each subset of the target data categorized into a common pseudo-class, and generated samples from this model are used for mixup-like augme... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper presents a novel UDA method that utilizes generative models trained in the feature space to alleviate a domain gap. The generative model is trained in a feature space for each subset of the target data categorized into a common pseudo-class, and generated samples from this model are used for mixup-li... |
- The authors tried to tackle a fundamental problem, data valuation.
- Most previous works need model training for quantifying the values of the samples (which is computationally inefficient); however, the proposed method does not need model training.
- The authors provided various experimental results that show the su... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
- The authors tried to tackle a fundamental problem, data valuation.
- Most previous works need model training for quantifying the values of the samples (which is computationally inefficient); however, the proposed method does not need model training.
- The authors provided various experimental results that sho... |
This paper tackles offline meta-RL where new tasks are learned via online few-shot adaptation. They observe that there is a distribution shift between the offline data used for meta-training, and the data collected online by the meta-learned policy to use for adaptation. This distribution shift can result in poor adapt... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper tackles offline meta-RL where new tasks are learned via online few-shot adaptation. They observe that there is a distribution shift between the offline data used for meta-training, and the data collected online by the meta-learned policy to use for adaptation. This distribution shift can result in po... |
The paper proposes a Transformer-based approach MaskCLIP to address open-vocabulary panoptic segmentation. It uses the existing Mask2former to propose Masks of objects/stuff, and label these detected Mask regions by sending them into CLIP. Instead of sending these mask regions one by one, it aims to modify the image-en... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper proposes a Transformer-based approach MaskCLIP to address open-vocabulary panoptic segmentation. It uses the existing Mask2former to propose Masks of objects/stuff, and label these detected Mask regions by sending them into CLIP. Instead of sending these mask regions one by one, it aims to modify the ... |
The paper describes recent development in Multimodal VAE in extensive details.
Specifically, versions of the ELBO where the latent models , based on subset of modalities, are forced to be similar to
the latent model that is estimated with all the modalities is explained as Product of Experts like model. The paper goes... | Recommendation: 5: marginally below the acceptance threshold | Area: Generative models | Review:
The paper describes recent development in Multimodal VAE in extensive details.
Specifically, versions of the ELBO where the latent models , based on subset of modalities, are forced to be similar to
the latent model that is estimated with all the modalities is explained as Product of Experts like model. The pa... |
Parameter-efficient training (PET) is a very popular technique for domain and/or task adaptation of large pre-trained models. As opposed to in-context learning, it does perform weight updates, but much less so than full fine-tuning (0.5% of the total parameters in this case).
Many different techniques and architectures... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
Parameter-efficient training (PET) is a very popular technique for domain and/or task adaptation of large pre-trained models. As opposed to in-context learning, it does perform weight updates, but much less so than full fine-tuning (0.5% of the total parameters in this case).
Many different techniques and archi... |
The authors propose two heuristics for speeding up policy gradient approaches and demonstrate it with their application in observatory placement (a coverage problem). The first heuristic is a mini-batch size schedule, where they start with small batches. The second heuristic is injecting noise in the reward function.
S... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The authors propose two heuristics for speeding up policy gradient approaches and demonstrate it with their application in observatory placement (a coverage problem). The first heuristic is a mini-batch size schedule, where they start with small batches. The second heuristic is injecting noise in the reward fun... |
The paper addresses the feature index or coordinate mapping function in radiance field reconstruction as a gauge transformation problem. The core idea of the manuscript is to optimize the transformation by maximizing the mutual information and encouraging uniform coordinate distribution with an EM distance regulation t... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper addresses the feature index or coordinate mapping function in radiance field reconstruction as a gauge transformation problem. The core idea of the manuscript is to optimize the transformation by maximizing the mutual information and encouraging uniform coordinate distribution with an EM distance regu... |
The authors hypothesize that over-parameterized DNNs extract too many features and can prune a large proportion of the features without drastically reducing ID accuracy, while significantly improving the OOD detection task. They propose a simple activation method to validate this hypothesis. The proposed method prune... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The authors hypothesize that over-parameterized DNNs extract too many features and can prune a large proportion of the features without drastically reducing ID accuracy, while significantly improving the OOD detection task. They propose a simple activation method to validate this hypothesis. The proposed meth... |
The paper introduces MAP-D, a novel approach to data archeology that leverages training dynamics to uncover a dataset's salient meta-data. In contrast to already existing approaches, MAP-D enables the simultaneous auditing of a dataset across multiple dimensions (e.g., typical data, corrupted inputs, etc).
The paper's ... | Recommendation: 8: accept, good paper | Area: General Machine Learning | Review:
The paper introduces MAP-D, a novel approach to data archeology that leverages training dynamics to uncover a dataset's salient meta-data. In contrast to already existing approaches, MAP-D enables the simultaneous auditing of a dataset across multiple dimensions (e.g., typical data, corrupted inputs, etc).
The ... |
This paper considers the multiple-class crowdsourcing problem, where the confusing answers and confusion probability are considered. To address this problem, a new model was proposed to identify the top-two plausible answers for every task. Based on the proposed model, a new algorithm was also developed. To show the ef... | Recommendation: 3: reject, not good enough | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper considers the multiple-class crowdsourcing problem, where the confusing answers and confusion probability are considered. To address this problem, a new model was proposed to identify the top-two plausible answers for every task. Based on the proposed model, a new algorithm was also developed. To sho... |
++++++++ After Rebuttal +++++++++++++
In the rebuttal and follow up discussion, the author(s) have clarified my questions and provided additional empirical results to support their claims. I am adjusting the score accordingly.
(Author(s) please make sure the MIX loss are clearly defined in the revised manuscript.)
... | Recommendation: 6: marginally above the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
++++++++ After Rebuttal +++++++++++++
In the rebuttal and follow up discussion, the author(s) have clarified my questions and provided additional empirical results to support their claims. I am adjusting the score accordingly.
(Author(s) please make sure the MIX loss are clearly defined in the revised manusc... |
This paper proposes an evaluation method to eliminate redundant candidate features following the expand-and-reduce framework for automated feature generation. The proposed method achieves state-of-the-art performance on seven benchmarks and outperforms human exports for the first time. Moreover, a theoretical analysis ... | Recommendation: 6: marginally above the acceptance threshold | Area: General Machine Learning | Review:
This paper proposes an evaluation method to eliminate redundant candidate features following the expand-and-reduce framework for automated feature generation. The proposed method achieves state-of-the-art performance on seven benchmarks and outperforms human exports for the first time. Moreover, a theoretical a... |
This paper introduces a new prompting techniques for large language models, called least-to-most prompting. It consists in two stages: (1) prompt the model to ask it to break down the given problem into easier subproblems; (2) prompt the model to solve each subproblem. Experimental results are shown for datasets of sym... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper introduces a new prompting techniques for large language models, called least-to-most prompting. It consists in two stages: (1) prompt the model to ask it to break down the given problem into easier subproblems; (2) prompt the model to solve each subproblem. Experimental results are shown for dataset... |
The work introduced the usage of traffic signals into the problem of predicting the crossing intention. The work has a good amount of ablation study.
The problem of Vulnerable Road User is not common in literature.
The sole contribution of the work is in introducing the usage of traffic light status through attention... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The work introduced the usage of traffic signals into the problem of predicting the crossing intention. The work has a good amount of ablation study.
The problem of Vulnerable Road User is not common in literature.
The sole contribution of the work is in introducing the usage of traffic light status through a... |
This paper proposes a lossy image compression method using the condition diffusion model. This is an end-to-end framework based on a condition diffusion model. This is a new attempt to use the diffusion model for lossy image compression. Extensive experiments are conducted to show the advantages and robustness of the p... | Recommendation: 5: marginally below the acceptance threshold | Area: Generative models | Review:
This paper proposes a lossy image compression method using the condition diffusion model. This is an end-to-end framework based on a condition diffusion model. This is a new attempt to use the diffusion model for lossy image compression. Extensive experiments are conducted to show the advantages and robustness ... |
The paper proposes to train a sparse neural network that only utilizes a small portion of all possible input features per class. The paper argues that due to a small number of input features, they are more interpretable. Another main highlight is that despite using only 10% of the features, the accuracy of the tested n... | Recommendation: 5: marginally below the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
The paper proposes to train a sparse neural network that only utilizes a small portion of all possible input features per class. The paper argues that due to a small number of input features, they are more interpretable. Another main highlight is that despite using only 10% of the features, the accuracy of the ... |
## Summary
The authors propose a new end-to-end fully data-driven method for data assimilation in which the different components of the system are fully parameterized using neural networks. Their model enjoys good accuracy and across different dynamical system parameterizations, specifically on the classical Lorenz sy... | Recommendation: 3: reject, not good enough | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
## Summary
The authors propose a new end-to-end fully data-driven method for data assimilation in which the different components of the system are fully parameterized using neural networks. Their model enjoys good accuracy and across different dynamical system parameterizations, specifically on the classical L... |
This paper presents a new dataset and associated task that involves generating the first section of Wikipedia pages from a set of retrieved references. The dataset is similar in form to previous work like WikiSumm, but it is significantly larger and the authors promise to release the references, which have been downloa... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper presents a new dataset and associated task that involves generating the first section of Wikipedia pages from a set of retrieved references. The dataset is similar in form to previous work like WikiSumm, but it is significantly larger and the authors promise to release the references, which have been... |
This work introduces a novel way of performing localized edits in the latent space of convolutional GANs like. The authors propose first to identify visual concepts by factorizing network activations at a certain layer into a set of appearance factors applied at certain spatial locations encoded by part factors. Once t... | Recommendation: 8: accept, good paper | Area: Generative models | Review:
This work introduces a novel way of performing localized edits in the latent space of convolutional GANs like. The authors propose first to identify visual concepts by factorizing network activations at a certain layer into a set of appearance factors applied at certain spatial locations encoded by part factors... |
The paper introduces a method to determine the correlated high-sensitivity directions in the deep neural policy manifold across space and time in the context of reinforcement learning. In this direction, they first define the concept of a high-sensitivity direction for the Q-function at a given state, and show that it... | 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 introduces a method to determine the correlated high-sensitivity directions in the deep neural policy manifold across space and time in the context of reinforcement learning. In this direction, they first define the concept of a high-sensitivity direction for the Q-function at a given state, and show... |
The paper proposes a differentiable approximation of the hypergeometric distribution and shows that it works well.
Strengths:
- Very clear contribution in form of a practical tool that can be used by others
- Potential for high impact, in a similar manner as the concrete/GS distribution had an impact on how categorical... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The paper proposes a differentiable approximation of the hypergeometric distribution and shows that it works well.
Strengths:
- Very clear contribution in form of a practical tool that can be used by others
- Potential for high impact, in a similar manner as the concrete/GS distribution had an impact on how cat... |
This paper proposes a single-sample single-timescale Actor-Critic method for the linear quadratic regulator (LQR). The main contribution with respect to the available literature is that the authors suggest the epsilon-optimal solution with a sample complexity \tilde{O}(epsilon^2) and provide some convergence analyses.
... | Recommendation: 5: marginally below the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper proposes a single-sample single-timescale Actor-Critic method for the linear quadratic regulator (LQR). The main contribution with respect to the available literature is that the authors suggest the epsilon-optimal solution with a sample complexity \tilde{O}(epsilon^2) and provide some convergence an... |
The authors propose a new way of doing Bayesian Meta Learning (BML) by fitting a full-covariance Gaussian Mixture Model (GMM) to approximate each Task Posterior (TP). TRNG-VI proposed by Arenz et al. (2022) was used to ensure efficient and robust optimization of the variational bound. The training complexity is similar... | Recommendation: 8: accept, good paper | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
The authors propose a new way of doing Bayesian Meta Learning (BML) by fitting a full-covariance Gaussian Mixture Model (GMM) to approximate each Task Posterior (TP). TRNG-VI proposed by Arenz et al. (2022) was used to ensure efficient and robust optimization of the variational bound. The training complexity is... |
This paper proposes a deep non-stationary kernel for spatio-temporal point processes using a different parameterization scheme, which reduces the model complexity. The non-negativity of the solution is guaranteed by a log-barrier method which maintains the linearity of the conditional intensity function. In addition, a... | Recommendation: 8: accept, good paper | Area: General Machine Learning | Review:
This paper proposes a deep non-stationary kernel for spatio-temporal point processes using a different parameterization scheme, which reduces the model complexity. The non-negativity of the solution is guaranteed by a log-barrier method which maintains the linearity of the conditional intensity function. In add... |
This paper employs evidential deep learning to assign uncertainty to unlabeled samples. Then, based on the assigned uncertainty, active learning is leveraged to ask humans to label more samples from the dataset. The authors have modified the original EDL. Specifically, the concentration parameters $\alpha$ >1 have been... | Recommendation: 6: marginally above the acceptance threshold | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
This paper employs evidential deep learning to assign uncertainty to unlabeled samples. Then, based on the assigned uncertainty, active learning is leveraged to ask humans to label more samples from the dataset. The authors have modified the original EDL. Specifically, the concentration parameters $\alpha$ >1 h... |
This paper proposes the DEpth Enhancement via Adaptive Parametric feature Rotation (DEEAPR) method to modulate depth information with a single control parameter. They first use visual representation learning to embed content-independent depth perception of a scene, then train a controllable depth enhancement network wi... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This paper proposes the DEpth Enhancement via Adaptive Parametric feature Rotation (DEEAPR) method to modulate depth information with a single control parameter. They first use visual representation learning to embed content-independent depth perception of a scene, then train a controllable depth enhancement ne... |
This paper studies how to intervene in a dynamic system of cascading events, where events might trigger other events and lead to the “butterfly effect” in the end. Specifically, they propose a relatively simple simulation environment as a testbed for this problem - an agent observes a physical world with several moving... | Recommendation: 6: marginally above the acceptance threshold | Area: General Machine Learning | Review:
This paper studies how to intervene in a dynamic system of cascading events, where events might trigger other events and lead to the “butterfly effect” in the end. Specifically, they propose a relatively simple simulation environment as a testbed for this problem - an agent observes a physical world with severa... |
This manuscript studies an interesting and non-trivial problem, which is how to learn with open-set noisy labels under federated settings. The authors first give a very clear and easy-to-understand formulation of the federated open-set label noise problem, which is very useful. They then proposed a federated label-nois... | Recommendation: 5: marginally below the acceptance threshold | Area: General Machine Learning | Review:
This manuscript studies an interesting and non-trivial problem, which is how to learn with open-set noisy labels under federated settings. The authors first give a very clear and easy-to-understand formulation of the federated open-set label noise problem, which is very useful. They then proposed a federated la... |
This paper introduces a method for explaining any prediction of a black box model by constructing a convex polytopes that surrounds the prediction, such that leaving the polytope changes the prediction, in some sense of closeness. The proposed algorithm works by iteratively finding the closest “shrunken” point to a tes... | 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 introduces a method for explaining any prediction of a black box model by constructing a convex polytopes that surrounds the prediction, such that leaving the polytope changes the prediction, in some sense of closeness. The proposed algorithm works by iteratively finding the closest “shrunken” point ... |
The authors consider the problem of learning models of continuous time dynamical systems in the presence of noise, latent variables and driving input. They present a method for doing this, which reduces the computational complexity of model fitting by breaking up longer observation sequences into shorter chunks. They ... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The authors consider the problem of learning models of continuous time dynamical systems in the presence of noise, latent variables and driving input. They present a method for doing this, which reduces the computational complexity of model fitting by breaking up longer observation sequences into shorter chunks... |
The authors introduce a defense to backdoor attacks based on detecting "strong" features in training data, and removing backdoored training data by filtering along these lines.
### Strengths:
1. I like how the authors began their work in a principled way by discussing difficulties with categorizing backdoor attacks.
2.... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The authors introduce a defense to backdoor attacks based on detecting "strong" features in training data, and removing backdoored training data by filtering along these lines.
### Strengths:
1. I like how the authors began their work in a principled way by discussing difficulties with categorizing backdoor att... |
This paper presents MeshDiffusion, a method for generating 3D meshes. The authors use the deformable tetrahedral grid as the 3D representation, and train a diffusion model on this parameterization. The authors demonstrated the effectiveness of the proposed model on multiple generative tasks, including unconditional and... | Recommendation: 6: marginally above the acceptance threshold | Area: Generative models | Review:
This paper presents MeshDiffusion, a method for generating 3D meshes. The authors use the deformable tetrahedral grid as the 3D representation, and train a diffusion model on this parameterization. The authors demonstrated the effectiveness of the proposed model on multiple generative tasks, including unconditi... |
Algorithmic recourse techniques search for a valid recourse in the vicinity of a point, while adversarial robustness ensures that the model outputs do not change in the vicinity of a point! Algorithmic recourse techniques for models trained to ensure adversarial robustness have a larger work to do than the non-robust c... | Recommendation: 6: marginally above the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
Algorithmic recourse techniques search for a valid recourse in the vicinity of a point, while adversarial robustness ensures that the model outputs do not change in the vicinity of a point! Algorithmic recourse techniques for models trained to ensure adversarial robustness have a larger work to do than the non-... |
This paper proposed an attack exploitable and vulnerable arch search (EVAS). EVAS search for an architecture that is more vulnerable to backdoor triggers. By using NTK, EVAS can perform a training-free search. Also, by using a dynamic trigger generator, the proposed method can generate sample-specific triggers. Empiric... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper proposed an attack exploitable and vulnerable arch search (EVAS). EVAS search for an architecture that is more vulnerable to backdoor triggers. By using NTK, EVAS can perform a training-free search. Also, by using a dynamic trigger generator, the proposed method can generate sample-specific triggers.... |
This paper investigates how to use reinforcement learning (RL) for sequential recommendations. The authors present several innovations for how to address challenges in recommender systems. For one, exploration with actual users can be expensive as they can lead to bad user experience. Also, due to sparse feedback at lo... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper investigates how to use reinforcement learning (RL) for sequential recommendations. The authors present several innovations for how to address challenges in recommender systems. For one, exploration with actual users can be expensive as they can lead to bad user experience. Also, due to sparse feedba... |
This paper questions a recent assumption in the OoD detection literature: that gradient information is useful for OoD detection. Specifically, the authors break down the norm of the gradient as 'U * V' (following the GradNorm paper, a SoTA OoD detection method), where U represents the feature norm and V is some functio... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper questions a recent assumption in the OoD detection literature: that gradient information is useful for OoD detection. Specifically, the authors break down the norm of the gradient as 'U * V' (following the GradNorm paper, a SoTA OoD detection method), where U represents the feature norm and V is some... |
**Summary:**
This paper presents a new test-time normalization (TTN) method that combines the training statistics and the test-time statistics via the importance between them. To obtain the Prior, the authors first augment the training samples as domain-shift ones, and then calculate the importance via the gradient di... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
**Summary:**
This paper presents a new test-time normalization (TTN) method that combines the training statistics and the test-time statistics via the importance between them. To obtain the Prior, the authors first augment the training samples as domain-shift ones, and then calculate the importance via the gra... |
The authors consider the task of improving the scalability of the popular linearised Laplace method for which they develop a sampling-based EM approach. The value of the proposed approach is then demonstrated in several experimental settings.
The authors tackle an important task as the linearised Laplace is a popular ... | Recommendation: 8: accept, good paper | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
The authors consider the task of improving the scalability of the popular linearised Laplace method for which they develop a sampling-based EM approach. The value of the proposed approach is then demonstrated in several experimental settings.
The authors tackle an important task as the linearised Laplace is a ... |
This paper presents a new architecture for modelling the quantification of aleatoric segmentation uncertainty, i.e. predicting the distribution of segmentations in a given task. The model is tested on two established datasets. Specifically, the author presents a mixture of stochastic experts model whose parameters are... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper presents a new architecture for modelling the quantification of aleatoric segmentation uncertainty, i.e. predicting the distribution of segmentations in a given task. The model is tested on two established datasets. Specifically, the author presents a mixture of stochastic experts model whose parame... |
This work proposes a molecular representation learning method based on pre-training with chemical synthetic knowledge graph. The proposed method tackles and solves the limitations in previous works that use chemical reaction knowledge in self-supervised learning.
Pros:
1. The paper is well-organized and easy to follow.... | Recommendation: 5: marginally below the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This work proposes a molecular representation learning method based on pre-training with chemical synthetic knowledge graph. The proposed method tackles and solves the limitations in previous works that use chemical reaction knowledge in self-supervised learning.
Pros:
1. The paper is well-organized and easy to... |
This work considers long-term time series forecasting based on on deep probabilistic techniques. It shows that intrinsic stochasticity in data is often so remarkable that it poses notable challenges for the interpretation of many current deterministic methods. Importantly, the authors argue that uncertainty quantificat... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This work considers long-term time series forecasting based on on deep probabilistic techniques. It shows that intrinsic stochasticity in data is often so remarkable that it poses notable challenges for the interpretation of many current deterministic methods. Importantly, the authors argue that uncertainty qua... |
The authors investigate MAML's inner loop adaptation dynamics in a variety of different task distributions and find that in some cases, earlier layer inner loop adaptation is key for improvements, i.e. heterogeneous tasks. They also propose a method that builds on MAML that is able to improve performance in heterogeneo... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The authors investigate MAML's inner loop adaptation dynamics in a variety of different task distributions and find that in some cases, earlier layer inner loop adaptation is key for improvements, i.e. heterogeneous tasks. They also propose a method that builds on MAML that is able to improve performance in het... |
The work studies the connection between sequence data continuity with the performance of deep sequential models and proposes a regularizer that adjusts the Lipschitz continuity of the model to improve its performance. It analyzes the property of the regularize from both time and frequency domains. Experiment results co... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The work studies the connection between sequence data continuity with the performance of deep sequential models and proposes a regularizer that adjusts the Lipschitz continuity of the model to improve its performance. It analyzes the property of the regularize from both time and frequency domains. Experiment re... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.