review stringlengths 5 16.6k | score stringclasses 5
values | area stringclasses 12
values | text stringlengths 31 5.65k |
|---|---|---|---|
This is a theoretical work on the analysis of the generalization error in federated learning with heterogeneity of the losses and partial participation of the clients in the training process. The authors address the question: "Would the unparticipating clients benefit from the model trained by participating clients?". ... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This is a theoretical work on the analysis of the generalization error in federated learning with heterogeneity of the losses and partial participation of the clients in the training process. The authors address the question: "Would the unparticipating clients benefit from the model trained by participating cli... |
This paper proposed a strategy to make the temperature learnable.
Strength:
This paper proposed a simple strategy to make the temperature learnable. The proposed method simply changes two lines of the training codes to improve the performance.
Weakness:
1. This paper is badly written and hard to follow.
2. The key id... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This paper proposed a strategy to make the temperature learnable.
Strength:
This paper proposed a simple strategy to make the temperature learnable. The proposed method simply changes two lines of the training codes to improve the performance.
Weakness:
1. This paper is badly written and hard to follow.
2. Th... |
This paper presents a novel network architecture called Substructure-Atom Cross Attention (SACA) for molecular graphs that effectively combines Transformers and GNNs. Substructural patterns are important in molecular tasks, as we see in traditional chemoinformatics fingerprints like ECFP and fragmentation like BRICS/RE... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper presents a novel network architecture called Substructure-Atom Cross Attention (SACA) for molecular graphs that effectively combines Transformers and GNNs. Substructural patterns are important in molecular tasks, as we see in traditional chemoinformatics fingerprints like ECFP and fragmentation like ... |
This work introduces robust Universal Adversarial Perturbations (UAPs). The objective of robust UAPs is to increase the resilience of UAPs against image transformations. Robust UAPs are obtained by incorporating transformation functions into the UAP generation process. Evaluation on CIFAR10 and ImageNet demonstrate the... | Recommendation: 3: reject, not good enough | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This work introduces robust Universal Adversarial Perturbations (UAPs). The objective of robust UAPs is to increase the resilience of UAPs against image transformations. Robust UAPs are obtained by incorporating transformation functions into the UAP generation process. Evaluation on CIFAR10 and ImageNet demonst... |
1. This paper proposed a two-stage method that reasons over sets of objects or statements.
2. The paper performs empirical evaluation on the BIG-bench benchmark and shows improvements over fewshot GPT3
Strengths:
1) Experimental results suggest the proposed method has an improvement over few-shot GPT.
Weaknesses:
1) T... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
1. This paper proposed a two-stage method that reasons over sets of objects or statements.
2. The paper performs empirical evaluation on the BIG-bench benchmark and shows improvements over fewshot GPT3
Strengths:
1) Experimental results suggest the proposed method has an improvement over few-shot GPT.
Weakness... |
This work focus on adaptive frameworks for bilevel optimization. It first introduce BiAdam that achieves $\tilde{O}(\epsilon^{-4})$ complexity. Then it introduces BiAdam with variance reduction and achieves $\tilde{O}(\epsilon^{-3})$ complexity. Both results matches state-of-the-art complexities.
strengths:
a) Th... | Recommendation: 3: reject, not good enough | Area: Optimization (eg, convex and non-convex optimization) | Review:
This work focus on adaptive frameworks for bilevel optimization. It first introduce BiAdam that achieves $\tilde{O}(\epsilon^{-4})$ complexity. Then it introduces BiAdam with variance reduction and achieves $\tilde{O}(\epsilon^{-3})$ complexity. Both results matches state-of-the-art complexities.
strengths: ... |
This work introduces a diffusion based approach for unconditional generation of realistic protein structures. It is claimed that the generated structures are similar to naturally-occuring proteins in complexity and structural patterns.
[+] The representation of the protein backbone as a sequence of angles should be a ... | Recommendation: 5: marginally below the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This work introduces a diffusion based approach for unconditional generation of realistic protein structures. It is claimed that the generated structures are similar to naturally-occuring proteins in complexity and structural patterns.
[+] The representation of the protein backbone as a sequence of angles shou... |
This paper considers the problem of correlation testing in the federated framework compatible with secure aggregation. They motivate the problem of correlation testing with several applications and also give a relevant hospitals based example for the federated setting. They propose an algorithm with two simple observat... | 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 considers the problem of correlation testing in the federated framework compatible with secure aggregation. They motivate the problem of correlation testing with several applications and also give a relevant hospitals based example for the federated setting. They propose an algorithm with two simple ... |
This paper addresses the SSDA problem from the perspective of causality learning. It involves two step for learning, one using GAN and data augmentation to generate intermediate data and second using two semi-supervised learner to do cross-supervision for the aim of debiasing. The effectiveness of the proposed method i... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This paper addresses the SSDA problem from the perspective of causality learning. It involves two step for learning, one using GAN and data augmentation to generate intermediate data and second using two semi-supervised learner to do cross-supervision for the aim of debiasing. The effectiveness of the proposed ... |
This paper proposes to regularize neural networks using isometric properties. The paper presents some intriguing ideas along with some preliminary results that would be worth exploring further.
Strength: The idea is relatively straightforward and intuitive. Some preliminary experimental results are provided.
Weakness... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This paper proposes to regularize neural networks using isometric properties. The paper presents some intriguing ideas along with some preliminary results that would be worth exploring further.
Strength: The idea is relatively straightforward and intuitive. Some preliminary experimental results are provided.
... |
This paper propose an approach to address the problem of imperfect reward under offline settings.
The main idea is to formulate the problem as a bi-level optimization problem, where the upper problem is to minimize the gap between the stationary distribution of the optimal policy defined by the imperfect reward, and ... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper propose an approach to address the problem of imperfect reward under offline settings.
The main idea is to formulate the problem as a bi-level optimization problem, where the upper problem is to minimize the gap between the stationary distribution of the optimal policy defined by the imperfect rewa... |
The paper proposes ZONE, a computational framework of curriculum task generation for reinforcement learning based on a concept from developmental psychology, i.e., zone of proximal development (ZPD). The target of the framework is to measure and schedule difficulty and progression of a student model. The approach is co... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper proposes ZONE, a computational framework of curriculum task generation for reinforcement learning based on a concept from developmental psychology, i.e., zone of proximal development (ZPD). The target of the framework is to measure and schedule difficulty and progression of a student model. The approa... |
This paper incorporates the resisual algorithm (RA) with SAC-N used in offline RL setting, and finds that the additional RA objective can not only improve the SOTA performance, but also reduce the number of ensemble functions for a more efficient computation.
Strength
1. The paper empirically shows that adding RA to SA... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper incorporates the resisual algorithm (RA) with SAC-N used in offline RL setting, and finds that the additional RA objective can not only improve the SOTA performance, but also reduce the number of ensemble functions for a more efficient computation.
Strength
1. The paper empirically shows that adding ... |
The authors present a self-training approach for detecting novel objects in an open-world setting using off-the-shelf monocular depth and normal estimators. The presented method improves over prior work on open-world settings on COCO and ADE20K.
Strengths:
- Intuitive, novel method that outperforms prior work on impo... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The authors present a self-training approach for detecting novel objects in an open-world setting using off-the-shelf monocular depth and normal estimators. The presented method improves over prior work on open-world settings on COCO and ADE20K.
Strengths:
- Intuitive, novel method that outperforms prior work... |
The authors investigate an important and open question: how does the the learning rule (gradient descent, Feedback alignment, Direct Feedback Alignment, error-modulated Hebbian learning, Gated linear networks) influence the learning dynamics during neural network training. The authors focus on wide neural networks, and... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The authors investigate an important and open question: how does the the learning rule (gradient descent, Feedback alignment, Direct Feedback Alignment, error-modulated Hebbian learning, Gated linear networks) influence the learning dynamics during neural network training. The authors focus on wide neural netwo... |
The paper proposes an interesting approach to predicting freezing layers during training by training a meta-predictor. The attention based meta-predictor takes in weight history and predicts if a layer should be frozen or not. The predictor is also pretrained on a dataset generated using the CKA similarities between a ... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The paper proposes an interesting approach to predicting freezing layers during training by training a meta-predictor. The attention based meta-predictor takes in weight history and predicts if a layer should be frozen or not. The predictor is also pretrained on a dataset generated using the CKA similarities be... |
The paper empirically investigates whether pretrained large language models can have abstraction capability -- whether the model can be aware of the grammar instead of memorizing surface word patterns, taking from a transferability perspective between tasks of different characteristics. The paper also reports the effe... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The paper empirically investigates whether pretrained large language models can have abstraction capability -- whether the model can be aware of the grammar instead of memorizing surface word patterns, taking from a transferability perspective between tasks of different characteristics. The paper also reports ... |
This paper proposes a framework unifying multiple approaches for out-of-distribution generalization, namely, (i) data-augmentation, (ii) enforcing distributional invariances and (iii) invariant risk minimization. The framework is centered around the assumption that both the training and testing domains are "Causally In... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes a framework unifying multiple approaches for out-of-distribution generalization, namely, (i) data-augmentation, (ii) enforcing distributional invariances and (iii) invariant risk minimization. The framework is centered around the assumption that both the training and testing domains are "Cau... |
This paper considers different spiking neuron models and explores hyperparameters on multiple tasks in order to facilitate efficient training via the surrogate gradient method. The study focuses primarily on the shape of the surrogate gradient function. They find that low dampening, high sharpness and low tail-flatness... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper considers different spiking neuron models and explores hyperparameters on multiple tasks in order to facilitate efficient training via the surrogate gradient method. The study focuses primarily on the shape of the surrogate gradient function. They find that low dampening, high sharpness and low tail-... |
Authors propose Action Adaptive Policy (AAP) to adapt to unseen effects of actions during inference of an embodied AI navigation task. Experiments show that AAP is effective at adapting to unseen action outcomes at test time, outperforming a set of strong baselines by a significant margin, and works with disabled actio... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
Authors propose Action Adaptive Policy (AAP) to adapt to unseen effects of actions during inference of an embodied AI navigation task. Experiments show that AAP is effective at adapting to unseen action outcomes at test time, outperforming a set of strong baselines by a significant margin, and works with disabl... |
The paper uses a hierarchical attention based neural networ to learn the solution operator associated to multiscale PDEs. In addition, the second contribution is the sobolev type norm used as the loss function, giving more weight to the higher frequencies of the target.
I have mixed feelings about this paper. I have a... | Recommendation: 5: marginally below the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
The paper uses a hierarchical attention based neural networ to learn the solution operator associated to multiscale PDEs. In addition, the second contribution is the sobolev type norm used as the loss function, giving more weight to the higher frequencies of the target.
I have mixed feelings about this paper. ... |
The authors propose to initialize ResNets with ReLU activations with exact dynamical isometry by combining ideas from delta-orthogonal initialization and looks-linear initialization. The proposed initialization scheme guarantees that every residual block is an exact orthogonal map. A small empirical evaluation shows th... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The authors propose to initialize ResNets with ReLU activations with exact dynamical isometry by combining ideas from delta-orthogonal initialization and looks-linear initialization. The proposed initialization scheme guarantees that every residual block is an exact orthogonal map. A small empirical evaluation ... |
This work solves a problem of sample-efficient experimental design with teaming of a human expert and AI. Since an AI starts to solve the experimental design from scratch, a human expert can help the AI to accelerate the design process. To fully utilize such knowledge from human experts and AI system, the authors pro... | Recommendation: 5: marginally below the acceptance threshold | Area: Optimization (eg, convex and non-convex optimization) | Review:
This work solves a problem of sample-efficient experimental design with teaming of a human expert and AI. Since an AI starts to solve the experimental design from scratch, a human expert can help the AI to accelerate the design process. To fully utilize such knowledge from human experts and AI system, the aut... |
This paper suggested that colored noise for motor exploration in RL, in particular Pink noise ($\beta$ = 1) is a better choice than using Gaussian white noise and OU noise in many control tasks. The method is simple and versatile for online RL, and effective on the being tested environments. The main contribution is th... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper suggested that colored noise for motor exploration in RL, in particular Pink noise ($\beta$ = 1) is a better choice than using Gaussian white noise and OU noise in many control tasks. The method is simple and versatile for online RL, and effective on the being tested environments. The main contributi... |
This paper evaluates the impact of using language and vision pretrained transformers as an initialization for a Decision Transformer style model used in offline RL settings. It provide methods for improving the transferability of the pretrained models and demonstrate that pretraining consistently matches or outperform... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper evaluates the impact of using language and vision pretrained transformers as an initialization for a Decision Transformer style model used in offline RL settings. It provide methods for improving the transferability of the pretrained models and demonstrate that pretraining consistently matches or ou... |
The paper proposes a new way to measure the 'importance' of a neuron, by re-parameterizing the scaling parameters of the batchnorm layers. The proposed method is to use a sigmoid on the scaling parameter, to ensure that it lies in [0,1], and the value of the sigmoid reflects the importance. Using this value (value clos... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper proposes a new way to measure the 'importance' of a neuron, by re-parameterizing the scaling parameters of the batchnorm layers. The proposed method is to use a sigmoid on the scaling parameter, to ensure that it lies in [0,1], and the value of the sigmoid reflects the importance. Using this value (va... |
This paper proposes ReAct; a novel framework for prompting large language models (LLMs) on tasks that require explicit reasoning and/or acting in an environment. Driven by recent work in plugging in LLMs into the main loop of a reasoning problem (e.g., fact verification or multi-hop question answering), or embodied pla... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposes ReAct; a novel framework for prompting large language models (LLMs) on tasks that require explicit reasoning and/or acting in an environment. Driven by recent work in plugging in LLMs into the main loop of a reasoning problem (e.g., fact verification or multi-hop question answering), or embo... |
This paper presents an empirical study of the adversarial robustness of dynamic neural networks (DyNNs) with early-exits. The authors find that DyNNs are more robust than SDNNs, and DyNNs can be used to generate adversarial samples efficiently. The authors also proposes a novel adversarial attack method specifically de... | Recommendation: 6: marginally above the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This paper presents an empirical study of the adversarial robustness of dynamic neural networks (DyNNs) with early-exits. The authors find that DyNNs are more robust than SDNNs, and DyNNs can be used to generate adversarial samples efficiently. The authors also proposes a novel adversarial attack method specifi... |
The paper considers the representation learning problem in domain generalization setting with fairness constraints (DP, EO). The paper presents upper and lower bounds for accuracy, and also an upper bound for fairness violation. Empirically, the paper aims to solve a minmax problem to account for fairness when learning... | Recommendation: 6: marginally above the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
The paper considers the representation learning problem in domain generalization setting with fairness constraints (DP, EO). The paper presents upper and lower bounds for accuracy, and also an upper bound for fairness violation. Empirically, the paper aims to solve a minmax problem to account for fairness when ... |
The paper suggests a set of selection criteria to training points in each AL step to avoid the so-called catastrophic forgetting which degrades model performance. A variety of heuristics is proposed some motivated by prior work and 2 new ones proposed by the authors (CAL-SD and CAL_SDS2).
Strengths
1. The problem tackl... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper suggests a set of selection criteria to training points in each AL step to avoid the so-called catastrophic forgetting which degrades model performance. A variety of heuristics is proposed some motivated by prior work and 2 new ones proposed by the authors (CAL-SD and CAL_SDS2).
Strengths
1. The probl... |
The paper argues that when the number of tasks are increased in a continual learning setting, catastrophic forgetting ceases to be a problem and a simple SGD training with gradient masking keeps on accumulating knowledge. Towards this, the authors propose a framework, called SCoLe, where the authors repetitively sample... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The paper argues that when the number of tasks are increased in a continual learning setting, catastrophic forgetting ceases to be a problem and a simple SGD training with gradient masking keeps on accumulating knowledge. Towards this, the authors propose a framework, called SCoLe, where the authors repetitivel... |
This paper proposes a framework for federated learning by adjusting the frequency of communication between agents and the server with an adaptive quantization scheme. Specifically, the authors combine two quantization schemes, namely, the adaptive quantization rule (AdaQuantFL) and lazily aggregated quantization (LAQ).... | 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 framework for federated learning by adjusting the frequency of communication between agents and the server with an adaptive quantization scheme. Specifically, the authors combine two quantization schemes, namely, the adaptive quantization rule (AdaQuantFL) and lazily aggregated quantizatio... |
This paper investigates the training dynamics in federated deep learning from the perspective of mini-batch SGD. Client coherence and global weight shrinking regularization are introduced in the proposed FedAWO framework. The corresponding parameters are learned in the server side with a proxy dataset. FedAWO’s effecti... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper investigates the training dynamics in federated deep learning from the perspective of mini-batch SGD. Client coherence and global weight shrinking regularization are introduced in the proposed FedAWO framework. The corresponding parameters are learned in the server side with a proxy dataset. FedAWO’s... |
I'm increasing my score from 5 to 6 as the authors have addressed several of my concerns.
However, I am still not convinced about the utility of this architecture or pretrained weights beyond the specific experimental setting that is considered by the authors because the task someone is performing has a big effect on t... | Recommendation: 6: marginally above the acceptance threshold | Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces) | Review:
I'm increasing my score from 5 to 6 as the authors have addressed several of my concerns.
However, I am still not convinced about the utility of this architecture or pretrained weights beyond the specific experimental setting that is considered by the authors because the task someone is performing has a big eff... |
This paper considers the online low-rank matrix completion problem for recommendation systems. An expected regret formulation, as the core analysis goal of the proposed problem, is defined and then minimized via the proposed ETC algorithm and a further OCTAL algorithm for special case of rank-one reward matrices. It pr... | Recommendation: 8: accept, good paper | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper considers the online low-rank matrix completion problem for recommendation systems. An expected regret formulation, as the core analysis goal of the proposed problem, is defined and then minimized via the proposed ETC algorithm and a further OCTAL algorithm for special case of rank-one reward matrice... |
The paper investigates the HBFP parameter search space to further improve efficiency and density in hardware accelerators.
They propose training on HBFP6, after experiments making the trade off: lower block size gives more accuracy, but is less HW efficient.
They show accuracy booster method that switch number of manti... | Recommendation: 6: marginally above the acceptance threshold | Area: General Machine Learning | Review:
The paper investigates the HBFP parameter search space to further improve efficiency and density in hardware accelerators.
They propose training on HBFP6, after experiments making the trade off: lower block size gives more accuracy, but is less HW efficient.
They show accuracy booster method that switch number ... |
The paper performs a large scale empirical study to investigate whether disentangled representations provide a clear benefit for the final performance on downstream tasks. First, the ground-truth disentangled representation (normalized true factors) are compared to a rotated version of the same representations. The aut... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper performs a large scale empirical study to investigate whether disentangled representations provide a clear benefit for the final performance on downstream tasks. First, the ground-truth disentangled representation (normalized true factors) are compared to a rotated version of the same representations.... |
This paper presents the factorized Fourier neural operator (F-FNO), which brings a set of techniques on FNO. The first technique is the separable Fourier representation to improve model stability and performance. Second, the improved residual connections. Third, the training strategies are carefully designed. Impressiv... | Recommendation: 6: marginally above the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This paper presents the factorized Fourier neural operator (F-FNO), which brings a set of techniques on FNO. The first technique is the separable Fourier representation to improve model stability and performance. Second, the improved residual connections. Third, the training strategies are carefully designed. I... |
This paper studies the benign overfitting phenomenon of deep neural models, namely over-parameterized deep neural models fitting the training data can still achieve low generalization error. The authors focus on a specific regime where the model is mildly overparameterized and label noise is prevalent. They show that i... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper studies the benign overfitting phenomenon of deep neural models, namely over-parameterized deep neural models fitting the training data can still achieve low generalization error. The authors focus on a specific regime where the model is mildly overparameterized and label noise is prevalent. They sho... |
This paper tackle the task of evaluating active feature acquisition (AFA) agent when the AFA agent cannot always access the complete set of features during decision making and there is distribution shift between training and evaluation stages. Specifically, it considers a subset of AFA problems where the features acqui... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper tackle the task of evaluating active feature acquisition (AFA) agent when the AFA agent cannot always access the complete set of features during decision making and there is distribution shift between training and evaluation stages. Specifically, it considers a subset of AFA problems where the featur... |
This work proposes LODO, an L2O that performs quasi-Newton optimization without any meta-training. Specifically, LODO has a hypergradient optimization structure while the parameterization of the approximated inverse Hessian is chosen to be a linear neural network. The authors prove that under certain simplified situati... | Recommendation: 5: marginally below the acceptance threshold | Area: Optimization (eg, convex and non-convex optimization) | Review:
This work proposes LODO, an L2O that performs quasi-Newton optimization without any meta-training. Specifically, LODO has a hypergradient optimization structure while the parameterization of the approximated inverse Hessian is chosen to be a linear neural network. The authors prove that under certain simplified... |
This paper proposes a novel GNN architecture that uses a small categorical space for messages and states instead of traditional synchronous message passing. Moreover, after training, they replace all the MLPs in their layers with decision trees to give a fully interpretable model
## Strenghts:
Authors address a real-... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes a novel GNN architecture that uses a small categorical space for messages and states instead of traditional synchronous message passing. Moreover, after training, they replace all the MLPs in their layers with decision trees to give a fully interpretable model
## Strenghts:
Authors address... |
To examine the intrinsic soundness of the classifier (maybe formulated as a deep neural network), this paper proposes a new method to estimate the limit Bayes error, where we just take the mean of the labels that show the uncertainty of the classes. The proposed method is claimed to be model-free and instance-free, and... | Recommendation: 8: accept, good paper | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
To examine the intrinsic soundness of the classifier (maybe formulated as a deep neural network), this paper proposes a new method to estimate the limit Bayes error, where we just take the mean of the labels that show the uncertainty of the classes. The proposed method is claimed to be model-free and instance-f... |
This paper proposes a general DP decentralized learning framework based on stochastic Decentralized Krasnosel’skiˇı–Mann (D-KM) iteration, which can represent the common first-order algorithms, like SGD, SPGD, and ADMM. Also, based on previous truncated Laplace mechanism, they proposed a truncated generalized Gaussian... | Recommendation: 3: reject, not good enough | Area: Optimization (eg, convex and non-convex optimization) | Review:
This paper proposes a general DP decentralized learning framework based on stochastic Decentralized Krasnosel’skiˇı–Mann (D-KM) iteration, which can represent the common first-order algorithms, like SGD, SPGD, and ADMM. Also, based on previous truncated Laplace mechanism, they proposed a truncated generalized ... |
This paper proposes a method for tackling RL with long-tailed distributions. It uses a self-supervised contrastive method to estimate state familiarity, and then adds the rare states to an episodic memory module based on prior work. The paper considers one task domain, in which it demonstrates compelling improvements f... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper proposes a method for tackling RL with long-tailed distributions. It uses a self-supervised contrastive method to estimate state familiarity, and then adds the rare states to an episodic memory module based on prior work. The paper considers one task domain, in which it demonstrates compelling improv... |
This paper focuses on a very interesting and important research topic, predicting the predictions from training data. Built on the datamodels proposed in [1], this paper seeks to provide a better theoretical understanding of why a linear regression method can predict the effect of training data. More importantly, this ... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper focuses on a very interesting and important research topic, predicting the predictions from training data. Built on the datamodels proposed in [1], this paper seeks to provide a better theoretical understanding of why a linear regression method can predict the effect of training data. More importantl... |
The paper considers policy learning in continuous treatment setting, particularly in optimal dose finding. The contributions of the paper includes (1) the development of the quasi-optimal Bellman operator to address the non-smoothness issue; (2) the use of q-Gaussian policy distribution to avoid off-policy support; (3)... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper considers policy learning in continuous treatment setting, particularly in optimal dose finding. The contributions of the paper includes (1) the development of the quasi-optimal Bellman operator to address the non-smoothness issue; (2) the use of q-Gaussian policy distribution to avoid off-policy supp... |
The paper introduces a framework of 'clock logic neural networks', which use a special neural network architecture to train temporal process models that can then be interpreted in terms of weighted clock logic formulae. The paper provides a detailed overview of weighted clock logic, and proves that the network archite... | Recommendation: 8: accept, good paper | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
The paper introduces a framework of 'clock logic neural networks', which use a special neural network architecture to train temporal process models that can then be interpreted in terms of weighted clock logic formulae. The paper provides a detailed overview of weighted clock logic, and proves that the network... |
This paper describes iCITRIS, a generalization of CITRIS [Lippe et al 2022] to allow for “instantaneous effects”: i.e. they allow dependencies between the latent variables within a given time step, as opposed to enforcing conditional independence of the latents at time t given the latents at time t-1. They start by sho... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper describes iCITRIS, a generalization of CITRIS [Lippe et al 2022] to allow for “instantaneous effects”: i.e. they allow dependencies between the latent variables within a given time step, as opposed to enforcing conditional independence of the latents at time t given the latents at time t-1. They star... |
This paper studies the stochastic multi-armed bandit problem (K-armed as well as the linear version) under "reproducibility constraints," i.e., the policy should play the same sequence of arms in any two i.i.d. instances of the problem (using the same algorithmic random seed) with probability at least $1-\rho$. The aut... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper studies the stochastic multi-armed bandit problem (K-armed as well as the linear version) under "reproducibility constraints," i.e., the policy should play the same sequence of arms in any two i.i.d. instances of the problem (using the same algorithmic random seed) with probability at least $1-\rho$.... |
The author proposes to optimize the aggregation weight of each client, and find that the aggregation weight is closely related to gradient coherence. The proposed method improves the heterogeneity coherence. The author also proposes global weight shrinking to improve the training performance. Moreover, the author makes... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The author proposes to optimize the aggregation weight of each client, and find that the aggregation weight is closely related to gradient coherence. The proposed method improves the heterogeneity coherence. The author also proposes global weight shrinking to improve the training performance. Moreover, the auth... |
This paper porposes an interesting method to learn the agent's morphology that are robust to the change of environments. To achive this, this paper proposes a co-evolution method to learn two policies that automatically change the morphology and the environment, respectively. The experimental results demonstrate the s... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper porposes an interesting method to learn the agent's morphology that are robust to the change of environments. To achive this, this paper proposes a co-evolution method to learn two policies that automatically change the morphology and the environment, respectively. The experimental results demonstra... |
In this article the author seek to develop a method to solve the code collapsing problem which is common in VQ related methods. The nature of the proposed method is to regularize the code selection with a uniform prior so that different codes will be evenly used. The author conducted experiments in different settings i... | Recommendation: 6: marginally above the acceptance threshold | Area: Generative models | Review:
In this article the author seek to develop a method to solve the code collapsing problem which is common in VQ related methods. The nature of the proposed method is to regularize the code selection with a uniform prior so that different codes will be evenly used. The author conducted experiments in different se... |
This paper proposes a variant of the diffusion-based model with "inverse heat dissipation" (equivalent to continuous de-blurring Gaussian blur). Compared to the standard diffusion model, inverting the heat equation -- a PDE locally erases fine-scale information -- makes the generation consider multi-scale structures na... | Recommendation: 6: marginally above the acceptance threshold | Area: Generative models | Review:
This paper proposes a variant of the diffusion-based model with "inverse heat dissipation" (equivalent to continuous de-blurring Gaussian blur). Compared to the standard diffusion model, inverting the heat equation -- a PDE locally erases fine-scale information -- makes the generation consider multi-scale struc... |
This paper proposes a new member of neural processes. The aim is to improve the attention efficiency of transformer neural process where the attention strategy requires quadratic computation with respect to the number of context data points. The idea is from iterative attention (Jaegle et al., 2021b) which changes the... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes a new member of neural processes. The aim is to improve the attention efficiency of transformer neural process where the attention strategy requires quadratic computation with respect to the number of context data points. The idea is from iterative attention (Jaegle et al., 2021b) which cha... |
This paper presents a method of casting the problem of multi-person pose estimation as a two-level (human and keypoints) Explicit-box Detection problem. It is built on the DETR framework and its variants such as the Deformable DETR and DN-DETR. The human detection component is a direct application of the existing DETR... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper presents a method of casting the problem of multi-person pose estimation as a two-level (human and keypoints) Explicit-box Detection problem. It is built on the DETR framework and its variants such as the Deformable DETR and DN-DETR. The human detection component is a direct application of the exist... |
This paper aims to tackle the privacy issue when collecting datasets from online databases by introducing a novel graph generative model, which is called Computation Graph Transformer (CGT), that can learn the distribution of real-world graphs in a privacy-enhanced manner. The proposed algorithm can generate synthetic
... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This paper aims to tackle the privacy issue when collecting datasets from online databases by introducing a novel graph generative model, which is called Computation Graph Transformer (CGT), that can learn the distribution of real-world graphs in a privacy-enhanced manner. The proposed algorithm can generate sy... |
This work concentrates on two problems in the MUDA task: a) sharing the same domain-specific information across domains to fuse multi-source data; b) generating reliable pseudo labels to alleviate the effect of noisy pseudo labels. Thus, they proposed the Contrary Attention-based Domain Merge modules to pass domain-spe... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This work concentrates on two problems in the MUDA task: a) sharing the same domain-specific information across domains to fuse multi-source data; b) generating reliable pseudo labels to alleviate the effect of noisy pseudo labels. Thus, they proposed the Contrary Attention-based Domain Merge modules to pass do... |
The authors consider a modification of the PINN construction for solving certain classes of partial differential equations. Namely, they focus on PDEs formulated as a macroscopic description of an underlying microscopic physical process, such as diffusion and advection. They claim that the soft constraint on the PINN l... | Recommendation: 6: marginally above the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
The authors consider a modification of the PINN construction for solving certain classes of partial differential equations. Namely, they focus on PDEs formulated as a macroscopic description of an underlying microscopic physical process, such as diffusion and advection. They claim that the soft constraint on th... |
The paper presents a method for performing text-based semantic image editing. The key ideas are
1) identifying where to edit by comparing the image differences between query text-guided and reference text-guided (or unguided) image generation and
2) use DDIM encoding for preserving the contents that are outside the ge... | Recommendation: 8: accept, good paper | Area: Generative models | Review:
The paper presents a method for performing text-based semantic image editing. The key ideas are
1) identifying where to edit by comparing the image differences between query text-guided and reference text-guided (or unguided) image generation and
2) use DDIM encoding for preserving the contents that are outsid... |
The paper presents a method for adapting a single-image super-resolution [SR] deep network to different computational environments while maintaining a real-time quality of service. The method used is to identify sub-networks (graphs) within a larger network (graph) that are optimized to solving the SR problem but with ... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper presents a method for adapting a single-image super-resolution [SR] deep network to different computational environments while maintaining a real-time quality of service. The method used is to identify sub-networks (graphs) within a larger network (graph) that are optimized to solving the SR problem b... |
This paper proposes an unsupervised performance predictor called USPP to reduce the training/search cost of NAS. To bridge the source and target search spaces, the authors develop a progressive domain-invariant feature extraction method to obtain domain-invariant features of architectures. Moreover, this paper provides... | Recommendation: 5: marginally below the acceptance threshold | Area: General Machine Learning | Review:
This paper proposes an unsupervised performance predictor called USPP to reduce the training/search cost of NAS. To bridge the source and target search spaces, the authors develop a progressive domain-invariant feature extraction method to obtain domain-invariant features of architectures. Moreover, this paper ... |
The paper explores the use of lower bounds for for value targets in order to improve the sample efficient in Reinforcement Learning algorithms. The authors outline the design of easily computable value lower bounds across different environment settings (episodic or continuous) and algorithms (n-step TD, SAC, HER). They... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper explores the use of lower bounds for for value targets in order to improve the sample efficient in Reinforcement Learning algorithms. The authors outline the design of easily computable value lower bounds across different environment settings (episodic or continuous) and algorithms (n-step TD, SAC, HE... |
This paper addresses the tabular-data-to-image generation problem, which is novel and somewhat interesting. To study this unexplored problem, this work first curates a benchmark dataset containing 300 pairs of tables and images. Then, this paper utilizes existing models, e.g., DALL-E, GPT3, VQGAN, and TABBIE, to genera... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper addresses the tabular-data-to-image generation problem, which is novel and somewhat interesting. To study this unexplored problem, this work first curates a benchmark dataset containing 300 pairs of tables and images. Then, this paper utilizes existing models, e.g., DALL-E, GPT3, VQGAN, and TABBIE, t... |
The paper proposes GraphSAD, a subsequence time-series anomaly detection method that fuses discord-based anomaly detection solutions with graph neural network (GNN) /deep neural network (DNN) architectures. The core contribution of the paper is the construction of two types of graphs, semantic and temporal, to capture ... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper proposes GraphSAD, a subsequence time-series anomaly detection method that fuses discord-based anomaly detection solutions with graph neural network (GNN) /deep neural network (DNN) architectures. The core contribution of the paper is the construction of two types of graphs, semantic and temporal, to ... |
This paper proposes inr2vec, a framework for embedding implicit neural representations (INR) into a latent representation. The latent representations can then be used as data for various downstream tasks including classification, generative modeling and shape completion, effectively leading to a framework for performin... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper proposes inr2vec, a framework for embedding implicit neural representations (INR) into a latent representation. The latent representations can then be used as data for various downstream tasks including classification, generative modeling and shape completion, effectively leading to a framework for p... |
This paper proposes a method to learn implicit manifolds and sample from them using energy-based models. In particular, the paper first proposes a regularized method for learning submanifolds of any codimension and then shows how to fit the energy function and sample using a faster version of constrained HMC.
Strengths... | Recommendation: 3: reject, not good enough | Area: Generative models | Review:
This paper proposes a method to learn implicit manifolds and sample from them using energy-based models. In particular, the paper first proposes a regularized method for learning submanifolds of any codimension and then shows how to fit the energy function and sample using a faster version of constrained HMC.
S... |
The paper proposed BONET, a method to optimize expensive black-box function with offline data. BONET consists of three phases, 1) synthesize trajectories from offline data using a simple heuristic, 2) fit an autoregressive model based on the trajectories and regret budgets and 3) roll out the evaluation to output predi... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper proposed BONET, a method to optimize expensive black-box function with offline data. BONET consists of three phases, 1) synthesize trajectories from offline data using a simple heuristic, 2) fit an autoregressive model based on the trajectories and regret budgets and 3) roll out the evaluation to outp... |
The paper investigates the effect of the concrete pretraining task (and, to a lesser extend), the model architecture, on the effectiveness of the resulting pretrained language representation model. The latter is measured in multiple ways, performing zero-shot, one-shot and normal finetuning experiments.
The paper furt... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The paper investigates the effect of the concrete pretraining task (and, to a lesser extend), the model architecture, on the effectiveness of the resulting pretrained language representation model. The latter is measured in multiple ways, performing zero-shot, one-shot and normal finetuning experiments.
The pa... |
This paper aimed at alleviating the acoustic multimodality problem for speech-to-unit approaches for direct speech-to-speech translation (S2ST) system. To address this problem, the authors developed bilateral perturbations (BiP) and leveraged the CTC fine-tuning technology. The bilateral perturbations include informati... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper aimed at alleviating the acoustic multimodality problem for speech-to-unit approaches for direct speech-to-speech translation (S2ST) system. To address this problem, the authors developed bilateral perturbations (BiP) and leveraged the CTC fine-tuning technology. The bilateral perturbations include i... |
In this paper the authors propose an axiomatic analysis of some of the metrics most commonly used in ML-based de novo design algorithms. Specifically, they lay down several axioms that measures of coverage of chemical space should obey and based on those propose a new metric for evaluation (#circles).
Overall this is ... | Recommendation: 6: marginally above the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
In this paper the authors propose an axiomatic analysis of some of the metrics most commonly used in ML-based de novo design algorithms. Specifically, they lay down several axioms that measures of coverage of chemical space should obey and based on those propose a new metric for evaluation (#circles).
Overall ... |
This paper considers the problem of learning a fair classifier from a sanitized dataset. This sanitized dataset is obtained by applying a local DP mechanism to the original data to obfuscate the sensitive attributes. This paper provides a precise characterization of the utility reduction in terms of statistical efficie... | 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 considers the problem of learning a fair classifier from a sanitized dataset. This sanitized dataset is obtained by applying a local DP mechanism to the original data to obfuscate the sensitive attributes. This paper provides a precise characterization of the utility reduction in terms of statistical... |
The work presents a novel adaptive data-driven UAV flight control method, OoD-Control. Under gaussian noise assumptions and bounded control and disturbances, the authors show that the upper bound of the prediction error remains constant under unpredictable disturbance. The control method (and bound) is also shown to be... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The work presents a novel adaptive data-driven UAV flight control method, OoD-Control. Under gaussian noise assumptions and bounded control and disturbances, the authors show that the upper bound of the prediction error remains constant under unpredictable disturbance. The control method (and bound) is also sho... |
This work proposed a new genre of convolution, namely continuous-discrete convolution (CDConv) for protein representation learning, which is folded from 1D discrete amino acid chains into a 3D continuous space. Rather than separately aggregating 1D and 3D representation, the proposed (3+1)D CDConv unifies continuous an... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This work proposed a new genre of convolution, namely continuous-discrete convolution (CDConv) for protein representation learning, which is folded from 1D discrete amino acid chains into a 3D continuous space. Rather than separately aggregating 1D and 3D representation, the proposed (3+1)D CDConv unifies conti... |
The main contributions of the paper are twofold:
* on one hand, the paper provides an overview of the main sources of complexity when computing a Nash Equilibrium in two-player zero-sum game with imperfect information. Those are named *backward dependence problem* and *non-correspondence problem*.
* on the other hand,... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The main contributions of the paper are twofold:
* on one hand, the paper provides an overview of the main sources of complexity when computing a Nash Equilibrium in two-player zero-sum game with imperfect information. Those are named *backward dependence problem* and *non-correspondence problem*.
* on the oth... |
In order to simulate the effect of confusion in multi-choice crowdsourcing problems, this paper proposes a new multi-choice crowdsourcing task model and provides a two-stage inference algorithm to recover the first two answers and the confusion probability of each task. Finally, it shows the potential application of th... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
In order to simulate the effect of confusion in multi-choice crowdsourcing problems, this paper proposes a new multi-choice crowdsourcing task model and provides a two-stage inference algorithm to recover the first two answers and the confusion probability of each task. Finally, it shows the potential applicati... |
This paper proposed a spatio-functional embedding model named ExpressivE, which has the benefits of both region-based and functional models. Compared to present methods, ExpressivE can (1) fully capture vital inference patterns, (2) capture prominent logical rules jointly, and (3) provide an intuitive interpretation of... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper proposed a spatio-functional embedding model named ExpressivE, which has the benefits of both region-based and functional models. Compared to present methods, ExpressivE can (1) fully capture vital inference patterns, (2) capture prominent logical rules jointly, and (3) provide an intuitive interpret... |
This paper addresses the issue of generic response generation by first using adapters for efficient multi-decoder frameworks, and next using a balanced EM algorithm to train the EM of the multi-decoders. The main contribution is to train the balanced EM by the classic Hungarian algorithm. Experiments compare the propos... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper addresses the issue of generic response generation by first using adapters for efficient multi-decoder frameworks, and next using a balanced EM algorithm to train the EM of the multi-decoders. The main contribution is to train the balanced EM by the classic Hungarian algorithm. Experiments compare th... |
# Summary of The Paper
The paper considers the problem of image recovery with sparse or
low-rank regularizers. The method considered to solve this problem is
iteratively reweighted least-squares (IRLS), as well as its learned
variant. The methods are implemented and applied to several image
processing problems, e.g., s... | Recommendation: 6: marginally above the acceptance threshold | Area: Optimization (eg, convex and non-convex optimization) | Review:
# Summary of The Paper
The paper considers the problem of image recovery with sparse or
low-rank regularizers. The method considered to solve this problem is
iteratively reweighted least-squares (IRLS), as well as its learned
variant. The methods are implemented and applied to several image
processing problems,... |
This paper presents a method to prevent existing large language models to produce toxic discourse. Contrary to existing methods that modify the training procedure for LLMs or eliminate tokens at inference based on rules, the proposed method uses reinforcement learning to compute, at each step of the generation, a proba... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper presents a method to prevent existing large language models to produce toxic discourse. Contrary to existing methods that modify the training procedure for LLMs or eliminate tokens at inference based on rules, the proposed method uses reinforcement learning to compute, at each step of the generation,... |
This paper considers a monotone variational inequality to be solved in a Federated learning setup, with a central server and multiple clients. They develop a version of the extra gradient (EG) algorithm in this setting where the bottleneck is the communication: In their algorithm, communications between the central ser... | Recommendation: 8: accept, good paper | Area: General Machine Learning | Review:
This paper considers a monotone variational inequality to be solved in a Federated learning setup, with a central server and multiple clients. They develop a version of the extra gradient (EG) algorithm in this setting where the bottleneck is the communication: In their algorithm, communications between the cen... |
In this paper, the authors proposed 0/1 Adam to reduce communication during training. 0/1 Adam addresses the existing issues by adaptively freezing variance and linearly approximating momentum and parameter update locally. The authors provide theoretical convergence guarantee and experimental results on large-scale tra... | Recommendation: 6: marginally above the acceptance threshold | Area: Optimization (eg, convex and non-convex optimization) | Review:
In this paper, the authors proposed 0/1 Adam to reduce communication during training. 0/1 Adam addresses the existing issues by adaptively freezing variance and linearly approximating momentum and parameter update locally. The authors provide theoretical convergence guarantee and experimental results on large-s... |
This paper investigates the fair classification problem in the long term. It introduces a new algorithm, ELF, to solve the fair classification problem as both a classification and a reinforcement learning problem — classification for optimizing the main objective (a measure of classification loss) and reinforcement lea... | 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 investigates the fair classification problem in the long term. It introduces a new algorithm, ELF, to solve the fair classification problem as both a classification and a reinforcement learning problem — classification for optimizing the main objective (a measure of classification loss) and reinforce... |
The proposed work, LUSER, aims to improve the computational efficiency of deep unfolding network at training for solving general image inverse problems. To do so, the proposed LUSER incorporated the fixed-point training of the neural network itself within each unrolling iterations by using the deep equilibrium model... | Recommendation: 5: marginally below the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
The proposed work, LUSER, aims to improve the computational efficiency of deep unfolding network at training for solving general image inverse problems. To do so, the proposed LUSER incorporated the fixed-point training of the neural network itself within each unrolling iterations by using the deep equilibri... |
This paper introduced an activation compressed training (ACT) framework, called DIVISION. Specifically, DIVISION is inspired by the insight that DNN backward propagation mainly utilizes the low-frequency component (LFC) of the activation maps, while the majority of memory is for the storage of the high-frequency compon... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This paper introduced an activation compressed training (ACT) framework, called DIVISION. Specifically, DIVISION is inspired by the insight that DNN backward propagation mainly utilizes the low-frequency component (LFC) of the activation maps, while the majority of memory is for the storage of the high-frequenc... |
This paper proposes a new problem of serving (test-time/deploy-phase inference) of a trained GNNs efficiently.
Many GNN papers work on a semi-supervised node classification task. In that semi-supervised node classification scenarios, the trained GNN must retrain the huge memory load ot the entire training graphs to pe... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper proposes a new problem of serving (test-time/deploy-phase inference) of a trained GNNs efficiently.
Many GNN papers work on a semi-supervised node classification task. In that semi-supervised node classification scenarios, the trained GNN must retrain the huge memory load ot the entire training grap... |
This paper studied the problem that MIM is compatible with the Transformer family but is incompatible with CNNs. To this end, it proposed an Architecture-Agnostic Masked Image Modeling framework (A2MIM) that is compatible with both Transformers and CNNs in a unified way. Specifically, this paper used RGB Mean as masked... | Recommendation: 3: reject, not good enough | Area: Unsupervised and Self-supervised learning | Review:
This paper studied the problem that MIM is compatible with the Transformer family but is incompatible with CNNs. To this end, it proposed an Architecture-Agnostic Masked Image Modeling framework (A2MIM) that is compatible with both Transformers and CNNs in a unified way. Specifically, this paper used RGB Mean a... |
This manuscript focuses on the problem of learning better aggregation attention. The motivation comes from the observation that there is no clear winner of the existing three aggregation methods, including native GCN and GAT. The authors propose a new CAT aggregation method and merge it with GCN and GAT. The proposed m... | Recommendation: 6: marginally above the acceptance threshold | Area: General Machine Learning | Review:
This manuscript focuses on the problem of learning better aggregation attention. The motivation comes from the observation that there is no clear winner of the existing three aggregation methods, including native GCN and GAT. The authors propose a new CAT aggregation method and merge it with GCN and GAT. The pr... |
The paper is trying to produce a better measure of entropy for NLG tasks where sentences with same semantics can have really high entropy in the conventional methods as they rely on superficial measures from the exact token or sequence of tokens. The same sentence can be paraphrased in many ways and hence be equivalent... | Recommendation: 8: accept, good paper | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
The paper is trying to produce a better measure of entropy for NLG tasks where sentences with same semantics can have really high entropy in the conventional methods as they rely on superficial measures from the exact token or sequence of tokens. The same sentence can be paraphrased in many ways and hence be eq... |
This paper aims at improving the transformer based vulnerable code repair techniques. Inspired by vision transformer based object detection approach, it proposes to incorporate a learnable ‘vulnerability query mask’ into both encoder output and the cross-attention of existing transformer based models. Experimental res... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper aims at improving the transformer based vulnerable code repair techniques. Inspired by vision transformer based object detection approach, it proposes to incorporate a learnable ‘vulnerability query mask’ into both encoder output and the cross-attention of existing transformer based models. Experime... |
This paper studies the federated learning problem. In particular, this paper aims to provide a unified framework for communication cost, robustness to data heterogeneity, and other challenges. To tackle these problems, this paper proposes an attention-based adapter module at each transformer block. In the federated opt... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper studies the federated learning problem. In particular, this paper aims to provide a unified framework for communication cost, robustness to data heterogeneity, and other challenges. To tackle these problems, this paper proposes an attention-based adapter module at each transformer block. In the feder... |
This paper studies offline RL (MAB/CB/MDP) under general function approximation and single-policy coverage. The authors leverage MIS formulation plus augmented Langragian method (ALM) and identify that the key for solving problem is to ensure that certain state occupancy validity constraints are nearly satisfied.
## St... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper studies offline RL (MAB/CB/MDP) under general function approximation and single-policy coverage. The authors leverage MIS formulation plus augmented Langragian method (ALM) and identify that the key for solving problem is to ensure that certain state occupancy validity constraints are nearly satisfie... |
This paper proposes a denoising frontend for automatic speech recognition. The method combines speech enhancement (regression) and recognition (classification) loss. The paper presents a scheme for automatically balancing the regression and classification losses. The paper shows the effectiveness of the proposed method... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposes a denoising frontend for automatic speech recognition. The method combines speech enhancement (regression) and recognition (classification) loss. The paper presents a scheme for automatically balancing the regression and classification losses. The paper shows the effectiveness of the propose... |
The paper studies adversarial attacks on fair clustering. The authors demonstrate simple adversarial attacks on existing fair clustering approaches and propose an algorithm that is robust to the attack.
------------------------
Strengths:
------------------------
-- The paper is mainly well written (except section 3.1)... | Recommendation: 8: accept, good paper | Area: Unsupervised and Self-supervised learning | Review:
The paper studies adversarial attacks on fair clustering. The authors demonstrate simple adversarial attacks on existing fair clustering approaches and propose an algorithm that is robust to the attack.
------------------------
Strengths:
------------------------
-- The paper is mainly well written (except sect... |
The paper presents a unified method to combine both iterative magnitude pruning and the Dual Lottery Ticket Hypothesis (Bai et al.) by combining early stopping and regularization in addition to traditional magnitude pruning. They also prove that early stopping is equivalent to $L_2$ regularization and also suggest some... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The paper presents a unified method to combine both iterative magnitude pruning and the Dual Lottery Ticket Hypothesis (Bai et al.) by combining early stopping and regularization in addition to traditional magnitude pruning. They also prove that early stopping is equivalent to $L_2$ regularization and also sugg... |
In this paper, the authors present Lux, an environment for multi-agent reinforcement learning at scale. The environment is evaluated through simulations using a curriculum learning solution. The main contribution of this work resides in the environment itself, which allows for a simulation of multi-agent interactions a... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
In this paper, the authors present Lux, an environment for multi-agent reinforcement learning at scale. The environment is evaluated through simulations using a curriculum learning solution. The main contribution of this work resides in the environment itself, which allows for a simulation of multi-agent intera... |
This paper proposed to extend the Closed-Loop Transcription (CTRL) (Dai et al., 2022). While the original CTRL formulates the task of generative modeling as a minimax game between the encoder and the decoder, the proposed method simply employs an additional cooperate term that minimizes the rate reduction in both of th... | Recommendation: 3: reject, not good enough | Area: Generative models | Review:
This paper proposed to extend the Closed-Loop Transcription (CTRL) (Dai et al., 2022). While the original CTRL formulates the task of generative modeling as a minimax game between the encoder and the decoder, the proposed method simply employs an additional cooperate term that minimizes the rate reduction in bo... |
This paper proposes a simple strategy to prompt language models: Ask Me Anything. From the findings that open-ended questions outperform restrictive prompts, AMA first encourages the LMs to generate open-ended questions, which is a scalable approach. From a few open-ended questions generated by the model, the LM answer... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposes a simple strategy to prompt language models: Ask Me Anything. From the findings that open-ended questions outperform restrictive prompts, AMA first encourages the LMs to generate open-ended questions, which is a scalable approach. From a few open-ended questions generated by the model, the L... |
This paper studies how to incorporate vision language model (VLM), audio language model (ALM) and large language model (LLM) to perform joint predictions for multimodal tasks. The integration of different LMs are based on various language prompts. Results show that the proposed method achieves promising zero-shot and f... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper studies how to incorporate vision language model (VLM), audio language model (ALM) and large language model (LLM) to perform joint predictions for multimodal tasks. The integration of different LMs are based on various language prompts. Results show that the proposed method achieves promising zero-sh... |
The paper present a method for test time adaptation using learnable visual prompts integrated with visual transformers. The paper uses various regularization methods to avoid error accomulation; knowledge distilation from ensemble or sourch checkpoints, self-supervised learning and learnable visual prompts.
The resul... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper present a method for test time adaptation using learnable visual prompts integrated with visual transformers. The paper uses various regularization methods to avoid error accomulation; knowledge distilation from ensemble or sourch checkpoints, self-supervised learning and learnable visual prompts.
T... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.