review
stringlengths
5
16.6k
score
stringclasses
5 values
area
stringclasses
12 values
text
stringlengths
31
5.65k
The authors study mini-batch stochastic iterative hard thresholding (IHT). IHT is a well known algorithm for sparse optimization with extensive literature. IHT is essentially $\ell_2$-projected gradient descent on the set of s-sparse vectors. Given the ML-wide focus on stochastic optimization algorithms, it is natural ...
Recommendation: 3: reject, not good enough
Area: Optimization (eg, convex and non-convex optimization)
Review: The authors study mini-batch stochastic iterative hard thresholding (IHT). IHT is a well known algorithm for sparse optimization with extensive literature. IHT is essentially $\ell_2$-projected gradient descent on the set of s-sparse vectors. Given the ML-wide focus on stochastic optimization algorithms, it is ...
The authors study from a theoretical point of view the extrapolation capabilities of linear RNNs in the teacher-student framework. They show that under certain conditions, students with 0 error may not extrapolate to longer time horizons than the ones they were trained on. They also show, that under the right parameter...
Recommendation: 5: marginally below the acceptance threshold
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: The authors study from a theoretical point of view the extrapolation capabilities of linear RNNs in the teacher-student framework. They show that under certain conditions, students with 0 error may not extrapolate to longer time horizons than the ones they were trained on. They also show, that under the right p...
This paper prooses the novel concept of populated region set, and make connection between the proposed PRS ratio and the adversarial robustness of the model. The paper further propose PRS regualrization that can improve adversarial robustness without adversarial training. ## Strength 1. This paper provides novel concep...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper prooses the novel concept of populated region set, and make connection between the proposed PRS ratio and the adversarial robustness of the model. The paper further propose PRS regualrization that can improve adversarial robustness without adversarial training. ## Strength 1. This paper provides nove...
This work studies a novel and interesting problem: muscular control with overactuated action spaces. It first demonstrates that the main issue with overactuated action spaces is how to effectively and efficiently perform exploration using a clear torquearm example with 2 and 600 DoF theoretically and empirically. It fu...
Recommendation: 8: accept, good paper
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This work studies a novel and interesting problem: muscular control with overactuated action spaces. It first demonstrates that the main issue with overactuated action spaces is how to effectively and efficiently perform exploration using a clear torquearm example with 2 and 600 DoF theoretically and empiricall...
This paper proposes an approach for Offline RL by explicitly modeling risk through CVaR. The paper targets stochastic environments and makes the case that modeling risk is essential for performing well in these settings by demonstrating improved performance in standard control tasks with noise injection in the rewards...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper proposes an approach for Offline RL by explicitly modeling risk through CVaR. The paper targets stochastic environments and makes the case that modeling risk is essential for performing well in these settings by demonstrating improved performance in standard control tasks with noise injection in the...
Motivated by the ’flash-to-bang' phenomenon, in this paper, the authors propose a new audio-visual learning model for sound source depth estimation. In particular, the authors formulate the sound source depth estimation as an audio-visual collision event localization task. To solve the task and increase depth estimatio...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: Motivated by the ’flash-to-bang' phenomenon, in this paper, the authors propose a new audio-visual learning model for sound source depth estimation. In particular, the authors formulate the sound source depth estimation as an audio-visual collision event localization task. To solve the task and increase depth e...
This paper focuses on sparse training, which aims to reduce the computational overhead of deep neural networks. Specifically, this work proposes a non-linear gradient-based method, namely, Gradient Annealing (GA), to address the trade-off between model sparsity and accuracy. Meanwhile, this paper combines one latest sp...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper focuses on sparse training, which aims to reduce the computational overhead of deep neural networks. Specifically, this work proposes a non-linear gradient-based method, namely, Gradient Annealing (GA), to address the trade-off between model sparsity and accuracy. Meanwhile, this paper combines one l...
This paper proposes to use superpixel-based tokens instead of fixed-shape patch tokens for image segmentation, and proposes a graph pooling between transformer blocks to create an increasing size of segmentation from the oversegmented superpixel map. Strength: 1. The motivations to use adaptive segment tokens are natur...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper proposes to use superpixel-based tokens instead of fixed-shape patch tokens for image segmentation, and proposes a graph pooling between transformer blocks to create an increasing size of segmentation from the oversegmented superpixel map. Strength: 1. The motivations to use adaptive segment tokens a...
This paper describes an adversarial imitation learning algorithm that learns a discriminator with patch pixel rewards rather than directly from images. Recent work in the vision deep learning community have shown that using patches is effective in embedding pixels. The authors argue that patch pixels rewards are more i...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper describes an adversarial imitation learning algorithm that learns a discriminator with patch pixel rewards rather than directly from images. Recent work in the vision deep learning community have shown that using patches is effective in embedding pixels. The authors argue that patch pixels rewards ar...
-This paper studies the problem of federated learning with semi-supervised client (local) data. They propose a method that first pre-trains the client models with their labeled training data, then performs cross-client label propagation based on the embeddings of the labeled and unlabeled training data obtained from th...
Recommendation: 3: reject, not good enough
Area: Unsupervised and Self-supervised learning
Review: -This paper studies the problem of federated learning with semi-supervised client (local) data. They propose a method that first pre-trains the client models with their labeled training data, then performs cross-client label propagation based on the embeddings of the labeled and unlabeled training data obtained...
This paper proposes an object-centric learning approach that scales to real-world data. The method builds on Slot Attention, but instead of reconstructing pixels, it reconstructs image features obtained by an encoder (e.g. ViT) pre-trained with self-supervision (DINO). Compared to standard Slot Attention, the paper sh...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: This paper proposes an object-centric learning approach that scales to real-world data. The method builds on Slot Attention, but instead of reconstructing pixels, it reconstructs image features obtained by an encoder (e.g. ViT) pre-trained with self-supervision (DINO). Compared to standard Slot Attention, the ...
This paper proposes to combine a measure of the difficulty of an example in a supervised classification task (AUM) with the performance of annotators, calculated from their confusion matrix on a crowd-sourcing task. This combined estimator, called WAUM (weighted AUM), allows to take into account both the intrinsect dif...
Recommendation: 6: marginally above the acceptance threshold
Area: General Machine Learning
Review: This paper proposes to combine a measure of the difficulty of an example in a supervised classification task (AUM) with the performance of annotators, calculated from their confusion matrix on a crowd-sourcing task. This combined estimator, called WAUM (weighted AUM), allows to take into account both the intrin...
The current study, as a strategy to effectively solve large-scale CVRP, presents a strategy for generating TSP sub-problems by clustering nodes and simultaneously solving the generated TSP problems. In particular, the sequential node selection approach has been used to decompose nodes. The decomposition strategy is a m...
Recommendation: 5: marginally below the acceptance threshold
Area: General Machine Learning
Review: The current study, as a strategy to effectively solve large-scale CVRP, presents a strategy for generating TSP sub-problems by clustering nodes and simultaneously solving the generated TSP problems. In particular, the sequential node selection approach has been used to decompose nodes. The decomposition strateg...
This paper proposes MULTIVIZ which is a method to analyze the workings of multi-modal models. The authors propose to break down the visualization / analysis problem into four primary pillars, namely: unimodal importance: how each modality contributes to the downstream tasks cross-modal interactions: how the multiple m...
Recommendation: 6: marginally above the acceptance threshold
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: This paper proposes MULTIVIZ which is a method to analyze the workings of multi-modal models. The authors propose to break down the visualization / analysis problem into four primary pillars, namely: unimodal importance: how each modality contributes to the downstream tasks cross-modal interactions: how the mu...
The paper investigates the latent separability of the existing backdoor attacks, which makes them easily caught by existing defenses that look at the latent space. The paper then crafts an attack using data poisoning without latent separability. The proposed adaptive backdoor attack method uses regularized samples (sam...
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 investigates the latent separability of the existing backdoor attacks, which makes them easily caught by existing defenses that look at the latent space. The paper then crafts an attack using data poisoning without latent separability. The proposed adaptive backdoor attack method uses regularized samp...
This paper provides a new method, WinIT, for interpreting predictions of multivariate time series. It provides an importance score for each feature in a multivariate time series according to explainability, considering the dependencies of features between time steps and variation in feature importance over time. The me...
Recommendation: 8: accept, good paper
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: This paper provides a new method, WinIT, for interpreting predictions of multivariate time series. It provides an importance score for each feature in a multivariate time series according to explainability, considering the dependencies of features between time steps and variation in feature importance over time...
This paper focuses on text-supervised semantic segmentation by studying a multi-view consistency learning framework. Specifically, a text-to-views consistency and a cross-view segmentation consistency training strategy are proposed and added upon existing work Group VIT. The proposed method tries to construct more trai...
Recommendation: 3: reject, not good enough
Area: Unsupervised and Self-supervised learning
Review: This paper focuses on text-supervised semantic segmentation by studying a multi-view consistency learning framework. Specifically, a text-to-views consistency and a cross-view segmentation consistency training strategy are proposed and added upon existing work Group VIT. The proposed method tries to construct m...
The manuscript proposes a novel multi-channel self-supervised framework for SEEG and EEG data. The framework comprises delayed-time-shift prediction, instantaneous time shift, replacement discriminative tasks, and an additional graph module. The results show improvements over previous related work and supervised models...
Recommendation: 5: marginally below the acceptance threshold
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: The manuscript proposes a novel multi-channel self-supervised framework for SEEG and EEG data. The framework comprises delayed-time-shift prediction, instantaneous time shift, replacement discriminative tasks, and an additional graph module. The results show improvements over previous related work and supervise...
This paper proposes a novel curriculum-based co-design method for evolving soft voxel-based robots. The main contributions are: - A novel curriculum mechanism that effectively evolves robots from simple to large design spaces. - A transformer-based control policy representation, enabling adaptation to arbitrary dimensi...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper proposes a novel curriculum-based co-design method for evolving soft voxel-based robots. The main contributions are: - A novel curriculum mechanism that effectively evolves robots from simple to large design spaces. - A transformer-based control policy representation, enabling adaptation to arbitrary...
The paper presents a discussion on the definition of the in-distribution (ID) vs. out-of-distribution (OOD) for OOD detection problems, arguing that existing methods fail to semantically extrapolate the in-distribution (e.g. the ID of flying and sitting birds should include and generalize to various backgrounds, e.g. s...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper presents a discussion on the definition of the in-distribution (ID) vs. out-of-distribution (OOD) for OOD detection problems, arguing that existing methods fail to semantically extrapolate the in-distribution (e.g. the ID of flying and sitting birds should include and generalize to various backgrounds...
The authors propose low-precision model memory (LPMM), which quantizes a model's parameters, gradients, and optimizer state to low precision. Prior works have focused only on params/gradients or optimizer state separately. The main challenge is that params, gradients, and momentum may have very different dynamic range,...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: The authors propose low-precision model memory (LPMM), which quantizes a model's parameters, gradients, and optimizer state to low precision. Prior works have focused only on params/gradients or optimizer state separately. The main challenge is that params, gradients, and momentum may have very different dynami...
This paper proposes to leverage visual attention as a diagnosis tool for reflecting the reason for error during models' task execution. The authors leverage a 2D language navigation task as the test bed and tested mainly using goal-conditioned imitation learning methods. They visualize attention on the 2D map to show w...
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 to leverage visual attention as a diagnosis tool for reflecting the reason for error during models' task execution. The authors leverage a 2D language navigation task as the test bed and tested mainly using goal-conditioned imitation learning methods. They visualize attention on the 2D map t...
This paper proposes adding topic model upon pretrained language models (PLMs), in order to increase its interpretability and downstream performance. More specifically, the authors design CLDA, a new LDA model compatible with continuous word counts, which are computed via aggregated attention scores of the last layer in...
Recommendation: 3: reject, not good enough
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: This paper proposes adding topic model upon pretrained language models (PLMs), in order to increase its interpretability and downstream performance. More specifically, the authors design CLDA, a new LDA model compatible with continuous word counts, which are computed via aggregated attention scores of the last ...
The paper proposes to use multi-objective optimization to generate adversarial examples for model ensembles, adversarial examples against several transformations, and universal adversarial perturbation. Specifically, by setting the different models in the ensemble as different objectives, it turns the problem into mult...
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 use multi-objective optimization to generate adversarial examples for model ensembles, adversarial examples against several transformations, and universal adversarial perturbation. Specifically, by setting the different models in the ensemble as different objectives, it turns the problem i...
This paper introduces an approach for learning to perform high-quality long-term video prediction via an object-centric latent bottleneck. The approach hinges on two key ideas. The first is to use a pre-trained temporal object discovery method to extract a sequence of aligned slots. The second is to use an autoregressi...
Recommendation: 8: accept, good paper
Area: Unsupervised and Self-supervised learning
Review: This paper introduces an approach for learning to perform high-quality long-term video prediction via an object-centric latent bottleneck. The approach hinges on two key ideas. The first is to use a pre-trained temporal object discovery method to extract a sequence of aligned slots. The second is to use an auto...
This paper proposed a new ViT architecture called LipsFormer, which replaces non-Lipschitz or unstable modules with Lipschitz continuous counterparts. Experiments show that LipsFormer obtains better Top-1 accuracy on Imagenet-1k dataset compared with previous works. Strength: This paper analyzes the Lipschitz bound o...
Recommendation: 8: accept, good paper
Area: Optimization (eg, convex and non-convex optimization)
Review: This paper proposed a new ViT architecture called LipsFormer, which replaces non-Lipschitz or unstable modules with Lipschitz continuous counterparts. Experiments show that LipsFormer obtains better Top-1 accuracy on Imagenet-1k dataset compared with previous works. Strength: This paper analyzes the Lipschitz...
This paper studies the peculiar observation that, with very sample sizes, robust training can be detrimental for robust error. The authors show that in a classification task given by a linear model, the robust risk of the max-margin classier can increase as a function of the perturbation size used during robust trainin...
Recommendation: 8: accept, good paper
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: This paper studies the peculiar observation that, with very sample sizes, robust training can be detrimental for robust error. The authors show that in a classification task given by a linear model, the robust risk of the max-margin classier can increase as a function of the perturbation size used during robust...
The paper proposes a new neural network interpretation and attribution framework which looks at heat flow to achieve multi-scale interpretation of a scalar-valued function Pros: - It is an interesting and novel idea to use the diffusion equation for the attribution problem - The paper is generally well written Cons: ...
Recommendation: 3: reject, not good enough
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: The paper proposes a new neural network interpretation and attribution framework which looks at heat flow to achieve multi-scale interpretation of a scalar-valued function Pros: - It is an interesting and novel idea to use the diffusion equation for the attribution problem - The paper is generally well written...
This paper proposes a hyper-network to solve partial differential equations. The strengths of this paper are: $\mathbf{1}.$ The novelty of separating time and space by the hyper-network architecture. $\mathbf{2}.$ This paper is clearly written and well organized, with detailed explanation of theories and experiment...
Recommendation: 3: reject, not good enough
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: This paper proposes a hyper-network to solve partial differential equations. The strengths of this paper are: $\mathbf{1}.$ The novelty of separating time and space by the hyper-network architecture. $\mathbf{2}.$ This paper is clearly written and well organized, with detailed explanation of theories and ex...
This paper investigates how the order of batch normalization (BN) placed in the network affects the performance, when using the unbounded activation functions (e.g., Tanh). It shows that the Swap model (BN after the nonlinearity) using unbounded activation functions has significantly better performance than the convent...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper investigates how the order of batch normalization (BN) placed in the network affects the performance, when using the unbounded activation functions (e.g., Tanh). It shows that the Swap model (BN after the nonlinearity) using unbounded activation functions has significantly better performance than the...
I would like to begin by saying that this paper makes repeated and relentless reference to a given set of papers that induced this reviewer to suspect that it was self reference, and it took barely a minute of google search to verify this fact. I find this very disturbing, since the other papers I have reviewed have by...
Recommendation: 8: accept, good paper
Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces)
Review: I would like to begin by saying that this paper makes repeated and relentless reference to a given set of papers that induced this reviewer to suspect that it was self reference, and it took barely a minute of google search to verify this fact. I find this very disturbing, since the other papers I have reviewed...
Model ensembling is a common technology to further boost performance. While most paper study how to ensemble on supervised models, this paper focus on self-supervised models (SSL). Then, this paper discusses where to ensemble and how to ensemble the models training from SSL, proposing a downstream-efficient ensemble me...
Recommendation: 3: reject, not good enough
Area: Unsupervised and Self-supervised learning
Review: Model ensembling is a common technology to further boost performance. While most paper study how to ensemble on supervised models, this paper focus on self-supervised models (SSL). Then, this paper discusses where to ensemble and how to ensemble the models training from SSL, proposing a downstream-efficient ens...
The paper considers the task of unsupervised pretraining of the reinforcement learning (RL) agents. It analyses and compares different design choices for pretraining and fine-tuning the pretrained components; it shows the improvement of using proposed model-based reinforcement learning over existing model-free techniqu...
Recommendation: 8: accept, good paper
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The paper considers the task of unsupervised pretraining of the reinforcement learning (RL) agents. It analyses and compares different design choices for pretraining and fine-tuning the pretrained components; it shows the improvement of using proposed model-based reinforcement learning over existing model-free ...
The paper presents a soft (continuous) prompt tuning method called MPT. In traditional soft prompt tuning, prompts are often sensitive to initialization when trained from scratch and performance may still lag behind full model fine tuning. In this work, the manuscript presents a method for multitask prompt tuning where...
Recommendation: 8: accept, good paper
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper presents a soft (continuous) prompt tuning method called MPT. In traditional soft prompt tuning, prompts are often sensitive to initialization when trained from scratch and performance may still lag behind full model fine tuning. In this work, the manuscript presents a method for multitask prompt tuni...
The paper concerns itself with continual learning and observes that current methods are making assumptions on the schedule that can be unrealistic. In order to ameliorate this, the notion of \emph{schedule-robustness} is introduced. Intuitively schedule-robustness for CL means that the performance is "independent" of t...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper concerns itself with continual learning and observes that current methods are making assumptions on the schedule that can be unrealistic. In order to ameliorate this, the notion of \emph{schedule-robustness} is introduced. Intuitively schedule-robustness for CL means that the performance is "independe...
This paper studies the model-free linear constrained Markov Decision Process with infinite horizon average rewards. The goal is to learn a policy for selecting actions that minimize the regret (the difference between the maximum achievable average reward and the policy's total average reward) while keeping the total co...
Recommendation: 6: marginally above the acceptance threshold
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: This paper studies the model-free linear constrained Markov Decision Process with infinite horizon average rewards. The goal is to learn a policy for selecting actions that minimize the regret (the difference between the maximum achievable average reward and the policy's total average reward) while keeping the ...
This paper proposes a new architecture that is useful for generalization to new tasks, that may be previous combination of prior tasks. It adapts from existing literature on successor features and GPI, and shows that a modified architecture that predicts useful representations while also learning representations can be...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper proposes a new architecture that is useful for generalization to new tasks, that may be previous combination of prior tasks. It adapts from existing literature on successor features and GPI, and shows that a modified architecture that predicts useful representations while also learning representation...
This paper proposed a method to train a network that can run at different depth at test time. The author claimed that a residual block could be considered to perform two functions (1) learning new features (2) refine features. The refinement stage/layers do not change feature semantics thus can be skipped. The proposed...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper proposed a method to train a network that can run at different depth at test time. The author claimed that a residual block could be considered to perform two functions (1) learning new features (2) refine features. The refinement stage/layers do not change feature semantics thus can be skipped. The ...
The authors propose a LDA-based counterfactual contrastive learning model for robust text classification and counterfactual data augmentation methods. To help readers better understand the motivations of the proposed model, the authors should not only state them by sentences but also with figures. E.g., the authors sta...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: The authors propose a LDA-based counterfactual contrastive learning model for robust text classification and counterfactual data augmentation methods. To help readers better understand the motivations of the proposed model, the authors should not only state them by sentences but also with figures. E.g., the aut...
**Summary:** This paper presents a new Test-time adaptation (TTA) method called DELTA for debiased fully TTA. To be specific, the authors 1) introduce batch renormalization to alleviate the bias in normalization statistics, 2) propose dynamic online re-weighting (DOT) to address the class bias within optimization. **P...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: **Summary:** This paper presents a new Test-time adaptation (TTA) method called DELTA for debiased fully TTA. To be specific, the authors 1) introduce batch renormalization to alleviate the bias in normalization statistics, 2) propose dynamic online re-weighting (DOT) to address the class bias within optimizat...
Keeping the coordinate-invariant property in mind, the author(s) propose the minimum extrinsic curvature principle for manifold regularization and a Minimum Curvature Autoencoder. The main focus is to take an appropriate regularization for the decoder function in the autoencoder, as mentioned in the paper as the deco...
Recommendation: 5: marginally below the acceptance threshold
Area: Generative models
Review: Keeping the coordinate-invariant property in mind, the author(s) propose the minimum extrinsic curvature principle for manifold regularization and a Minimum Curvature Autoencoder. The main focus is to take an appropriate regularization for the decoder function in the autoencoder, as mentioned in the paper as ...
The authors consider the problem of asymptotic stability for discrete-time stochastic systems. They introduce a class of supermartingales, which they call stabilizing ranking martingales (sRSMs), which can be used to prove asymptotic stability and they show how these can be parametrised as neural networks and learned t...
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 authors consider the problem of asymptotic stability for discrete-time stochastic systems. They introduce a class of supermartingales, which they call stabilizing ranking martingales (sRSMs), which can be used to prove asymptotic stability and they show how these can be parametrised as neural networks and l...
This paper provides a theoretical analysis that ER masks can approximate arbitrary target networks if they are wider by a factor of 1/log(1/s), where s denotes the sparsity ratio. The paper prove that ER randomly initialized network contains strong lottery tickets, and also prove the existing of weak lottery tickets th...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper provides a theoretical analysis that ER masks can approximate arbitrary target networks if they are wider by a factor of 1/log(1/s), where s denotes the sparsity ratio. The paper prove that ER randomly initialized network contains strong lottery tickets, and also prove the existing of weak lottery ti...
This paper provides another sufficient condition besides NTK to ensure geometric convergence of deep learning. The paper provides a good litterature review. It is well written and easy to follow. However, it is a dense paper with lots of theoretical proof to check. The ICLR review period is too short to allow a careful...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper provides another sufficient condition besides NTK to ensure geometric convergence of deep learning. The paper provides a good litterature review. It is well written and easy to follow. However, it is a dense paper with lots of theoretical proof to check. The ICLR review period is too short to allow a...
This paper studies the connection between label noise and adversarial risk by given a theorem on the sample size bound for a given adversarial risk with certain noise rate. This theoretical result improves previous work on sample size lower bound. The author also proves that their theorem is tight under a constructed s...
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 connection between label noise and adversarial risk by given a theorem on the sample size bound for a given adversarial risk with certain noise rate. This theoretical result improves previous work on sample size lower bound. The author also proves that their theorem is tight under a const...
This paper proposed a principled method to approximate the gradient of a combinatorial solver, which could be readily integrated into an end-to-end learning pipeline. To achieve this, the authors studied the behavior of linear combinatorial solvers and proposed "Identity" as the surrogate gradient over the coefficients...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: This paper proposed a principled method to approximate the gradient of a combinatorial solver, which could be readily integrated into an end-to-end learning pipeline. To achieve this, the authors studied the behavior of linear combinatorial solvers and proposed "Identity" as the surrogate gradient over the coef...
The paper identifies a key bottleneck in highly heterogeneous federated systems, namely dimensional collapse. The authors propose a simple but novel technique for mitigating dimensional collapse by adding a regularization term during local training. The paper shows both theoretical and empirical analysis to support the...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: The paper identifies a key bottleneck in highly heterogeneous federated systems, namely dimensional collapse. The authors propose a simple but novel technique for mitigating dimensional collapse by adding a regularization term during local training. The paper shows both theoretical and empirical analysis to sup...
This work proposes a novel transformer model for dealing with point set data, with the main focus on achieving linear time complexity in the attention mechanism. By utilizing the idea of random sampling-based approximation to the vanilla attention from sampled Hamiltonian cycle attention, the authors show that the prop...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This work proposes a novel transformer model for dealing with point set data, with the main focus on achieving linear time complexity in the attention mechanism. By utilizing the idea of random sampling-based approximation to the vanilla attention from sampled Hamiltonian cycle attention, the authors show that ...
This paper addresses the problem of group-to-group coordination in multi-agent scenarios, where agents need to coordinate with newly arrived teammates. The proposed CSP approach (1) simulates diverse teams, (2) autoencodes teams' behavior trajectories, and (3) clusters trajectory representations into groups, each of wh...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper addresses the problem of group-to-group coordination in multi-agent scenarios, where agents need to coordinate with newly arrived teammates. The proposed CSP approach (1) simulates diverse teams, (2) autoencodes teams' behavior trajectories, and (3) clusters trajectory representations into groups, ea...
This paper starts with two questions that try to answer what and how to apply CLIP to video-text tasks. They build a model based on the observations and propose new cross-modal learning methods for video-text retrieval. Their method was tested and showed promising results on those datasets. Adapting the image-caption p...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper starts with two questions that try to answer what and how to apply CLIP to video-text tasks. They build a model based on the observations and propose new cross-modal learning methods for video-text retrieval. Their method was tested and showed promising results on those datasets. Adapting the image-c...
This work proposed **consolidator** to efficiently fine-tune transformers. Consolidator has multi-branches structures, which can be merged into a single matrix and saved on the disk. Extensive experiments demonstrate the efficiency and effectiveness of consolidator on various vision tasks. #### Strength 1. The design ...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This work proposed **consolidator** to efficiently fine-tune transformers. Consolidator has multi-branches structures, which can be merged into a single matrix and saved on the disk. Extensive experiments demonstrate the efficiency and effectiveness of consolidator on various vision tasks. #### Strength 1. The...
The authors proposed to solve the problem of formalizing and quantifying the discriminating ability of filters through the total variation (TV) distance between the class-conditional distributions of the filter outputs. +The setting of pruning without finetuning is kind of attractive. -The calculation of MinTVS requir...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: The authors proposed to solve the problem of formalizing and quantifying the discriminating ability of filters through the total variation (TV) distance between the class-conditional distributions of the filter outputs. +The setting of pruning without finetuning is kind of attractive. -The calculation of MinTV...
This work presents a new robust training approach by pushing the nearby soft boundaries away for points that are closer to the boundaries. The motivation of the paper is an observation that some points are not pushed away from the boundary in the existing PGD training; therefore, it is straightforward to design an algo...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: This work presents a new robust training approach by pushing the nearby soft boundaries away for points that are closer to the boundaries. The motivation of the paper is an observation that some points are not pushed away from the boundary in the existing PGD training; therefore, it is straightforward to design...
This paper proposes some metrics to evaluate counterfactual generation models, based on Galles and Pearl's axiomatization of counterfactuals that are interpreted according to (a certain class of) structural causal models. Corresponding to each of the three axioms -- effectiveness, composition, and reversibility -- a me...
Recommendation: 6: marginally above the acceptance threshold
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: This paper proposes some metrics to evaluate counterfactual generation models, based on Galles and Pearl's axiomatization of counterfactuals that are interpreted according to (a certain class of) structural causal models. Corresponding to each of the three axioms -- effectiveness, composition, and reversibility...
This paper studies the over-smoothing problem in GNN, which means the node representations tend to become indistinguishable as the number of layers increases. The key contributions of these papers are two-folded. First, they do a benchmarking to evaluate and analyze several methods. Second, motivated by deeply supervis...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper studies the over-smoothing problem in GNN, which means the node representations tend to become indistinguishable as the number of layers increases. The key contributions of these papers are two-folded. First, they do a benchmarking to evaluate and analyze several methods. Second, motivated by deeply ...
This paper studies contrastive learning (CL) by looking the dynamics of (unconstrained) gradient descent for the contrastive loss and connecting it to message passing schemes on the augmentation graph. - The "alignment update" for CL is a message passing scheme on the augmentation graph, because each feature is update...
Recommendation: 6: marginally above the acceptance threshold
Area: Unsupervised and Self-supervised learning
Review: This paper studies contrastive learning (CL) by looking the dynamics of (unconstrained) gradient descent for the contrastive loss and connecting it to message passing schemes on the augmentation graph. - The "alignment update" for CL is a message passing scheme on the augmentation graph, because each feature i...
To avoid the unrealistic assumption of factor independence in traditional disentangled representation learning, this paper proposes to relax this assumption to factorized support, and proposes a Hausdorff-distance-based regularization. The authors conduct experiments on 3 classical datasets to show the improved disenta...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: To avoid the unrealistic assumption of factor independence in traditional disentangled representation learning, this paper proposes to relax this assumption to factorized support, and proposes a Hausdorff-distance-based regularization. The authors conduct experiments on 3 classical datasets to show the improved...
The authors study whether automatically-induced prompts that effectively extract information from a language model can also be used, out-of-the-box, to probe other language models for the same information. After confirming that discrete prompts induced with the AutoPrompt algorithm outperform manual and semi-manual pro...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The authors study whether automatically-induced prompts that effectively extract information from a language model can also be used, out-of-the-box, to probe other language models for the same information. After confirming that discrete prompts induced with the AutoPrompt algorithm outperform manual and semi-ma...
This paper presents the SchemaNet, an inference paradigm based on the cognitive concept of schema for inducing explainability of trained image classification Vision Transformers. It first builds a codebook of by k-mean clustering running on the collection of visual tokens extracted from a probe dataset. With the codeb...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper presents the SchemaNet, an inference paradigm based on the cognitive concept of schema for inducing explainability of trained image classification Vision Transformers. It first builds a codebook of by k-mean clustering running on the collection of visual tokens extracted from a probe dataset. With t...
The authors propose to combine the existing neural network's loss with an isometry-preserving loss, which they argue would allow for preserving the geometry, which the authors complement with some theoretical results. The two main experiments aim to show that the resulting model is more robust to adversarial attacks ...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: The authors propose to combine the existing neural network's loss with an isometry-preserving loss, which they argue would allow for preserving the geometry, which the authors complement with some theoretical results. The two main experiments aim to show that the resulting model is more robust to adversarial ...
This paper presents CCIL, a novel behavior cloning approach that learns a driving policy from human demonstrations. It adopts an ego-centric scene representation with a transformer-based architecture. The network predicts a sequence of future ego SDV states, which are converted to control actuations by a LQR. CCIL is e...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper presents CCIL, a novel behavior cloning approach that learns a driving policy from human demonstrations. It adopts an ego-centric scene representation with a transformer-based architecture. The network predicts a sequence of future ego SDV states, which are converted to control actuations by a LQR. C...
Recently, it has been empirically observed that overparameterization helps to improve performance on both the majority and minority subgroups of the data. Few works have also proposed methods to improve the performance on minority subgroups like group distributionally robust optimization and data subsampling. This pape...
Recommendation: 3: reject, not good enough
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: Recently, it has been empirically observed that overparameterization helps to improve performance on both the majority and minority subgroups of the data. Few works have also proposed methods to improve the performance on minority subgroups like group distributionally robust optimization and data subsampling. T...
This paper learns smooth functions (as measured by the Lipschitz constant) on Riemannian manifolds embedded in Euclidean space. Notably, these methods assume the manifold is unknown, presenting a significant technical challenge. The paper then develops several optimization problems and shows to make these tractable thr...
Recommendation: 6: marginally above the acceptance threshold
Area: Optimization (eg, convex and non-convex optimization)
Review: This paper learns smooth functions (as measured by the Lipschitz constant) on Riemannian manifolds embedded in Euclidean space. Notably, these methods assume the manifold is unknown, presenting a significant technical challenge. The paper then develops several optimization problems and shows to make these tract...
The paper proposes a synthetic task, LEGO, and uses it to understand how Transformers operate. The task is in following a chain of simple reasoning, in particular for simple mathematical operations with variables valued either +1 or -1 and expressions of the kind a=+b or a=-b. With this task, the authors consider BERT’...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: The paper proposes a synthetic task, LEGO, and uses it to understand how Transformers operate. The task is in following a chain of simple reasoning, in particular for simple mathematical operations with variables valued either +1 or -1 and expressions of the kind a=+b or a=-b. With this task, the authors consid...
This paper is about semantic image segmentation. The authors notices that there are some categories have less pixels than other categories, and propose to divide all the categories into different groups according to number of pixels and proposes to use mixture models to different group of categories. Experiments on Cit...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper is about semantic image segmentation. The authors notices that there are some categories have less pixels than other categories, and propose to divide all the categories into different groups according to number of pixels and proposes to use mixture models to different group of categories. Experiment...
In this work, the authors proposed a teacher-student framework (TSF), where a teacher agent or human expert guards the training of a student agent by intervening and providing online demonstrations that the teacher policy may not be optimal. This is a more realistic setting than standard TSF in which the teacher policy...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: In this work, the authors proposed a teacher-student framework (TSF), where a teacher agent or human expert guards the training of a student agent by intervening and providing online demonstrations that the teacher policy may not be optimal. This is a more realistic setting than standard TSF in which the teache...
This paper focuses on various types of speech distortions (a total of 55) and aims to realize universal speech enhancement based on score-diffusion-based models. The paper carefully describes their complicated architecture based on the various attempts motivated by related studies and incrementally improves the archite...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper focuses on various types of speech distortions (a total of 55) and aims to realize universal speech enhancement based on score-diffusion-based models. The paper carefully describes their complicated architecture based on the various attempts motivated by related studies and incrementally improves the...
The paper proposes an active learning approach to select annotated examples for in-context learning in large PLMs. The proposed method is made up of three components: (1) nearest neighbors: diverse examples are selected from a graph constructed with nearest neighbors; (2) pre-trained language model: more examples are s...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper proposes an active learning approach to select annotated examples for in-context learning in large PLMs. The proposed method is made up of three components: (1) nearest neighbors: diverse examples are selected from a graph constructed with nearest neighbors; (2) pre-trained language model: more exampl...
This paper considers estimating the parameters of an exponential family using the NCE loss. The NCE loss is a particularly popular method because it avoids computing the partition function of the exponential family which is required by other methods such as maximum likelihood. A popular choice for the noise distribut...
Recommendation: 6: marginally above the acceptance threshold
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: This paper considers estimating the parameters of an exponential family using the NCE loss. The NCE loss is a particularly popular method because it avoids computing the partition function of the exponential family which is required by other methods such as maximum likelihood. A popular choice for the noise d...
The paper proposes a model for language modeling. The proposed method models the probability of a certain word sequence as the inner product between a feature vector which is a tensor product of feature vectors for each word, and a learnable weight tensor which is in tensor train (TT) format. The paper claims to show t...
Recommendation: 1: strong reject
Area: Deep Learning and representational learning
Review: The paper proposes a model for language modeling. The proposed method models the probability of a certain word sequence as the inner product between a feature vector which is a tensor product of feature vectors for each word, and a learnable weight tensor which is in tensor train (TT) format. The paper claims t...
This work propose a new time series augmentation technique, called Recursive Interpolation Method (RIM), to learn accurate models with limited data. They provide theoretical analysis with the guaranteeing faster convergence with reduced variance. Empirically, they show that the proposed method improves the performance ...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This work propose a new time series augmentation technique, called Recursive Interpolation Method (RIM), to learn accurate models with limited data. They provide theoretical analysis with the guaranteeing faster convergence with reduced variance. Empirically, they show that the proposed method improves the perf...
This paper aims to solve Semi-Markov decision processes (SMDP) by reformulating the SMDP into an ordinary MDP. In particular, the authors propose a novel MDP view of SMDP that models the options as part of the states and actions, leading to the definition of several option-value functions. The authors propose to utiliz...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper aims to solve Semi-Markov decision processes (SMDP) by reformulating the SMDP into an ordinary MDP. In particular, the authors propose a novel MDP view of SMDP that models the options as part of the states and actions, leading to the definition of several option-value functions. The authors propose t...
This paper presents a Push-and-Pull Learning (PPL) semantic segmentation, which focuses on the interaction between features and prototypes (similar to classifier weights). The proposed PPL consists of a contrast-based pushing module to pull close/push away features according to the contrastive loss between features and...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper presents a Push-and-Pull Learning (PPL) semantic segmentation, which focuses on the interaction between features and prototypes (similar to classifier weights). The proposed PPL consists of a contrast-based pushing module to pull close/push away features according to the contrastive loss between feat...
This paper models the fMRI activity of multiple brain regions simultaneously, with sparse communication between them. This paper seems like a reasonable extension of the popular neural modeling approaches (ex. LFADS) to fMRI and multiple brain regions. I have some reservations: 1. I am not confident on the identifia...
Recommendation: 5: marginally below the acceptance threshold
Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces)
Review: This paper models the fMRI activity of multiple brain regions simultaneously, with sparse communication between them. This paper seems like a reasonable extension of the popular neural modeling approaches (ex. LFADS) to fMRI and multiple brain regions. I have some reservations: 1. I am not confident on the i...
This work proposes an adversarial training method for self-supervised MDE models based on view synthesis without using ground-truth depth. It uses L0-norm-bounded perturbation in training to improve adversarial robustness against physical-world attacks. The experiments demonstrate the proposed methods can maintain simi...
Recommendation: 8: accept, good paper
Area: Unsupervised and Self-supervised learning
Review: This work proposes an adversarial training method for self-supervised MDE models based on view synthesis without using ground-truth depth. It uses L0-norm-bounded perturbation in training to improve adversarial robustness against physical-world attacks. The experiments demonstrate the proposed methods can maint...
The authors proposed a meta-algorithm to achieve robustness against backdoor attacks by combining existing noisy label algorithms and adversarial training. They also showed that their method is capable of reaching high robustness through experiments. S1: The proposed two-stage learning is intuitive and effective. S2: T...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: The authors proposed a meta-algorithm to achieve robustness against backdoor attacks by combining existing noisy label algorithms and adversarial training. They also showed that their method is capable of reaching high robustness through experiments. S1: The proposed two-stage learning is intuitive and effectiv...
This paper presents a benchmark for binary neural networks. The perspectives of the proposed benchmark include BNN methods, architectures, multiple tasks, and inference tests on various hardware. The authors summarize some insights and offer practical guidance. Although I very much agree with the motivation of this wor...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper presents a benchmark for binary neural networks. The perspectives of the proposed benchmark include BNN methods, architectures, multiple tasks, and inference tests on various hardware. The authors summarize some insights and offer practical guidance. Although I very much agree with the motivation of ...
The paper presents a geometry-free method for novel view synthesis of objects utilizing probabilistic diffusion. Main contributions are a novel scheme for stochastic sampling of conditioning examples, a refined U-Net architecture for denoising, and a new metric for evaluating 3d consistency of novel view synthesis appr...
Recommendation: 8: accept, good paper
Area: Generative models
Review: The paper presents a geometry-free method for novel view synthesis of objects utilizing probabilistic diffusion. Main contributions are a novel scheme for stochastic sampling of conditioning examples, a refined U-Net architecture for denoising, and a new metric for evaluating 3d consistency of novel view synthe...
The paper proposed LS4 a sequential latent state space model with the latent state evolving according to a discretized approximation of ODE. The structure of the latent state dynamics induces an efficient convolutional implementation. The model is trained in a VAE framework. Experiment results on challenge datasets inc...
Recommendation: 5: marginally below the acceptance threshold
Area: Generative models
Review: The paper proposed LS4 a sequential latent state space model with the latent state evolving according to a discretized approximation of ODE. The structure of the latent state dynamics induces an efficient convolutional implementation. The model is trained in a VAE framework. Experiment results on challenge data...
This work introduces generating vectorized sketch by modeling the stroke-point locations and pen states via a diffusion model. One major contribution is to embed recognizability of sketch during the sampling. It explores both cases of starting from a random scattered points or an incomplete sketch. Experiments show som...
Recommendation: 8: accept, good paper
Area: Generative models
Review: This work introduces generating vectorized sketch by modeling the stroke-point locations and pen states via a diffusion model. One major contribution is to embed recognizability of sketch during the sampling. It explores both cases of starting from a random scattered points or an incomplete sketch. Experiments ...
The paper proposes a comprehensive spatiotemporal graph model to predict air pollution concentration in the future time. The model integrates the advantages of mechanical model and machine learning. The authors compare the model with various SOTAs and the proposed method provides an impressive applicability with compet...
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 comprehensive spatiotemporal graph model to predict air pollution concentration in the future time. The model integrates the advantages of mechanical model and machine learning. The authors compare the model with various SOTAs and the proposed method provides an impressive applicability wit...
In this work, the authors propose a method to increase the accuracy of classification in the task Domain Adaptation of Black-box Predictors. It aims to suppress the confirmation bias efficiently, and extends this work with a learning framework called BETA. Specifically, inspired by the phenomena that deep models tend t...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: In this work, the authors propose a method to increase the accuracy of classification in the task Domain Adaptation of Black-box Predictors. It aims to suppress the confirmation bias efficiently, and extends this work with a learning framework called BETA. Specifically, inspired by the phenomena that deep model...
The paper introduces algorithms for sampling constrained distributions. The authors introduce an algorithm MIED that transform this sampling problem into an optimization problem, and practically, to optimize the mollified interaction energy in a first-order particle-based solution. They also proved that by minimizing t...
Recommendation: 8: accept, good paper
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: The paper introduces algorithms for sampling constrained distributions. The authors introduce an algorithm MIED that transform this sampling problem into an optimization problem, and practically, to optimize the mollified interaction energy in a first-order particle-based solution. They also proved that by mini...
This work presents H-VAE, an end-to-end SO(3)-equivariant VAE. The input is a radial signal in $R^3$ called $\rho(r,\theta,\phi)$ which is mapped via the Zernike Fourier Transform to a set of coefficients of Zernicke polynomials which are products of spherical harmonics and radial basis functions. The SO(3)-equivaria...
Recommendation: 5: marginally below the acceptance threshold
Area: Unsupervised and Self-supervised learning
Review: This work presents H-VAE, an end-to-end SO(3)-equivariant VAE. The input is a radial signal in $R^3$ called $\rho(r,\theta,\phi)$ which is mapped via the Zernike Fourier Transform to a set of coefficients of Zernicke polynomials which are products of spherical harmonics and radial basis functions. The SO(3)-e...
The paper proposed a reasoning framework, ThinkSum, which includes a fast think module and a slow sum module. The authors argued that this framework is good at performing many reasoning tasks with simple operations. The performance of the proposed model is strong in their experiments. However, I am not sure if the impr...
Recommendation: 3: reject, not good enough
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper proposed a reasoning framework, ThinkSum, which includes a fast think module and a slow sum module. The authors argued that this framework is good at performing many reasoning tasks with simple operations. The performance of the proposed model is strong in their experiments. However, I am not sure if ...
Weight sharing is one of the effective way to compress the model. This paper propose a new hash method to lower the memory usage for neural network models. Compare with the previous hash method, which use the local memory sharing, this paper propose a new idea call global memory sharing, which is aimed to lower the mem...
Recommendation: 5: marginally below the acceptance threshold
Area: General Machine Learning
Review: Weight sharing is one of the effective way to compress the model. This paper propose a new hash method to lower the memory usage for neural network models. Compare with the previous hash method, which use the local memory sharing, this paper propose a new idea call global memory sharing, which is aimed to lower...
The paper proposes a test-time sampling based domain generalization approach based on a discriminative energy-based model formulation. The model performs modification of test-time inputs by sampling towards the source data distribution via Langevin dynamics, while simultaneously preserving label information (by augment...
Recommendation: 6: marginally above the acceptance threshold
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: The paper proposes a test-time sampling based domain generalization approach based on a discriminative energy-based model formulation. The model performs modification of test-time inputs by sampling towards the source data distribution via Langevin dynamics, while simultaneously preserving label information (by...
This paper proposes a bi-level dynamic parameter sharing mechanism (BDPS) to achieve better coordination among agents in cooperative multi-agent tasks. The key idea is rather than blindly sharing parameters among all agents, they share parameters among agents based on their roles and groups. At the agent level, they d...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper proposes a bi-level dynamic parameter sharing mechanism (BDPS) to achieve better coordination among agents in cooperative multi-agent tasks. The key idea is rather than blindly sharing parameters among all agents, they share parameters among agents based on their roles and groups. At the agent level...
The paper focuses on the problem of improving neural ODEs for learning from long trajectories. It shows that the loss landscape of latent neural ODEs is adversely affected by the length of the time interval and complexity of loss can grow dramatically with increase in the length of the trajectory. The paper proposes b...
Recommendation: 6: marginally above the acceptance threshold
Area: Generative models
Review: The paper focuses on the problem of improving neural ODEs for learning from long trajectories. It shows that the loss landscape of latent neural ODEs is adversely affected by the length of the time interval and complexity of loss can grow dramatically with increase in the length of the trajectory. The paper pr...
The paper proposes a Logical Message Passing Neural Network (LMPNN), which relies on pre-trained knowledge graph embeddings and MLP-based local one-hop inference to perform the Complex Query Answering (i.e., EFO-1) task. Compared to the prior work CQD [1], which formalizes the KG reasoning as an optimization problem, t...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper proposes a Logical Message Passing Neural Network (LMPNN), which relies on pre-trained knowledge graph embeddings and MLP-based local one-hop inference to perform the Complex Query Answering (i.e., EFO-1) task. Compared to the prior work CQD [1], which formalizes the KG reasoning as an optimization pr...
The paper presents a method to recover a scene's geometry and physical parameters from a collection of images. It combines a neural radiance field method with a differentiable physics engine to jointly recover a deforming object's geometry, color, and physical parameters using continuum mechanics modeling. The NERF m...
Recommendation: 8: accept, good paper
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: The paper presents a method to recover a scene's geometry and physical parameters from a collection of images. It combines a neural radiance field method with a differentiable physics engine to jointly recover a deforming object's geometry, color, and physical parameters using continuum mechanics modeling. Th...
This work introduces the Sequential Attention algorithm for supervised feature selection. This algorithm is based on an efficient implementation of greedy forward selection and uses attention weights at each step as a proxy for marginal feature importance. The authors provide theoretical insights into the Sequential A...
Recommendation: 6: marginally above the acceptance threshold
Area: General Machine Learning
Review: This work introduces the Sequential Attention algorithm for supervised feature selection. This algorithm is based on an efficient implementation of greedy forward selection and uses attention weights at each step as a proxy for marginal feature importance. The authors provide theoretical insights into the Sequ...
This paper proposes test time training for the task of learning adversarially robust models. The idea is to finetune the model for the test samples using a combination of self-supervised loss on the test samples and a memory-based loss on a small subset of training samples. Since the original adversarially trained mode...
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 test time training for the task of learning adversarially robust models. The idea is to finetune the model for the test samples using a combination of self-supervised loss on the test samples and a memory-based loss on a small subset of training samples. Since the original adversarially trai...
This paper proposes a method to reduce the sample variance for training score-matching models. The method is based on using multiple reference samples and weighted importance sampling to compute more stable targets. Small-scale experiments show improvement when using the proposed scheme. **Strengths** - I found the pa...
Recommendation: 5: marginally below the acceptance threshold
Area: Generative models
Review: This paper proposes a method to reduce the sample variance for training score-matching models. The method is based on using multiple reference samples and weighted importance sampling to compute more stable targets. Small-scale experiments show improvement when using the proposed scheme. **Strengths** - I foun...
The paper studies a class of problems known as the Bank Loan Problem (BLP), where the learner only observes whether a customer will repay a loan if the loan is accepted. The labeled training data in this problem is biased since it is affected by previous decisions. The authors propose adversarial optimism (AdOpt) to ad...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper studies a class of problems known as the Bank Loan Problem (BLP), where the learner only observes whether a customer will repay a loan if the loan is accepted. The labeled training data in this problem is biased since it is affected by previous decisions. The authors propose adversarial optimism (AdOp...
This paper studies the benefit/role of learning representations with contrastive learning for out-of-distribution (OOD) generalization. It argues that one way contrastive learning could help with covariate shift is through the diversity in the augmentation distribution, even if the input distributions shift a lot. This...
Recommendation: 6: marginally above the acceptance threshold
Area: Unsupervised and Self-supervised learning
Review: This paper studies the benefit/role of learning representations with contrastive learning for out-of-distribution (OOD) generalization. It argues that one way contrastive learning could help with covariate shift is through the diversity in the augmentation distribution, even if the input distributions shift a l...
This paper proposes a new framework for data augmentation that generalizes other existing data augmentation methods by incorporating Bayesian inference methods. Empirical performances on common benchmark datasets suggest that the LatentAugment methods outperforms other Adversarial benchmarks not only as measured by tes...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper proposes a new framework for data augmentation that generalizes other existing data augmentation methods by incorporating Bayesian inference methods. Empirical performances on common benchmark datasets suggest that the LatentAugment methods outperforms other Adversarial benchmarks not only as measure...
The authors consider the problem of improving the training efficiency of neural networks by pruning them at initialization. Unlike prior literature work, which often considers weight-dependent metrics to find "dead units" and remove them, the authors provide a spectrum-aware metric for identifying removable units. In p...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The authors consider the problem of improving the training efficiency of neural networks by pruning them at initialization. Unlike prior literature work, which often considers weight-dependent metrics to find "dead units" and remove them, the authors provide a spectrum-aware metric for identifying removable uni...
By analyzing the effect of time-varying aggregation weights in FL, the authors obtain a tradeoff between the convergence rate and the convergence error, where FedAvg favors the latter. Further, setting the aggregation weights proportional to the change in local loss after the local steps, the authors obtain a new aggre...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: By analyzing the effect of time-varying aggregation weights in FL, the authors obtain a tradeoff between the convergence rate and the convergence error, where FedAvg favors the latter. Further, setting the aggregation weights proportional to the change in local loss after the local steps, the authors obtain a n...
This paper introduces a framework for computing importance weights for labeled source data with respect to a target domain where only unlabeled target data is available. Unlike previous methods, these weights allow for concept drift in addition to covariate shift. The paper proves the statistical consistency of the est...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper introduces a framework for computing importance weights for labeled source data with respect to a target domain where only unlabeled target data is available. Unlike previous methods, these weights allow for concept drift in addition to covariate shift. The paper proves the statistical consistency of...