review
stringlengths
5
16.6k
score
stringclasses
5 values
area
stringclasses
12 values
text
stringlengths
31
5.65k
This paper presents a multi-task learning method to fine-tune pre-trained LMs (e.g., BERT, BART) and evaluate on in-distribution and out-of-distribution data. In addition to the MLM loss, the proposed training process also applies a mask LM to replace randomly sampled words in an input sentence and uses the sentence's ...
Recommendation: 3: reject, not good enough
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper presents a multi-task learning method to fine-tune pre-trained LMs (e.g., BERT, BART) and evaluate on in-distribution and out-of-distribution data. In addition to the MLM loss, the proposed training process also applies a mask LM to replace randomly sampled words in an input sentence and uses the sen...
This paper studies deployment-efficient reward-free exploration problems in the linear MDP setting. The authors propose an algorithm that can achieve optimal deployment efficiency. Strength: The theoretical results seem to be sound although I did not check all the details. The writing is clear and the discussion about...
Recommendation: 6: marginally above the acceptance threshold
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: This paper studies deployment-efficient reward-free exploration problems in the linear MDP setting. The authors propose an algorithm that can achieve optimal deployment efficiency. Strength: The theoretical results seem to be sound although I did not check all the details. The writing is clear and the discussi...
This work developed a novel meta-learnt method to transfer learning knowledge between neural operators. Different from typical final-layer transfer in existing meta-learning methods, this paper adapted the first layer of the neural operator model to capture hidden parameter field. Evaluation on both synthetic and real ...
Recommendation: 6: marginally above the acceptance threshold
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: This work developed a novel meta-learnt method to transfer learning knowledge between neural operators. Different from typical final-layer transfer in existing meta-learning methods, this paper adapted the first layer of the neural operator model to capture hidden parameter field. Evaluation on both synthetic a...
**High level motivation:** While the multimodality of human perception is shown to help with analogical reasoning, there isn't a standardized task adopted by the machine learning community to drive progress in this area. **Contributions:** * **New task and dataset:** The authors propose a new multimodal analogical re...
Recommendation: 8: accept, good paper
Area: Applications (eg, speech processing, computer vision, NLP)
Review: **High level motivation:** While the multimodality of human perception is shown to help with analogical reasoning, there isn't a standardized task adopted by the machine learning community to drive progress in this area. **Contributions:** * **New task and dataset:** The authors propose a new multimodal analo...
This paper defines a new task: matching unbalanced points cloud pairs in terms of spatial extent and density. Though the task is somewhat similar with registering low-overlap point cloud pairs for spatial extent, this paper adds a factor - density. This paper proposes three steps/modules to solve the problem: 1) Subm...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper defines a new task: matching unbalanced points cloud pairs in terms of spatial extent and density. Though the task is somewhat similar with registering low-overlap point cloud pairs for spatial extent, this paper adds a factor - density. This paper proposes three steps/modules to solve the problem:...
The paper proposes a novel design of physical loss to find a trade-off between sample density and solution accuracy of PDEs. The formulation of the proposed loss tackles the challenges of approximating the boundary layer by modeling and adding a term in the loss function that takes into consideration the highly complex...
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 a novel design of physical loss to find a trade-off between sample density and solution accuracy of PDEs. The formulation of the proposed loss tackles the challenges of approximating the boundary layer by modeling and adding a term in the loss function that takes into consideration the highly...
This paper proposes a new benchmark MBXP for 10+ programming languages to facilitate the evaluation of execution-based code completion task. By the design of the conversion framework to translate prompts and test cases from the MBPP dataset, MBXP can evaluate code generation models in a multi-lingual manner. Furthermor...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper proposes a new benchmark MBXP for 10+ programming languages to facilitate the evaluation of execution-based code completion task. By the design of the conversion framework to translate prompts and test cases from the MBPP dataset, MBXP can evaluate code generation models in a multi-lingual manner. Fu...
The paper introduces introduces a technique to mitigate indirect bias. To use an example from the paper, after debiasing sentences [ "he is a handsome engineer", "she is a sensitive engineer" ] and removing the gendered pronoun, the indirect biases ("handsome engineer" and "sensitive engineer") still persist. Empirical...
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 introduces introduces a technique to mitigate indirect bias. To use an example from the paper, after debiasing sentences [ "he is a handsome engineer", "she is a sensitive engineer" ] and removing the gendered pronoun, the indirect biases ("handsome engineer" and "sensitive engineer") still persist. E...
The paper proposes a framework that combines expert knowledge and AI for improved experimental design. The principle is to let humans drive the discovery/optimization process while the AI provides additional data to overcome the strong exploitation bias of humans. The AI model consists of a GP that is fit using data fr...
Recommendation: 6: marginally above the acceptance threshold
Area: Optimization (eg, convex and non-convex optimization)
Review: The paper proposes a framework that combines expert knowledge and AI for improved experimental design. The principle is to let humans drive the discovery/optimization process while the AI provides additional data to overcome the strong exploitation bias of humans. The AI model consists of a GP that is fit using...
This paper addresses task-specific diversity problem, which exhibits in policies with similar expected return (what the authors called quality). The task specificity is framed by a set of scalar functions of a trajectory defined by the user, which are called Behavior Descriptors (BDs). A BD captures some property of a ...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper addresses task-specific diversity problem, which exhibits in policies with similar expected return (what the authors called quality). The task specificity is framed by a set of scalar functions of a trajectory defined by the user, which are called Behavior Descriptors (BDs). A BD captures some proper...
This paper presents a theoretical and empirical analysis with the main goal showing the similarity between two main categories of algorithms, one-step methods and critic regularization-based methods. Specifically, the paper shows that, under some conditions, the two types of methods are theoretically equivalent; it als...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper presents a theoretical and empirical analysis with the main goal showing the similarity between two main categories of algorithms, one-step methods and critic regularization-based methods. Specifically, the paper shows that, under some conditions, the two types of methods are theoretically equivalent...
This paper introduces a way to create a concept bottleneck paper without having to provide the concept datasets (which is usually user-specified) (this can be seen as a bug or a feature in the community). The way they achieve this is to first use GPT-3 to query related concepts given an output class. Using these GPT-cr...
Recommendation: 8: accept, good paper
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: This paper introduces a way to create a concept bottleneck paper without having to provide the concept datasets (which is usually user-specified) (this can be seen as a bug or a feature in the community). The way they achieve this is to first use GPT-3 to query related concepts given an output class. Using thes...
The paper propose a federated recommender system which guarantees fairness and communication efficiency while trying to minimize the accuracy drop. Strength: 1. The authors derive the first sample complexity for federated recommender, despite under strong assumptions. 2. The authors evaluate the proposed the method 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: The paper propose a federated recommender system which guarantees fairness and communication efficiency while trying to minimize the accuracy drop. Strength: 1. The authors derive the first sample complexity for federated recommender, despite under strong assumptions. 2. The authors evaluate the proposed the me...
This paper shows that under suitable assumptions, the Bayesian optimal robust estimator requires test-time adaptation, and such adaptation can lead to a significant performance boost over standard adversarial training. It then proposes self-supervised test-time fine-tuning on adversarially-trained models to improve the...
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 shows that under suitable assumptions, the Bayesian optimal robust estimator requires test-time adaptation, and such adaptation can lead to a significant performance boost over standard adversarial training. It then proposes self-supervised test-time fine-tuning on adversarially-trained models to imp...
The paper evaluates a set of known model-theft attacks to vision and NLP transformers. For vision, adaptation of MixMatch [Berthelot et al., 2019] to semi-supervised scenarios is the key novelty. Then the authors adapt the Dataset Inference (DI) [Dziedzic et. al. 2022b] technique for transformer models that get trained...
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 evaluates a set of known model-theft attacks to vision and NLP transformers. For vision, adaptation of MixMatch [Berthelot et al., 2019] to semi-supervised scenarios is the key novelty. Then the authors adapt the Dataset Inference (DI) [Dziedzic et. al. 2022b] technique for transformer models that get...
The paper proposes a novel setting for anomaly detection where the visual data also has a set of attributes that describe the environmental parameters. The proposed method focuses on a setting where the user can define one or more nuisance attributes such that the algorithm should ignore the impact of nuisance attribut...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper proposes a novel setting for anomaly detection where the visual data also has a set of attributes that describe the environmental parameters. The proposed method focuses on a setting where the user can define one or more nuisance attributes such that the algorithm should ignore the impact of nuisance ...
This paper introduces a method to learn invariant listwise representations for ranking. A theoretical generalization bound is presented by analyzing domain adaptation for learning to listwise rank. Experimental results demonstrate the effectiveness of the proposed method on unsupervised domain adaptation for passage re...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper introduces a method to learn invariant listwise representations for ranking. A theoretical generalization bound is presented by analyzing domain adaptation for learning to listwise rank. Experimental results demonstrate the effectiveness of the proposed method on unsupervised domain adaptation for pa...
The authors proposed a new modal for training single-spike SNNs, which offers a 13.98x training speedup compared to a multi-spike counterpart. The speedup is achieved by avoiding all sequential dependence on time and exclusively relies on GPU parallelizable non-sequential operations. The effectiveness of the proposed m...
Recommendation: 5: marginally below the acceptance threshold
Area: General Machine Learning
Review: The authors proposed a new modal for training single-spike SNNs, which offers a 13.98x training speedup compared to a multi-spike counterpart. The speedup is achieved by avoiding all sequential dependence on time and exclusively relies on GPU parallelizable non-sequential operations. The effectiveness of the pr...
The paper proposes QAID, Question Answering inspired Intent Detection system, which models the intention detection classification as a question-answering task. The model uses two stages of training: a pretraining for better query representation and finetuning on few-shot labels of query and answers (name of intents). C...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper proposes QAID, Question Answering inspired Intent Detection system, which models the intention detection classification as a question-answering task. The model uses two stages of training: a pretraining for better query representation and finetuning on few-shot labels of query and answers (name of int...
This paper studies how to approximate Lipschitz functions in high dimensions for signals with low-dimensional structures. By assuming the existence of a linear Johnson-Linderstrauss embedding on the signals, the appropriation bounds of Lipschitz functions based on neural networks are given. It allows for better explana...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper studies how to approximate Lipschitz functions in high dimensions for signals with low-dimensional structures. By assuming the existence of a linear Johnson-Linderstrauss embedding on the signals, the appropriation bounds of Lipschitz functions based on neural networks are given. It allows for better...
The paper presents a method for learning a GAN for tabular data that performs conditional generation with semantic constraints for the structural properties in the tabular dataset. This model is used to generate perturbed samples that are, it is argued, intuitively performing a similar role to the perturbations in dist...
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 presents a method for learning a GAN for tabular data that performs conditional generation with semantic constraints for the structural properties in the tabular dataset. This model is used to generate perturbed samples that are, it is argued, intuitively performing a similar role to the perturbations...
The authors propose a benchmark to solely focus on benchmarking Deep Reinforcement Learning agents' memory and ability to generalise. In addition to open source accessibility, simulation step speed and flexibility (level hardness, noise etc) the authors claim their benchmark is better suited to distinctly evaluate the ...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The authors propose a benchmark to solely focus on benchmarking Deep Reinforcement Learning agents' memory and ability to generalise. In addition to open source accessibility, simulation step speed and flexibility (level hardness, noise etc) the authors claim their benchmark is better suited to distinctly evalu...
This paper has reformulated soft threshold pruning as an implicit optimization problem solved using the Iterative Shrinkage-Thresholding Algorithm (ISTA), and proposed a unified theoretical framework for soft threshold pruning. Experiments have shown that the proposed method outperforms SOTA soft threshold pruning algo...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper has reformulated soft threshold pruning as an implicit optimization problem solved using the Iterative Shrinkage-Thresholding Algorithm (ISTA), and proposed a unified theoretical framework for soft threshold pruning. Experiments have shown that the proposed method outperforms SOTA soft threshold prun...
This paper illustrates the desired IRM solution $f_{\text{IRM}}$ does not belong to the Pareto front of the IRMv1/IRMs loss included MOO problem in the environment (Kamath et al., 2021) described. This paper includes the VERx objective by (Krueger et al., 2021) into the MOO problem (IRMX) and shows in Proposition 1 tha...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper illustrates the desired IRM solution $f_{\text{IRM}}$ does not belong to the Pareto front of the IRMv1/IRMs loss included MOO problem in the environment (Kamath et al., 2021) described. This paper includes the VERx objective by (Krueger et al., 2021) into the MOO problem (IRMX) and shows in Propositi...
This paper raises a bar against an adversary who aims to reverse-engineer efficient models deployed to edge devices. A naive deployment practice allows the attacker to just extract the model's architecture and parameters which work as a prior for other attacks (such as adversarial attacks). To address this issue, the p...
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 raises a bar against an adversary who aims to reverse-engineer efficient models deployed to edge devices. A naive deployment practice allows the attacker to just extract the model's architecture and parameters which work as a prior for other attacks (such as adversarial attacks). To address this issu...
The authors utilize the pre-trained conditional generation model as a data augmentation technique to facilitate transfer learning. Extensive experience done prove the effectiveness of the proposed method. Strength: Based on my knowledge, the authors are the first to apply the pre-trained GAN to transfer learning. It's ...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The authors utilize the pre-trained conditional generation model as a data augmentation technique to facilitate transfer learning. Extensive experience done prove the effectiveness of the proposed method. Strength: Based on my knowledge, the authors are the first to apply the pre-trained GAN to transfer learnin...
In this paper, the authors provide new differentially private (DP) mechanisms for gradient-based machine learning (ML) training involving multiple passes (epochs) of a dataset, substantially improving the achievable privacy-utility-computation tradeoff. They propose a framework for computing the sensitivity of matrix m...
Recommendation: 5: marginally below the acceptance threshold
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: In this paper, the authors provide new differentially private (DP) mechanisms for gradient-based machine learning (ML) training involving multiple passes (epochs) of a dataset, substantially improving the achievable privacy-utility-computation tradeoff. They propose a framework for computing the sensitivity of ...
Existing exploration methods tend to explore at the frontier of the currently seen states. The authors of this paper propose to direct the goal-conditioned policy in a way that induces higher exploration value trajectories for the agent. Specifically they first use the goal-conditioned policy $\pi^G$ to reach a such a ...
Recommendation: 8: accept, good paper
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: Existing exploration methods tend to explore at the frontier of the currently seen states. The authors of this paper propose to direct the goal-conditioned policy in a way that induces higher exploration value trajectories for the agent. Specifically they first use the goal-conditioned policy $\pi^G$ to reach a...
The paper introduces a method for seq2seq tasks which incorporates the target sequence itself to learn a latent variable that informs the target prediction. This is done by using an EM-network that conditions on the target, with cross-attention to the regular seq2seq encoder representations, yielding the latent represe...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper introduces a method for seq2seq tasks which incorporates the target sequence itself to learn a latent variable that informs the target prediction. This is done by using an EM-network that conditions on the target, with cross-attention to the regular seq2seq encoder representations, yielding the latent...
This paper addresses the problem of systematic generalization in VQA. It proposes a new model that takes advantage of the learning capability of Transformers and the compositional modeling of Module Networks. The proposed model achieves state-of-the-art performance on three different VQA datasets including standard tes...
Recommendation: 5: marginally below the acceptance threshold
Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces)
Review: This paper addresses the problem of systematic generalization in VQA. It proposes a new model that takes advantage of the learning capability of Transformers and the compositional modeling of Module Networks. The proposed model achieves state-of-the-art performance on three different VQA datasets including stan...
This paper starts from a PCN and expands around the limit where the output is not tethered to the target. Perturbing in the parameter $\lambda$, which may be interpreted as the precision parameter deciding how tightly would the target be tied to the output, builds a useful bridge to many other approaches to training ne...
Recommendation: 8: accept, good paper
Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces)
Review: This paper starts from a PCN and expands around the limit where the output is not tethered to the target. Perturbing in the parameter $\lambda$, which may be interpreted as the precision parameter deciding how tightly would the target be tied to the output, builds a useful bridge to many other approaches to tra...
The paper proposes a generative framework for synthesizing multi-view consistent portrait videos. Towards this, the authors employed EG3D architecture in NeRF and made the network conditioned on motion features. 2 discriminators are used to maintain spatial and temporal consistency. While it’s claimed in the paper that...
Recommendation: 8: accept, good paper
Area: Generative models
Review: The paper proposes a generative framework for synthesizing multi-view consistent portrait videos. Towards this, the authors employed EG3D architecture in NeRF and made the network conditioned on motion features. 2 discriminators are used to maintain spatial and temporal consistency. While it’s claimed in the pa...
This paper analyzes the ability to identify the source model that generated the audio files. The authors explore generating samples from seven models different models. Specifically, the authors trained a classification network to distinguish between the samples. Results suggest that such classifiers can almost perfectl...
Recommendation: 3: reject, not good enough
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: This paper analyzes the ability to identify the source model that generated the audio files. The authors explore generating samples from seven models different models. Specifically, the authors trained a classification network to distinguish between the samples. Results suggest that such classifiers can almost ...
The paper studies federated learning with heterogeneous label noise, and they propose a dual structure to solve the problem: they introduce a local and personalized denoising model to each client, which helps the global model select filter noisy samples, and then update. The paper also provides some favorable experimen...
Recommendation: 5: marginally below the acceptance threshold
Area: General Machine Learning
Review: The paper studies federated learning with heterogeneous label noise, and they propose a dual structure to solve the problem: they introduce a local and personalized denoising model to each client, which helps the global model select filter noisy samples, and then update. The paper also provides some favorable e...
As the title suggests, this work studies bags of tricks for FGSM AT. Strength 1: This work performs a comprehensive analysis on FGSM AT Strength 2: Competitive performance. Weakness1: The main concern is that this work mainly relies on empirical results on showing effectiveness. For example, it is fully unclear why ...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: As the title suggests, this work studies bags of tricks for FGSM AT. Strength 1: This work performs a comprehensive analysis on FGSM AT Strength 2: Competitive performance. Weakness1: The main concern is that this work mainly relies on empirical results on showing effectiveness. For example, it is fully uncl...
This paper presents a benchmark and a set of studies about the sensitivity of trajectory prediction models to the removal of non-causal agents. The authors had human labelers label the agents that influence the ego behavior in the WOMD validation set. They then used those labels to perturb the dataset. They considered...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper presents a benchmark and a set of studies about the sensitivity of trajectory prediction models to the removal of non-causal agents. The authors had human labelers label the agents that influence the ego behavior in the WOMD validation set. They then used those labels to perturb the dataset. They co...
This paper studied the generalization problem in RL and used Bayesian regret as a performance measure. The authors considered if the agent is allowed to use the data from interaction with the testing environment. I feel this is an interesting paper. Considering testing time interaction is the right way to think about...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper studied the generalization problem in RL and used Bayesian regret as a performance measure. The authors considered if the agent is allowed to use the data from interaction with the testing environment. I feel this is an interesting paper. Considering testing time interaction is the right way to thi...
The paper proposes an image-goal navigation (ImageNav) method on top of VGM (Kwon et al. 2021) which builds a topological graph. The proposed method, MemoNav considers VGM as the short-term memory (STM) and removes some nodes based on thresholding on attention score (selective forgetting). The modified STMs are fed int...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The paper proposes an image-goal navigation (ImageNav) method on top of VGM (Kwon et al. 2021) which builds a topological graph. The proposed method, MemoNav considers VGM as the short-term memory (STM) and removes some nodes based on thresholding on attention score (selective forgetting). The modified STMs are...
The paper leads a discussion on multi-vector document retrieval by introducing a sparse alignment perspective that can include serval previous document retrieval scheme. On top of that, the paper proposes an entropy-regularized sparse relaxation of the novel alignment scheme by separating the query-document token-wise ...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper leads a discussion on multi-vector document retrieval by introducing a sparse alignment perspective that can include serval previous document retrieval scheme. On top of that, the paper proposes an entropy-regularized sparse relaxation of the novel alignment scheme by separating the query-document tok...
The paper studies scaling of performance of deep learning-based methods for different image reconstruction tasks with respect to available training set sizes. Tasks investigated are U-net and SwinIR transformer for image denoising (and super-resolution in the appendix), as well as U-net for MRI compressive sensing. Exp...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: The paper studies scaling of performance of deep learning-based methods for different image reconstruction tasks with respect to available training set sizes. Tasks investigated are U-net and SwinIR transformer for image denoising (and super-resolution in the appendix), as well as U-net for MRI compressive sens...
This paper proposes a method for watermarking deep neural networks for classification against adversarial attacks. The authors proposed a min-max formulation of the watermark defense problem and solved the problem through first-order approximations to the inner maximization problems. Experiment results show the method ...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: This paper proposes a method for watermarking deep neural networks for classification against adversarial attacks. The authors proposed a min-max formulation of the watermark defense problem and solved the problem through first-order approximations to the inner maximization problems. Experiment results show the...
This paper proposes a novel hierachical Bayesian approach to FL, with variational inference. The idea is to use two levels of random variables, the higher level $\phi$ which is shared among clients, and lower level $\theta_i$'s for each client $i$. This allows flexibility of conditional independence and personalization...
Recommendation: 5: marginally below the acceptance threshold
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: This paper proposes a novel hierachical Bayesian approach to FL, with variational inference. The idea is to use two levels of random variables, the higher level $\phi$ which is shared among clients, and lower level $\theta_i$'s for each client $i$. This allows flexibility of conditional independence and persona...
This paper addresses the problem that the high probability density region of the ordinary Gaussian prior becomes small as the latent dimension increases in VAE. The authors proposed a tilted Gaussian. This distribution on the hypersphere is exponentially larger in volume than the Gaussian according to the dimension. It...
Recommendation: 6: marginally above the acceptance threshold
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: This paper addresses the problem that the high probability density region of the ordinary Gaussian prior becomes small as the latent dimension increases in VAE. The authors proposed a tilted Gaussian. This distribution on the hypersphere is exponentially larger in volume than the Gaussian according to the dimen...
The success of contrastive learning has been heavily relying on the quality of data augmentations. This paper tries to reduce this reliance by augmenting the augmentation graph with some other "kernel graph", where the kernel is defined with prior knowledge, such as features of generative models or attributes of data p...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: The success of contrastive learning has been heavily relying on the quality of data augmentations. This paper tries to reduce this reliance by augmenting the augmentation graph with some other "kernel graph", where the kernel is defined with prior knowledge, such as features of generative models or attributes o...
This manuscript investigates the setting where there exists a mismatch between the training MDP and the testing MDP (known as robust RL). While robust RL is quite conservative in that the adversary could minimize the protagonist's utility over every MDP in the uncertainty set, this manuscript believes that it is too co...
Recommendation: 8: accept, good paper
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This manuscript investigates the setting where there exists a mismatch between the training MDP and the testing MDP (known as robust RL). While robust RL is quite conservative in that the adversary could minimize the protagonist's utility over every MDP in the uncertainty set, this manuscript believes that it i...
This paper presents a graph and GCN based method for long-term time series forecasting. The method aims to deal with three challenges: 1. modeling relationship between variables, 2. modeling local dynamic changes, 3. improving efficiency. The method constructs three graph views from the input time series, and extracts ...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper presents a graph and GCN based method for long-term time series forecasting. The method aims to deal with three challenges: 1. modeling relationship between variables, 2. modeling local dynamic changes, 3. improving efficiency. The method constructs three graph views from the input time series, and e...
This paper introduces the implicit distribution in the label distribution learning framework to handle the uncertainty of each label value in the label distribution training set. It uses deep implicit representation learning to construct a label distribution matrix with Gaussian prior constraints to moderate the noise ...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: This paper introduces the implicit distribution in the label distribution learning framework to handle the uncertainty of each label value in the label distribution training set. It uses deep implicit representation learning to construct a label distribution matrix with Gaussian prior constraints to moderate th...
This paper studies the (non)convergence of gd on general 1d function, $f(x)=\frac{1}{4}(x^2-\mu)^2$, two-layer single-neuron homogeneous network and matrix factorization, and shows a similar patten among then, i.e. GD converges to a period-2 orbit around the minimizer when step size slightly exceed the critical value f...
Recommendation: 5: marginally below the acceptance threshold
Area: Optimization (eg, convex and non-convex optimization)
Review: This paper studies the (non)convergence of gd on general 1d function, $f(x)=\frac{1}{4}(x^2-\mu)^2$, two-layer single-neuron homogeneous network and matrix factorization, and shows a similar patten among then, i.e. GD converges to a period-2 orbit around the minimizer when step size slightly exceed the critical...
This paper proposes a new method to prune a robust DNN with layer-wise compression rate and score-based pruning masks. Experimental study shows that, by taking advantage of both two factors, it maintains accuracy while allows for less robustness degradation than SOTAs. Strength - It is good to see that the non-uniform ...
Recommendation: 6: marginally above the acceptance threshold
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: This paper proposes a new method to prune a robust DNN with layer-wise compression rate and score-based pruning masks. Experimental study shows that, by taking advantage of both two factors, it maintains accuracy while allows for less robustness degradation than SOTAs. Strength - It is good to see that the non-...
In this paper, the authors studied logistic regression on separable data. It is known, for example in [1], that when the data is linearly separable, gradient descent (GD) on the logistic loss converges to the max-margin classifier with a very slow rate $O(\log \log t/\log t)$. In the setting of sparse linear regression...
Recommendation: 8: accept, good paper
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: In this paper, the authors studied logistic regression on separable data. It is known, for example in [1], that when the data is linearly separable, gradient descent (GD) on the logistic loss converges to the max-margin classifier with a very slow rate $O(\log \log t/\log t)$. In the setting of sparse linear re...
This paper investigates the problem of few-shot node classification on graphs. To improve the performance, the authors find that the node importance in each task is very important and should be taken into consideration when generating the prototype of each class. In particular, the authors theoretically and empirically...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper investigates the problem of few-shot node classification on graphs. To improve the performance, the authors find that the node importance in each task is very important and should be taken into consideration when generating the prototype of each class. In particular, the authors theoretically and emp...
This paper studies learnability of (coarse) correlated and Nash equilibria supported on rationalizable actions in unknown multiplayer normal-form games. After introducing the relevant concepts, the authors derive the first main result: a probabilistic bandit algorithm that identifies a rationalizable action profile usi...
Recommendation: 8: accept, good paper
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: This paper studies learnability of (coarse) correlated and Nash equilibria supported on rationalizable actions in unknown multiplayer normal-form games. After introducing the relevant concepts, the authors derive the first main result: a probabilistic bandit algorithm that identifies a rationalizable action pro...
This paper proposes Decision Diffuser, a diffusion-based model for sequential decision making where only the states of a trajectory are modeled and an inverse dynamics model is used to predict actions. Classifier free guidance is used to bring in conditional information, in the form of maximizing returns, satisfying co...
Recommendation: 8: accept, good paper
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper proposes Decision Diffuser, a diffusion-based model for sequential decision making where only the states of a trajectory are modeled and an inverse dynamics model is used to predict actions. Classifier free guidance is used to bring in conditional information, in the form of maximizing returns, satis...
The paper formulates partial transportability to bound the query in the target domain in the domain generalization problem. The authors show that invariance learning is a special case of partial transportability tasks and show that invariant predictors and more general solutions to robust optimization problems. They ev...
Recommendation: 6: marginally above the acceptance threshold
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: The paper formulates partial transportability to bound the query in the target domain in the domain generalization problem. The authors show that invariance learning is a special case of partial transportability tasks and show that invariant predictors and more general solutions to robust optimization problems....
MoEs have been reported to be parameter inefficient such that larger models do not always lead to better performance. This work proposes a parameter-efficient MoE models, by learning a soft combination of a global set of expert layers for each MoE layer. Experimental results show that SaMoE improves parameter efficienc...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: MoEs have been reported to be parameter inefficient such that larger models do not always lead to better performance. This work proposes a parameter-efficient MoE models, by learning a soft combination of a global set of expert layers for each MoE layer. Experimental results show that SaMoE improves parameter e...
The paper proposes a more efficient approach for finding a topological ordering based on identifying low variance entries along the diagonal of the Hessian of the log density. Unlike the previous approach, this method does not require iteratively reestimating the entire Hessian to identify each leaf node. The approach ...
Recommendation: 6: marginally above the acceptance threshold
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: The paper proposes a more efficient approach for finding a topological ordering based on identifying low variance entries along the diagonal of the Hessian of the log density. Unlike the previous approach, this method does not require iteratively reestimating the entire Hessian to identify each leaf node. The a...
The paper studies the learning dynamics of a linear recurrent network with and without interneurons. Theoretical analysis and numerical simulation both suggest the network with interneurons converges faster in learning. The present paper is mathematically sound by theoretically analyzing the learning dynamics. I have n...
Recommendation: 8: accept, good paper
Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces)
Review: The paper studies the learning dynamics of a linear recurrent network with and without interneurons. Theoretical analysis and numerical simulation both suggest the network with interneurons converges faster in learning. The present paper is mathematically sound by theoretically analyzing the learning dynamics. ...
The paper proposes a method for initializing a larger model by learning a linearly map using the parameters of a small model to obtain the parameters of a larger one, thus reducing the training cost of the larger model by using the existing small model. Kronecker factorization is used to reduce the computational parame...
Recommendation: 8: accept, good paper
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper proposes a method for initializing a larger model by learning a linearly map using the parameters of a small model to obtain the parameters of a larger one, thus reducing the training cost of the larger model by using the existing small model. Kronecker factorization is used to reduce the computationa...
To address three applications of OOD: OOD detection, Open-set SSL and Open-set DA, this work proposes a novel data augmentation method, named HOOD. They analyze the data generation process from a causal perspective, and uses a variational inference network to disentangle the content and style from the input data. Then,...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: To address three applications of OOD: OOD detection, Open-set SSL and Open-set DA, this work proposes a novel data augmentation method, named HOOD. They analyze the data generation process from a causal perspective, and uses a variational inference network to disentangle the content and style from the input dat...
This paper proposes to address the knowledge graph reason where, besides entity and relation representation, first order logic is also considered. In doing so the authors propose to enrich RotatE with a RNN for embedding score and a separate grounding embedding for scores.Two scores are shallowly composed in the infere...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper proposes to address the knowledge graph reason where, besides entity and relation representation, first order logic is also considered. In doing so the authors propose to enrich RotatE with a RNN for embedding score and a separate grounding embedding for scores.Two scores are shallowly composed in th...
This paper proposes a layer freezing method to improve training efficiency by introducing attention-guided layers. SmartFRZ aggregates the historical weights using the attention-based predictor to allow the dynamic decision of freezing layers leading to the efficient training framework. The authors support their method...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper proposes a layer freezing method to improve training efficiency by introducing attention-guided layers. SmartFRZ aggregates the historical weights using the attention-based predictor to allow the dynamic decision of freezing layers leading to the efficient training framework. The authors support thei...
Inspired by classes of biological neurons, the authors explore if RNNs can be trained to perform simple RL tasks via neuron activation function optimization. Strengths - Learning via activation functions is an interesting and important direction of research, as is the connection to biological neuron response function...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: Inspired by classes of biological neurons, the authors explore if RNNs can be trained to perform simple RL tasks via neuron activation function optimization. Strengths - Learning via activation functions is an interesting and important direction of research, as is the connection to biological neuron response ...
The authors propose an approach to abstraction in reinforcement learning. The proposed approach starts with a coarse state abstraction and iteratively refines it. The basis for the refinement is the dispersion in the Q-values as the agent continues to learn. The approach is empirically evaluated in three grid-based dom...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The authors propose an approach to abstraction in reinforcement learning. The proposed approach starts with a coarse state abstraction and iteratively refines it. The basis for the refinement is the dispersion in the Q-values as the agent continues to learn. The approach is empirically evaluated in three grid-b...
The paper presents the decision diffuser for decision-making. The core idea is to model the decision making as a conditional generative model, which is different from the complex reinforcement learning-based works. Specifically, the method models a policy as a conditional generative model where the diffusion process is...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The paper presents the decision diffuser for decision-making. The core idea is to model the decision making as a conditional generative model, which is different from the complex reinforcement learning-based works. Specifically, the method models a policy as a conditional generative model where the diffusion pr...
This paper proposes a new gradient inversion attack against federated learning. By assuming that the server has access to some auxiliary data, the main idea of the paper is to learn a gradient inversion model from the auxiliary data. The paper shows that compared with previous optimization-based approaches such as Inve...
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 new gradient inversion attack against federated learning. By assuming that the server has access to some auxiliary data, the main idea of the paper is to learn a gradient inversion model from the auxiliary data. The paper shows that compared with previous optimization-based approaches such...
This paper presents an in-depth review of detection of diffusion-model generated images. This paper evaluates SOTA detectors on a range of DMs and then analyzes the differences of many aspects between DM-generated images and GAN generated images in addition to image fidelity. The experimental setup of this paper is re...
Recommendation: 8: accept, good paper
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: This paper presents an in-depth review of detection of diffusion-model generated images. This paper evaluates SOTA detectors on a range of DMs and then analyzes the differences of many aspects between DM-generated images and GAN generated images in addition to image fidelity. The experimental setup of this pap...
This paper presents a robust variant of the standard Transformer named Transformer-RKDE to improve the robustness of data with contaminated samples. The idea is based on the interpretation that the self-attention in transformer can be viewed as a non-parametric estimator based on the kernel density estimation (KDE). Th...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper presents a robust variant of the standard Transformer named Transformer-RKDE to improve the robustness of data with contaminated samples. The idea is based on the interpretation that the self-attention in transformer can be viewed as a non-parametric estimator based on the kernel density estimation (...
This paper proposed a Target Conditioned Representation Independence objective for domain generalization. It claims that a domain-invariant representation may not extend to test domains and refine it to a domain-general representation. Based on this, this paper proposed the TCRI objective and evaluate it on synthetic a...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper proposed a Target Conditioned Representation Independence objective for domain generalization. It claims that a domain-invariant representation may not extend to test domains and refine it to a domain-general representation. Based on this, this paper proposed the TCRI objective and evaluate it on syn...
This paper proposes a method for multi-person pose estimation method, which integrates human detection and human pose estimation into an end-to-end framework. The first part of this framework is a human detector based on deformable DETR and DAB-DETR, and outputs human-instance features and estimated human bounding boxe...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper proposes a method for multi-person pose estimation method, which integrates human detection and human pose estimation into an end-to-end framework. The first part of this framework is a human detector based on deformable DETR and DAB-DETR, and outputs human-instance features and estimated human bound...
This paper focus on the particularity of class weights in semantic segmentation and explicitly consider an important issue , named as Boundary-caused Class Weights Confusion (BCWC). The authors propose a novel method, E-CRF, via combining CNN network with CRF as an organic whole to alleviate BCWC from two aspects (i.e...
Recommendation: 5: marginally below the acceptance threshold
Area: General Machine Learning
Review: This paper focus on the particularity of class weights in semantic segmentation and explicitly consider an important issue , named as Boundary-caused Class Weights Confusion (BCWC). The authors propose a novel method, E-CRF, via combining CNN network with CRF as an organic whole to alleviate BCWC from two aspe...
Existing training-based NAS algorithms typically select the final architecture that achieves the largest architecture parameters. This however can be unstable and unreliable in practice because of the limited representation ability of these architecture parameters. To this end, this paper introduces the self-attention ...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: Existing training-based NAS algorithms typically select the final architecture that achieves the largest architecture parameters. This however can be unstable and unreliable in practice because of the limited representation ability of these architecture parameters. To this end, this paper introduces the self-at...
This work proposes a neural probabilistic programming language that supports both discrete and continuous variables, called DeepSeaProbLog. An implementation of DeepSeaProbLog that allows inference and gradient-based learning is further proposed, by leveraging a reduction to weighted model integration and differentiati...
Recommendation: 6: marginally above the acceptance threshold
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: This work proposes a neural probabilistic programming language that supports both discrete and continuous variables, called DeepSeaProbLog. An implementation of DeepSeaProbLog that allows inference and gradient-based learning is further proposed, by leveraging a reduction to weighted model integration and diffe...
This paper presents a method, called transcendental idealism of planner (TIP), to evaluate the end-to-end performance of a perception model in terms of how it affects AV planning. The authors formulate the planning of an autonomous vehicle as an expected utility maximization (EUM) problem. They further show that the ob...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper presents a method, called transcendental idealism of planner (TIP), to evaluate the end-to-end performance of a perception model in terms of how it affects AV planning. The authors formulate the planning of an autonomous vehicle as an expected utility maximization (EUM) problem. They further show tha...
This paper studies regret minimization in general-sum finite games. Such guarantees directly translate into the ones on convergence rate to approximated coarse correlated equilibrium. The main contribution is a stochastic version of the optimistic mirror descent algorithm that allows to achieve smaller regret (in expec...
Recommendation: 8: accept, good paper
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: This paper studies regret minimization in general-sum finite games. Such guarantees directly translate into the ones on convergence rate to approximated coarse correlated equilibrium. The main contribution is a stochastic version of the optimistic mirror descent algorithm that allows to achieve smaller regret (...
The work addresses the problem of learning a causal graph, or rather the set of compatible graphs in the equivalence class, from time-series data when facing the challenge of undersampling, that is, when the sampling rate does not match the rate of the data-generating process. It assumes the presence of a compressed gr...
Recommendation: 6: marginally above the acceptance threshold
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: The work addresses the problem of learning a causal graph, or rather the set of compatible graphs in the equivalence class, from time-series data when facing the challenge of undersampling, that is, when the sampling rate does not match the rate of the data-generating process. It assumes the presence of a compr...
This paper proposes SimReg, a method that achieves the goal of debiasing by increasing(decreasing) the similarity between the final model and an unbiased(biased) model. They explore two different ways to impose the regularization: on model representation or on the gradients. Except for similarity-based regularization,...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper proposes SimReg, a method that achieves the goal of debiasing by increasing(decreasing) the similarity between the final model and an unbiased(biased) model. They explore two different ways to impose the regularization: on model representation or on the gradients. Except for similarity-based regular...
This paper observes barriers in the loss landscape between fine-tune models which have discovered different "generalization strategies" in the context of text classification. In contrast, models with the same generalization strategies have no barrier when interpolating linearly between the two models. Strengths: - The...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: This paper observes barriers in the loss landscape between fine-tune models which have discovered different "generalization strategies" in the context of text classification. In contrast, models with the same generalization strategies have no barrier when interpolating linearly between the two models. Strength...
This paper studies machine learning fairness in visual recognition. The unifying idea of this paper is to use both real and generated data to improve fairness via adaptive sampling. The iterative procedure adaptively adjusts data ratios between real and generated data based on feedback from a classifier. The authors ca...
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 studies machine learning fairness in visual recognition. The unifying idea of this paper is to use both real and generated data to improve fairness via adaptive sampling. The iterative procedure adaptively adjusts data ratios between real and generated data based on feedback from a classifier. The au...
The paper proposes a surprisingly simple approach for mitigating spurious correlation via linear probing on a balanced dataset. The paper conducts comprehensive empirical studies on worst group robustness benchmarks and ImageNet variants. Strengths - The proposed idea of retraining the linear head is simple and natur...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper proposes a surprisingly simple approach for mitigating spurious correlation via linear probing on a balanced dataset. The paper conducts comprehensive empirical studies on worst group robustness benchmarks and ImageNet variants. Strengths - The proposed idea of retraining the linear head is simple a...
This work mainly focuses on the lower inference speed and lacking effective configurations for trainable parameters tailored for each task. It proposed a simple but effective approach named Sensitivity-aware visual Parameter-efficient Tuning (SPT) for these challenges. It quickly identifies the important parameters of ...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This work mainly focuses on the lower inference speed and lacking effective configurations for trainable parameters tailored for each task. It proposed a simple but effective approach named Sensitivity-aware visual Parameter-efficient Tuning (SPT) for these challenges. It quickly identifies the important parame...
This work proves that overparametrized deep linear networks can converge as fast as gradient descent on the equivalent linear regressor Strength: (1) the result has some fundamental importance. (2) the result that deeper nets can converge as fast as a convex linear model is both rather surprising and important I think...
Recommendation: 6: marginally above the acceptance threshold
Area: General Machine Learning
Review: This work proves that overparametrized deep linear networks can converge as fast as gradient descent on the equivalent linear regressor Strength: (1) the result has some fundamental importance. (2) the result that deeper nets can converge as fast as a convex linear model is both rather surprising and important ...
This paper presents combines CLIP with large language models like GPT3 to create customized prompts for zero-shot image classification. Specifically authors leverage the knowledge contained in LLMs in order to generate many descriptive sentences that are customized for each object category for prompting CLIP models. Ex...
Recommendation: 3: reject, not good enough
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper presents combines CLIP with large language models like GPT3 to create customized prompts for zero-shot image classification. Specifically authors leverage the knowledge contained in LLMs in order to generate many descriptive sentences that are customized for each object category for prompting CLIP mo...
This paper proposes a model-based value exploration technique to improve actor-critic RL algorithms. This approach involves training models for transition probability and rewards. By one-step prediction using the models, this approach provides effective target value (Q function) exploration. By theoretical analysis and...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper proposes a model-based value exploration technique to improve actor-critic RL algorithms. This approach involves training models for transition probability and rewards. By one-step prediction using the models, this approach provides effective target value (Q function) exploration. By theoretical anal...
The manuscript introduces a new way of learning task-specific unsupervised learning rule for RNNs in which the network computes not only its task output but also dynamically alters hyperparameters of its own learning process. The learning rule functional form is learned in a gradient-based outer loop based on task cons...
Recommendation: 6: marginally above the acceptance threshold
Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces)
Review: The manuscript introduces a new way of learning task-specific unsupervised learning rule for RNNs in which the network computes not only its task output but also dynamically alters hyperparameters of its own learning process. The learning rule functional form is learned in a gradient-based outer loop based on t...
This paper designs a new decentralized learning algorithm in cooperative multi-agent reinforcement learning where no communication or parameter sharing among agents is allowed. From each agent’s point of view, the transition probability is non-stationary due to the other agents’ changing policies. The proposed best pos...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper designs a new decentralized learning algorithm in cooperative multi-agent reinforcement learning where no communication or parameter sharing among agents is allowed. From each agent’s point of view, the transition probability is non-stationary due to the other agents’ changing policies. The proposed ...
The given work proposes a meta learning based task for predicting human behaviour in Normal Form games. The authors showcase this technique on auto generated tasks The authors evaluate this against baselines on a curated dataset from human action behaviour. The author's demonstrate that their approach is able to achie...
Recommendation: 5: marginally below the acceptance threshold
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: The given work proposes a meta learning based task for predicting human behaviour in Normal Form games. The authors showcase this technique on auto generated tasks The authors evaluate this against baselines on a curated dataset from human action behaviour. The author's demonstrate that their approach is able ...
The paper proposes trainable activation functions for physics-informed neural networks (PINNs). The basic idea is to consider a set of base activation functions, and build a trainable one as a convex combination of the base ones. They provide experiments on many problems, showing that PINNs are generally sensitive to t...
Recommendation: 3: reject, not good enough
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: The paper proposes trainable activation functions for physics-informed neural networks (PINNs). The basic idea is to consider a set of base activation functions, and build a trainable one as a convex combination of the base ones. They provide experiments on many problems, showing that PINNs are generally sensit...
The paper proposes a novel transformer framework that involve equivariance for the inputs. It shows high performance on OC20 dataset and comparable results on MD17 and QM9. Strength: 1. The proposed method considers various equivariances in transformer frameworks. 2. The experimental results of IS2RE for OC20 dataset o...
Recommendation: 6: marginally above the acceptance threshold
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: The paper proposes a novel transformer framework that involve equivariance for the inputs. It shows high performance on OC20 dataset and comparable results on MD17 and QM9. Strength: 1. The proposed method considers various equivariances in transformer frameworks. 2. The experimental results of IS2RE for OC20 d...
In this paper the authors study how to compute different group fairness measures when relying on pre-trained models to predict group attributes. The paper provides a general mathematical formulation that focuses on estimating the transition probabilities (essentially the normalized confusion matrix) between ground tru...
Recommendation: 3: reject, not good enough
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: In this paper the authors study how to compute different group fairness measures when relying on pre-trained models to predict group attributes. The paper provides a general mathematical formulation that focuses on estimating the transition probabilities (essentially the normalized confusion matrix) between gr...
This paper continues the recent line of work on high-probability generalization and excess risk bounds for stable algorithms. In this regard the paper: * Extends the nearly-optimal generalization bounds for uniformly stable algorithms to $L_q$-stable algorithms. * Similarly, it extends the excess risk bounds for unifo...
Recommendation: 8: accept, good paper
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: This paper continues the recent line of work on high-probability generalization and excess risk bounds for stable algorithms. In this regard the paper: * Extends the nearly-optimal generalization bounds for uniformly stable algorithms to $L_q$-stable algorithms. * Similarly, it extends the excess risk bounds f...
The authors designed and experimented a one-stage text-to-speech model using a fully differenctiable method. [Strength] * Inference efficiency is higher than the previous work the authors compared. [Weaknesses] * Synthesis efficiency improved, but the quality seems to have degraded. - There are doubts about the resul...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The authors designed and experimented a one-stage text-to-speech model using a fully differenctiable method. [Strength] * Inference efficiency is higher than the previous work the authors compared. [Weaknesses] * Synthesis efficiency improved, but the quality seems to have degraded. - There are doubts about t...
This paper proposes a robust universal adversarial perturbation which is robust to many transformations such as rotation, pixel intensity. It proposes a robustness estimation approach which can be leveraged to conduct adversarial attack. positives: + it is important to improve the robustness of universal perturbation, ...
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 robust universal adversarial perturbation which is robust to many transformations such as rotation, pixel intensity. It proposes a robustness estimation approach which can be leveraged to conduct adversarial attack. positives: + it is important to improve the robustness of universal pertur...
The paper proposes a machine-learning-based approach for generating columns for LP relaxations of vertex cover problems (VCPs). The paper (implicitly) assumes that the VCPs are generated from some distribution and it proposes to learn a classifier to predict if a MIS is a part of the optimal solution, given a training ...
Recommendation: 6: marginally above the acceptance threshold
Area: General Machine Learning
Review: The paper proposes a machine-learning-based approach for generating columns for LP relaxations of vertex cover problems (VCPs). The paper (implicitly) assumes that the VCPs are generated from some distribution and it proposes to learn a classifier to predict if a MIS is a part of the optimal solution, given a t...
The paper deals with the problem of link prediction in graphs. Specifically, it proposes to leverage variations of the 2-dimensional Weisfeiler-Leman algorithm (2-WL) for this problem. The authors show how the 2-WL and folklore 2-WL (2-FWL) can be leveraged straightforwardly to design GNN-like neural architectures tha...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper deals with the problem of link prediction in graphs. Specifically, it proposes to leverage variations of the 2-dimensional Weisfeiler-Leman algorithm (2-WL) for this problem. The authors show how the 2-WL and folklore 2-WL (2-FWL) can be leveraged straightforwardly to design GNN-like neural architect...
The paper aims to accelerate the training workflow of convolution operators through sparsity. While recent work has explored structured/semi-unstructured sparsity to accelerate inference, this work targets training. The main challenge in leveraging sparsity in both forward and backward pass is crafting a sparsity mask ...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper aims to accelerate the training workflow of convolution operators through sparsity. While recent work has explored structured/semi-unstructured sparsity to accelerate inference, this work targets training. The main challenge in leveraging sparsity in both forward and backward pass is crafting a sparsi...
The paper considers the class of non-Markovian stochastic control problems in continuous time. In particular, two cases have been investigated. In the first case, the drift and diffusion coefficients are path-dependent. In the second, a fractional Brownian motion captures the randomness. The paper proposes a numerical ...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The paper considers the class of non-Markovian stochastic control problems in continuous time. In particular, two cases have been investigated. In the first case, the drift and diffusion coefficients are path-dependent. In the second, a fractional Brownian motion captures the randomness. The paper proposes a nu...
In this paper, the authors address the age old offline RL problem of counterfactual prediction, i.e. what would have happened if an unobserved action would have happened at an unobserved state. To do this, they use a weighted empirical risk minimization framework, which is extended with an adversarial framework to lear...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: In this paper, the authors address the age old offline RL problem of counterfactual prediction, i.e. what would have happened if an unobserved action would have happened at an unobserved state. To do this, they use a weighted empirical risk minimization framework, which is extended with an adversarial framework...
Hi, I'm currently on a medical leave and won't be able to perform ICRL review duties. sorry for the late notice. Hi, I'm currently on a medical leave and won't be able to perform ICRL review duties. sorry for the late notice. Hi, I'm currently on a medical leave and won't be able to perform ICRL review duties. sorry fo...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: Hi, I'm currently on a medical leave and won't be able to perform ICRL review duties. sorry for the late notice. Hi, I'm currently on a medical leave and won't be able to perform ICRL review duties. sorry for the late notice. Hi, I'm currently on a medical leave and won't be able to perform ICRL review duties. ...
The paper presents a diffusion model for an explicit neural fields. They extend the regular diffusion model training and sampling, but instead of assuming an explicit domain for the signal, like 2D grid for images, their model is general enough to work for all kinds of domain through neural field representation. That i...
Recommendation: 6: marginally above the acceptance threshold
Area: Generative models
Review: The paper presents a diffusion model for an explicit neural fields. They extend the regular diffusion model training and sampling, but instead of assuming an explicit domain for the signal, like 2D grid for images, their model is general enough to work for all kinds of domain through neural field representation...
This paper studies the key problem in deep learning: why pruning can help generalization. They consider a one-layer (I will explain why I call it one layer) neural network with ReLU activation, and assume certain structure of input data and labels. They model the pruning operator as the element wised multiplication be...
Recommendation: 5: marginally below the acceptance threshold
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: This paper studies the key problem in deep learning: why pruning can help generalization. They consider a one-layer (I will explain why I call it one layer) neural network with ReLU activation, and assume certain structure of input data and labels. They model the pruning operator as the element wised multiplic...