review stringlengths 5 16.6k | score stringclasses 5
values | area stringclasses 12
values | text stringlengths 31 5.65k |
|---|---|---|---|
This work addresses the task of multi-modal DG where each modality has to cope with its own domain shift. Specifically, the specific scenario of query-based video segmentation is studied to better advance the generalization ability of the model in the multi-modal situation. The authors observe that actions belonging to... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This work addresses the task of multi-modal DG where each modality has to cope with its own domain shift. Specifically, the specific scenario of query-based video segmentation is studied to better advance the generalization ability of the model in the multi-modal situation. The authors observe that actions belo... |
The authors address the task of 3D human mesh registration with key focus on registering a complete template to (incomplete) single view point cloud. Authors show better performance than baselines on the registration as well as correspondence prediction task.
Strengths:
+ The task of registering partial/ single view da... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The authors address the task of 3D human mesh registration with key focus on registering a complete template to (incomplete) single view point cloud. Authors show better performance than baselines on the registration as well as correspondence prediction task.
Strengths:
+ The task of registering partial/ single... |
As a standard benchmark for POMDP tasks is desired due to rising research interests, the paper proposed 3 new Gym tasks which are memory-dependent POMDPs. The key features of the environments are (1) "strongly depend on memory". (2) different levels of difficulty. (3) good meta properties (Table 1).
The authors cond... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
As a standard benchmark for POMDP tasks is desired due to rising research interests, the paper proposed 3 new Gym tasks which are memory-dependent POMDPs. The key features of the environments are (1) "strongly depend on memory". (2) different levels of difficulty. (3) good meta properties (Table 1).
The auth... |
The paper studies an offline RL algorithm by utilizing the special policy structure of the behavior policy (which generates the offline data). The paper proposes to define the policy being learned by using a mixture of sub-policies, which is in the form of pi(s, a) = sum_z p(z|s) pi_sub (a | s, z), where z is the intro... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper studies an offline RL algorithm by utilizing the special policy structure of the behavior policy (which generates the offline data). The paper proposes to define the policy being learned by using a mixture of sub-policies, which is in the form of pi(s, a) = sum_z p(z|s) pi_sub (a | s, z), where z is t... |
This paper studies the adversarial robustness of federated learning, which is an important problem when training the model on the client side. Specially, the authors consider the incompatible dilemma between federated learning and adversarial training, and introduce a mediating slack mechanism to better bridge two para... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper studies the adversarial robustness of federated learning, which is an important problem when training the model on the client side. Specially, the authors consider the incompatible dilemma between federated learning and adversarial training, and introduce a mediating slack mechanism to better bridge ... |
The authors propose to use transformers for electric impedance tomography, with ideas that may apply to a broade range of boundary value inverse problems. EIT is known to be very ill-posed (only log stable) so it is a challenging test for any method. The authors frame the problem as inverting the samples of the NtD map... | Recommendation: 8: accept, good paper | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
The authors propose to use transformers for electric impedance tomography, with ideas that may apply to a broade range of boundary value inverse problems. EIT is known to be very ill-posed (only log stable) so it is a challenging test for any method. The authors frame the problem as inverting the samples of the... |
To the authors' knowledge, this work proposes the first algorithm that provably converges to a local min-max equilibrium for smooth nonconvex-nonconcave minimax optimization.
Pros: This work is highly novel in both algorithm and proof technique, as elaborated in **Novelty** below. The convergence is also well supporte... | Recommendation: 5: marginally below the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
To the authors' knowledge, this work proposes the first algorithm that provably converges to a local min-max equilibrium for smooth nonconvex-nonconcave minimax optimization.
Pros: This work is highly novel in both algorithm and proof technique, as elaborated in **Novelty** below. The convergence is also well ... |
This work aims to propose a differentiable and scalable k-subset sampling algorithm based on conditional Poisson sampling. The scalability comes from the conditional Poisson sampling scheme where each instance is sampled independently such that the vectorized complexity of the proposed algorithm is independent of the s... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This work aims to propose a differentiable and scalable k-subset sampling algorithm based on conditional Poisson sampling. The scalability comes from the conditional Poisson sampling scheme where each instance is sampled independently such that the vectorized complexity of the proposed algorithm is independent ... |
This paper studies text-supervised semantic segmentation. The authors propose multi-View Consistent learning (ViewCo) to introduce the correspondence among multiple augmented views of the same image. The experimental results on serval datasets demonstrate the effectiveness of the proposed method.
Strength
+ Compared to... | Recommendation: 8: accept, good paper | Area: Unsupervised and Self-supervised learning | Review:
This paper studies text-supervised semantic segmentation. The authors propose multi-View Consistent learning (ViewCo) to introduce the correspondence among multiple augmented views of the same image. The experimental results on serval datasets demonstrate the effectiveness of the proposed method.
Strength
+ Com... |
The paper provides a theoretical generalization analysis to show that jointly applying sparsification methods on both the graph edges (network topology) and neurons (model) of a graph neural network (GNN) makes training more efficient in terms of sample complexity (required number of known labels) and convergence rate... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The paper provides a theoretical generalization analysis to show that jointly applying sparsification methods on both the graph edges (network topology) and neurons (model) of a graph neural network (GNN) makes training more efficient in terms of sample complexity (required number of known labels) and converge... |
If I understand this paper correctly, the authors introduce a way how to optimize for integrating “feint” actions into the solutions of stochastic-game-like interactions to promote diversity. They do so by gradually building up the criterion function from three aspects they consider the most important, and refer to the... | Recommendation: 5: marginally below the acceptance threshold | Area: General Machine Learning | Review:
If I understand this paper correctly, the authors introduce a way how to optimize for integrating “feint” actions into the solutions of stochastic-game-like interactions to promote diversity. They do so by gradually building up the criterion function from three aspects they consider the most important, and refe... |
The paper introduces a new multi-modal VAE model which includes modality-specific latent variables, as well as shared latent variables with the latter encoded through a mixture-of-experts model. The new variational bound allows to utilize private latent variables that do not hinder cross-modal coherence and generation... | Recommendation: 6: marginally above the acceptance threshold | Area: Generative models | Review:
The paper introduces a new multi-modal VAE model which includes modality-specific latent variables, as well as shared latent variables with the latter encoded through a mixture-of-experts model. The new variational bound allows to utilize private latent variables that do not hinder cross-modal coherence and ge... |
The paper proposes a first of its kind in-processing learning framework FairGBM for training GBDT, without affecting its performance, constrained by fairness. The paper tries to advanced the area of FairML, limiting risks of unfair or biased ML systems and aims to establish a gold standard method. The authors provide e... | Recommendation: 8: accept, good paper | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
The paper proposes a first of its kind in-processing learning framework FairGBM for training GBDT, without affecting its performance, constrained by fairness. The paper tries to advanced the area of FairML, limiting risks of unfair or biased ML systems and aims to establish a gold standard method. The authors p... |
This submission proposed to conduct post-training quantization by learning element-wise scaling parameters $\boldsymbol{S}$. Pre-quantized parameters are divided by the scaling parameters and then rounded to integer. Basically, the proposed method is a subtle re-training for pre-trained parameters for quantization.
Wea... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This submission proposed to conduct post-training quantization by learning element-wise scaling parameters $\boldsymbol{S}$. Pre-quantized parameters are divided by the scaling parameters and then rounded to integer. Basically, the proposed method is a subtle re-training for pre-trained parameters for quantizat... |
The paper introduces a self-supervised visual pretraining technique called CIM: Corrupted Image Modeling. The main idea is to randomly select patches and replace them with plausible alternatives, instead of using a MASK token. An enhancer network tries to solve pretext tasks on these augmented images (generating all or... | Recommendation: 8: accept, good paper | Area: Unsupervised and Self-supervised learning | Review:
The paper introduces a self-supervised visual pretraining technique called CIM: Corrupted Image Modeling. The main idea is to randomly select patches and replace them with plausible alternatives, instead of using a MASK token. An enhancer network tries to solve pretext tasks on these augmented images (generatin... |
This paper proposes a method to interpret out-of-distribution detection using learnt high-level concepts.
Strengths
- To my knowledge, this is the first work to study the notion of concept-based explanations for OOD detection.
- The idea of LDA on the concept layer is clever and simple.
- The proposed metrics are easy ... | 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 method to interpret out-of-distribution detection using learnt high-level concepts.
Strengths
- To my knowledge, this is the first work to study the notion of concept-based explanations for OOD detection.
- The idea of LDA on the concept layer is clever and simple.
- The proposed metrics a... |
This paper proposes to improve the discrete sequence model for long-term video prediction. The proposed method operates on (patch-wise) quantized representation of videos extracted by VQ-GAN, and models the temporal dynamics through Transformers. To handle the quadratic complexity of Transformers thus enabling training... | Recommendation: 6: marginally above the acceptance threshold | Area: Generative models | Review:
This paper proposes to improve the discrete sequence model for long-term video prediction. The proposed method operates on (patch-wise) quantized representation of videos extracted by VQ-GAN, and models the temporal dynamics through Transformers. To handle the quadratic complexity of Transformers thus enabling ... |
This paper provides some regret bounds for *online* matrix completion: at each round, a recommendation is made for each of the M users and the reward is observed. The reward distribution is unchanged through time (this is therefore a contextual bandit scenario).
In the simplest approach (Sections 3, 4, B and C), the a... | Recommendation: 8: accept, good paper | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper provides some regret bounds for *online* matrix completion: at each round, a recommendation is made for each of the M users and the reward is observed. The reward distribution is unchanged through time (this is therefore a contextual bandit scenario).
In the simplest approach (Sections 3, 4, B and C... |
This paper studies the problem of hypothesis testing in community detection: instead of asking to recover the exact community assignments, the goal is to perform hypothesis testing on them (e.g. asking whether two given nodes belong to the same community or not).
The authors introduce a framework for measuring distanc... | Recommendation: 8: accept, good paper | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper studies the problem of hypothesis testing in community detection: instead of asking to recover the exact community assignments, the goal is to perform hypothesis testing on them (e.g. asking whether two given nodes belong to the same community or not).
The authors introduce a framework for measuring... |
This paper propose to investigate meta-continual learning scenario where the task boundaries are not known and whether distribution shift occur or not. To solve this challenging problem, they focus on some empirical findings that the loss values or free energies sharply increases when the boundary meets. Thus they intr... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper propose to investigate meta-continual learning scenario where the task boundaries are not known and whether distribution shift occur or not. To solve this challenging problem, they focus on some empirical findings that the loss values or free energies sharply increases when the boundary meets. Thus t... |
This paper proposes and analyzes stochastic algorithms that apply to solve a specific distributional robust optimization problem. This problem, Eq. (1), is not a general formulation solved by the existing methods. The uncertainty set of Eq. (1) must be a KL-ball, and the KL constraint in Eq. (1) seems to be too deliber... | Recommendation: 5: marginally below the acceptance threshold | Area: Optimization (eg, convex and non-convex optimization) | Review:
This paper proposes and analyzes stochastic algorithms that apply to solve a specific distributional robust optimization problem. This problem, Eq. (1), is not a general formulation solved by the existing methods. The uncertainty set of Eq. (1) must be a KL-ball, and the KL constraint in Eq. (1) seems to be too... |
This paper focuses on the problem of goal conditioned reinforcement learning (GCRL), where the authors propose a new way of sampling goals during the data collection phase. Specifically, the authors propose to sample goals with probability proportional to two factors: the prior distribution of goals and the intermediat... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper focuses on the problem of goal conditioned reinforcement learning (GCRL), where the authors propose a new way of sampling goals during the data collection phase. Specifically, the authors propose to sample goals with probability proportional to two factors: the prior distribution of goals and the int... |
In this paper, the authors address the problem of a multi-attribute shift in Domain Generalization. They extensively and theoretically characterize various realizations of canonical causal graph modeling distribution shifts. They theoretically demonstrate that every such shift would entail a different independence cons... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
In this paper, the authors address the problem of a multi-attribute shift in Domain Generalization. They extensively and theoretically characterize various realizations of canonical causal graph modeling distribution shifts. They theoretically demonstrate that every such shift would entail a different independe... |
This paper focuses on the issues in the neural network-based policy in meta reinforcement learning (RL), such as overfitting \& poor generalization ability, difficult/inefficient to deploy with limited computational resources, and poor interpretability. To address those issues, the framework of Contextual Symbolic Poli... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper focuses on the issues in the neural network-based policy in meta reinforcement learning (RL), such as overfitting \& poor generalization ability, difficult/inefficient to deploy with limited computational resources, and poor interpretability. To address those issues, the framework of Contextual Symbo... |
The authors present a neural network based approach for managing the so called tradeoff between interpretability and accuracy in timeseries data by learning a dictionary of discrete representations. They guarantee that 1) only a small number of patterns that can be visualised easily are learnt 2) training a linear clas... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The authors present a neural network based approach for managing the so called tradeoff between interpretability and accuracy in timeseries data by learning a dictionary of discrete representations. They guarantee that 1) only a small number of patterns that can be visualised easily are learnt 2) training a lin... |
In this work, the authors study the impact of different deep learning networks on the fairness of face recognition algorithms. A Neural Architecture Search is performed, and a wide variety of network architectures (with multiple sets of hyperparameters) are employed for the analysis. The Rank Disparity metric is used f... | Recommendation: 5: marginally below the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
In this work, the authors study the impact of different deep learning networks on the fairness of face recognition algorithms. A Neural Architecture Search is performed, and a wide variety of network architectures (with multiple sets of hyperparameters) are employed for the analysis. The Rank Disparity metric i... |
This paper showcases the use of LLM on solving classical planning problems. A dataset based on PDDL syntax which includes 4 tasks is generated for training and evaluation of the model. The proposed model, Plansformer, is fine-tuned on the generated dataset from pre-trained CodeT5 model. The model is evaluated on each p... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper showcases the use of LLM on solving classical planning problems. A dataset based on PDDL syntax which includes 4 tasks is generated for training and evaluation of the model. The proposed model, Plansformer, is fine-tuned on the generated dataset from pre-trained CodeT5 model. The model is evaluated o... |
In this paper, the authors investigate the problem of temporal causal discovery. Existing work relies on the absence of instantaneous effects with fixed noise distributions, whereas constraint-based methods require stronger faithfulness assumptions. To alleviate this problem, the authors propose Rhino, which combines v... | Recommendation: 6: marginally above the acceptance threshold | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
In this paper, the authors investigate the problem of temporal causal discovery. Existing work relies on the absence of instantaneous effects with fixed noise distributions, whereas constraint-based methods require stronger faithfulness assumptions. To alleviate this problem, the authors propose Rhino, which co... |
The authors want to explore a very interesting question why the prompting learning of large pretrained language models leads to strong performance in a variety of downstream tasks, especially in zero-shot setups? This paper proposed a novel method to identify the evidence of the model’s task-specific competence in prom... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The authors want to explore a very interesting question why the prompting learning of large pretrained language models leads to strong performance in a variety of downstream tasks, especially in zero-shot setups? This paper proposed a novel method to identify the evidence of the model’s task-specific competence... |
This paper studies contrastive self-supervised learning from the view of SNE. The authors show that InfoNCE loss can be seen as a special case of SNE, by setting the data similarity matrix P according to the data augmentation and embedding matrix Q as the softmax of pairwise similarity. Under the SNE framework, new ins... | Recommendation: 8: accept, good paper | Area: Unsupervised and Self-supervised learning | Review:
This paper studies contrastive self-supervised learning from the view of SNE. The authors show that InfoNCE loss can be seen as a special case of SNE, by setting the data similarity matrix P according to the data augmentation and embedding matrix Q as the softmax of pairwise similarity. Under the SNE framework,... |
The paper studies the data-driven low-rank approximation problem on data streams, which has gained attention recently. For a single matrix, some fast algorithms for low-rank approximation are based on sketching, and specifically they choose a sparse sketching matrix with random signs, which is multiplied by the origina... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper studies the data-driven low-rank approximation problem on data streams, which has gained attention recently. For a single matrix, some fast algorithms for low-rank approximation are based on sketching, and specifically they choose a sparse sketching matrix with random signs, which is multiplied by the... |
In this paper, the authors analyze the three different message-passing schemes of Graph Neural Networks conditional on the geometric property, namely weak, strong, and pure methods, and empirically study their effect.
In this paper, the authors analyze the three message-passing schemes of Graph Neural Networks conditio... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
In this paper, the authors analyze the three different message-passing schemes of Graph Neural Networks conditional on the geometric property, namely weak, strong, and pure methods, and empirically study their effect.
In this paper, the authors analyze the three message-passing schemes of Graph Neural Networks ... |
The paper proposes a fragment-based contrastive learning algorithm for learning the discriminative representations of the molecules. They propose to decompose a molecule into two fragments by breaking a single bound (none ring). The bound is chosen such that two fragments have a similar number of atoms. Then the compl... | Recommendation: 5: marginally below the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
The paper proposes a fragment-based contrastive learning algorithm for learning the discriminative representations of the molecules. They propose to decompose a molecule into two fragments by breaking a single bound (none ring). The bound is chosen such that two fragments have a similar number of atoms. Then t... |
This paper studies the targeted attack on time-series forecasting tasks. Specifically, this paper proposes three different targeted attack goals: directional attack, amplitudinal attack, and temporal attack. This paper then designs the corresponding FGSM, PGD, and APGD attacks for these goals. All attacks are evaluated... | Recommendation: 5: marginally below the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This paper studies the targeted attack on time-series forecasting tasks. Specifically, this paper proposes three different targeted attack goals: directional attack, amplitudinal attack, and temporal attack. This paper then designs the corresponding FGSM, PGD, and APGD attacks for these goals. All attacks are e... |
The authors propose a method to model correlations between neurons in large populations which is based on sum-product networks (SPNs). They show that it outperforms two baselines (pairwise maximum entropy models and restricted Boltzmann machines) on a synthetic dataset and the Allen Brain Observatory neuropixels datase... | Recommendation: 8: accept, good paper | Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces) | Review:
The authors propose a method to model correlations between neurons in large populations which is based on sum-product networks (SPNs). They show that it outperforms two baselines (pairwise maximum entropy models and restricted Boltzmann machines) on a synthetic dataset and the Allen Brain Observatory neuropixel... |
This paper deals with safe exploration in reinforcement learning in which an agent is required to ensure safety during training. The authors present a neuro-symbolic approach called SPICE. based on symbolic weakest preconditions. Empirically, they evaluate their approach on toy benchmarks, and show that it is able to a... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper deals with safe exploration in reinforcement learning in which an agent is required to ensure safety during training. The authors present a neuro-symbolic approach called SPICE. based on symbolic weakest preconditions. Empirically, they evaluate their approach on toy benchmarks, and show that it is a... |
The paper presents a neuron-based method to defense against backdoor attacks. They first identify less important neurons in the network and then purify them using a fine-tuning based method. The paper contributes to both the selection of less important neurons and in purifying the network. Compared to the common method... | 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 presents a neuron-based method to defense against backdoor attacks. They first identify less important neurons in the network and then purify them using a fine-tuning based method. The paper contributes to both the selection of less important neurons and in purifying the network. Compared to the commo... |
This work focused on kernelized contextual bandits with distributed computation and asynchronous communication. The author proposed the Async-KernelUCB algorithm with $\tilde O(\sqrt(T))$ regret and only $O(N^2)$ communication complexity. In addition, both the Synthetic and real-world experiments show that Async-Kernel... | Recommendation: 8: accept, good paper | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This work focused on kernelized contextual bandits with distributed computation and asynchronous communication. The author proposed the Async-KernelUCB algorithm with $\tilde O(\sqrt(T))$ regret and only $O(N^2)$ communication complexity. In addition, both the Synthetic and real-world experiments show that Asyn... |
The paper presents an approach for self-supervised training of Transformers based on the idea of masking and predicting. Two objectives have been utilized during the training process. One is patch reconstruction and the other one is named "patch concept classification" to learn different concepts/classes for data token... | Recommendation: 3: reject, not good enough | Area: Unsupervised and Self-supervised learning | Review:
The paper presents an approach for self-supervised training of Transformers based on the idea of masking and predicting. Two objectives have been utilized during the training process. One is patch reconstruction and the other one is named "patch concept classification" to learn different concepts/classes for da... |
This paper presents a deep architecture based on RGB and IMU wearable sensors for multi-modal human activity recognition. The authors propose to encode the IMU sensor series into GAF images and then feed the RGB and GAF images into 2D CNNs for classification. Experiments are conducted on three public datasets.
Strength... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper presents a deep architecture based on RGB and IMU wearable sensors for multi-modal human activity recognition. The authors propose to encode the IMU sensor series into GAF images and then feed the RGB and GAF images into 2D CNNs for classification. Experiments are conducted on three public datasets.
... |
The authors propose feature conformal prediction for semantic feature spaces by leveraging the inductive bias of deep representation learning.
Strength:
The authors aim to improve the original conformal prediction (CP) method by leveraging the idea of semantic feature spaces. The idea is novel and useful. They provide... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The authors propose feature conformal prediction for semantic feature spaces by leveraging the inductive bias of deep representation learning.
Strength:
The authors aim to improve the original conformal prediction (CP) method by leveraging the idea of semantic feature spaces. The idea is novel and useful. They... |
The resilience of complex networks is a critical structural characteristic in network science, measures the network’s ability to withstand noise corruption and structural changes. The authors propose a framework, ResiNet, combining a variant of GNN called FireGNN to model the structural features of networks and reinfor... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The resilience of complex networks is a critical structural characteristic in network science, measures the network’s ability to withstand noise corruption and structural changes. The authors propose a framework, ResiNet, combining a variant of GNN called FireGNN to model the structural features of networks and... |
- This work proposes a Masked Vector Quantization (MVQ) framework to boost per-code capacity, targeting at representing images with shorter sequence or fewer codebook entries.
- In the framework of MVQ, each instance is mapped into three components, including a primary code, a secondary code and a mask. The computa... | Recommendation: 3: reject, not good enough | Area: Generative models | Review:
- This work proposes a Masked Vector Quantization (MVQ) framework to boost per-code capacity, targeting at representing images with shorter sequence or fewer codebook entries.
- In the framework of MVQ, each instance is mapped into three components, including a primary code, a secondary code and a mask. The... |
This paper proposes BAT-Chain, a hierarchical topic model leveraging multi-layer conditional transport (CT) theory to seize topic structures. The proposal is inspired by previous application of CT to the single-layer topic modeling. The authors conduct extensive experiments in both textual and visual settings to showc... | Recommendation: 5: marginally below the acceptance threshold | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
This paper proposes BAT-Chain, a hierarchical topic model leveraging multi-layer conditional transport (CT) theory to seize topic structures. The proposal is inspired by previous application of CT to the single-layer topic modeling. The authors conduct extensive experiments in both textual and visual settings ... |
The paper studies the problem of learning a causal DAG from observational and interventional data. The method follows an active learning approach where the goal is to reduce the number of interventions to learn the underlying DAG. The core contribution of this work is on using the gradient of a given score function wit... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper studies the problem of learning a causal DAG from observational and interventional data. The method follows an active learning approach where the goal is to reduce the number of interventions to learn the underlying DAG. The core contribution of this work is on using the gradient of a given score func... |
This paper uses an SDP relaxation for the problem of computing the Wasserstein gradient. They use numerical algorithms that make their proposed method suitable for practical scenarios involving Bayesian inference.
Strength
======
- The idea of using a convex SDP relaxation of the dual of the variational primal problem... | Recommendation: 5: marginally below the acceptance threshold | Area: Optimization (eg, convex and non-convex optimization) | Review:
This paper uses an SDP relaxation for the problem of computing the Wasserstein gradient. They use numerical algorithms that make their proposed method suitable for practical scenarios involving Bayesian inference.
Strength
======
- The idea of using a convex SDP relaxation of the dual of the variational primal... |
This paper proposes two new pre-training tasks for document image understanding problems such as classification, detection, recognition, and information extraction. The first task, Masked Language Modeling (MLM), to predict the word token for an ROI-Aligned feature map. The second task, Masked Image Modeling, is to rec... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposes two new pre-training tasks for document image understanding problems such as classification, detection, recognition, and information extraction. The first task, Masked Language Modeling (MLM), to predict the word token for an ROI-Aligned feature map. The second task, Masked Image Modeling, i... |
This work examines adaptive client sampling in federated learning. The paper's major contribution is to treat client sampling as an online learning problem and to create an algorithm employing a novel sampler (OSMD) with a nice theoretical guarantee.
Strength
* This study establishes the regret upper bound for the firs... | Recommendation: 6: marginally above the acceptance threshold | Area: Optimization (eg, convex and non-convex optimization) | Review:
This work examines adaptive client sampling in federated learning. The paper's major contribution is to treat client sampling as an online learning problem and to create an algorithm employing a novel sampler (OSMD) with a nice theoretical guarantee.
Strength
* This study establishes the regret upper bound for ... |
The paper presents a framework for generating a dataset of diverse candidate pairs for individual fairness specifications by a set of methods (e.g., an extended word replacement list, unsupervised style transfer, and zero-shot modification using GPT-3). To align with human fairness intuitions for a considered downstrea... | Recommendation: 8: accept, good paper | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
The paper presents a framework for generating a dataset of diverse candidate pairs for individual fairness specifications by a set of methods (e.g., an extended word replacement list, unsupervised style transfer, and zero-shot modification using GPT-3). To align with human fairness intuitions for a considered d... |
This paper proposes a CAPE module which allows any data-driven SciML models to incorporate PDE parameters. The key idea is to transform the input variables $u_k,\lambda$ into an intermediate field data, and make the final prediction based on the original input and the intermediate output.
Strength: The problem cons... | Recommendation: 6: marginally above the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This paper proposes a CAPE module which allows any data-driven SciML models to incorporate PDE parameters. The key idea is to transform the input variables $u_k,\lambda$ into an intermediate field data, and make the final prediction based on the original input and the intermediate output.
Strength: The prob... |
In this paper, the authors research the effects of class-selective neurons in the early learning phase. And the authors design different experiments for the claims, class-selective neurons are important for networks during the early training phase, the early and later layers are similar in the early training phase, and... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
In this paper, the authors research the effects of class-selective neurons in the early learning phase. And the authors design different experiments for the claims, class-selective neurons are important for networks during the early training phase, the early and later layers are similar in the early training ph... |
This paper proposed to apply two existing Transformer-based trackers to class agnostic counting and evaluated their performance on public datasets.
Weaknesses
-The largest concern is the limited contribution. The authors directly apply two existing trackers to fix the counting task with minor changes by extending the... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposed to apply two existing Transformer-based trackers to class agnostic counting and evaluated their performance on public datasets.
Weaknesses
-The largest concern is the limited contribution. The authors directly apply two existing trackers to fix the counting task with minor changes by exten... |
This paper studies the problem of training fair models in federated learning with heterogeneous agents. The authors proposed a new fairness metric which is the maximal difference of excess risks for any pair of agents. The authors then proposed an algorithm which is based on the Expectation-Maximization algorithm, that... | Recommendation: 6: marginally above the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This paper studies the problem of training fair models in federated learning with heterogeneous agents. The authors proposed a new fairness metric which is the maximal difference of excess risks for any pair of agents. The authors then proposed an algorithm which is based on the Expectation-Maximization algorit... |
The authors present a compatibility condition between the data distribution and the algorithm used for regression. This corresponds to a weaker requirement than the benign overfitting studies that simply study the generalization property *at convergence*.
### **Strength**
The authors introduce a framework that can b... | Recommendation: 5: marginally below the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The authors present a compatibility condition between the data distribution and the algorithm used for regression. This corresponds to a weaker requirement than the benign overfitting studies that simply study the generalization property *at convergence*.
### **Strength**
The authors introduce a framework th... |
To alleviate the detection robustness bottleneck in the future work, this paper investigated the robustness of object detectors.
This work proposes two module: Detection Confusion Matrix (DCM) and Classification-Ablative Validation (ClsAVal).
DCM is used to analyze the confusion of detection results between different c... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
To alleviate the detection robustness bottleneck in the future work, this paper investigated the robustness of object detectors.
This work proposes two module: Detection Confusion Matrix (DCM) and Classification-Ablative Validation (ClsAVal).
DCM is used to analyze the confusion of detection results between dif... |
This paper presents a novel strategy to train invertible neural networks that model a distribution, a.k.a. normalizing flows. In particular, the authors propose to use proper metrics as the objective function to train flows. This approach relaxes the requirement of computing the determinant of the Jacobian of the flow ... | Recommendation: 5: marginally below the acceptance threshold | Area: Generative models | Review:
This paper presents a novel strategy to train invertible neural networks that model a distribution, a.k.a. normalizing flows. In particular, the authors propose to use proper metrics as the objective function to train flows. This approach relaxes the requirement of computing the determinant of the Jacobian of t... |
This paper extends the interesting results of [1] on the convergence
of gradient flow for two-layer linear networks to the case of deep
networks, and to a wider variety of loss functions, obtaining
bounds on the rate of convergence in terms of notions of the
``imbalance'' of the initialization of the network. They als... | Recommendation: 3: reject, not good enough | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper extends the interesting results of [1] on the convergence
of gradient flow for two-layer linear networks to the case of deep
networks, and to a wider variety of loss functions, obtaining
bounds on the rate of convergence in terms of notions of the
``imbalance'' of the initialization of the network. ... |
In this paper, the authors investigate the interplay between the training speed/performance of an offline RL method and the total number of environments used during training. A large number of RL papers default to online RL methods, specifically PPO, because of the relative ease of these methods, however, offline metho... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
In this paper, the authors investigate the interplay between the training speed/performance of an offline RL method and the total number of environments used during training. A large number of RL papers default to online RL methods, specifically PPO, because of the relative ease of these methods, however, offli... |
This paper proposes a method to make Rainbow more memory efficient. In particular, it proposes a way to only save data which seems more important using the combination of on-policyness and surprise metrics. Surprise metric is built based on TD-error and on-policyness measures how far behavioral policy is from target po... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper proposes a method to make Rainbow more memory efficient. In particular, it proposes a way to only save data which seems more important using the combination of on-policyness and surprise metrics. Surprise metric is built based on TD-error and on-policyness measures how far behavioral policy is from t... |
This paper investigates how to fine-tune pre-trained vision models with SGD. It particularly focuses on out-of-distribution (OOD) tasks. It is shown that the original SGD leads to poor OOD performance compared with AdamW on ViT architectures. Authors explain the reason as the large gradients on embedding layers, and pr... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper investigates how to fine-tune pre-trained vision models with SGD. It particularly focuses on out-of-distribution (OOD) tasks. It is shown that the original SGD leads to poor OOD performance compared with AdamW on ViT architectures. Authors explain the reason as the large gradients on embedding layers... |
Paper proposes a framework which can use action-free videos (instead of action-tagged videos) to train RL models by a 2-phase pipeline. In phase 1, the approach infers the hidden action embedding from the videos, pre-train the visual representation and the predicted next frames. A vector-quantization step was also intr... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
Paper proposes a framework which can use action-free videos (instead of action-tagged videos) to train RL models by a 2-phase pipeline. In phase 1, the approach infers the hidden action embedding from the videos, pre-train the visual representation and the predicted next frames. A vector-quantization step was a... |
The authors study the problem of estimating treatment effect heterogeneity when the subgroup indicators are unknown (e.g. sick versus healthy). In particular, the researcher knows that treatment effect heterogeneity only depends on the latent subgroup indicators, which are functions of observed covariates, but does not... | Recommendation: 6: marginally above the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
The authors study the problem of estimating treatment effect heterogeneity when the subgroup indicators are unknown (e.g. sick versus healthy). In particular, the researcher knows that treatment effect heterogeneity only depends on the latent subgroup indicators, which are functions of observed covariates, but ... |
This paper proposes the use of contrastive learning to deconfound the observed proxy variable of the confounder and treatment for unbiased continuous treatment effect estimation. In addition, some weighting methods are incorporated for score balancing. The proposed method has been evaluated using synthetic and sem-synt... | Recommendation: 5: marginally below the acceptance threshold | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
This paper proposes the use of contrastive learning to deconfound the observed proxy variable of the confounder and treatment for unbiased continuous treatment effect estimation. In addition, some weighting methods are incorporated for score balancing. The proposed method has been evaluated using synthetic and ... |
This paper studies the weight initialization scales/magnitudes for sufficiently wide and sufficiently deep neural networks. Noticing that an inappropriate initialization magnitude may multiplicatively accumulate via forward and backward propagation through the large number of layers leading to non-trainability of the n... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper studies the weight initialization scales/magnitudes for sufficiently wide and sufficiently deep neural networks. Noticing that an inappropriate initialization magnitude may multiplicatively accumulate via forward and backward propagation through the large number of layers leading to non-trainability ... |
This paper focuses on designing auxiliary tasks that could tend to improve data efficiency by forcing the agent to learn auxiliary prediction and control objectives in addition to the main task. Previous work usually designs auxiliary tasks with human knowledge, which are computationally expensive and challenging to tu... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper focuses on designing auxiliary tasks that could tend to improve data efficiency by forcing the agent to learn auxiliary prediction and control objectives in addition to the main task. Previous work usually designs auxiliary tasks with human knowledge, which are computationally expensive and challengi... |
The paper proposes a new token mixing architecture called Toeplitz Neural Networks (TNN). In particular the attention in the popular transformer architecture is replaced with a Gated Toeplitz Unit which is a GLU but before the scalar multiplication the transformed input is multiplied ("mixed") with a toeplitz matrix. T... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The paper proposes a new token mixing architecture called Toeplitz Neural Networks (TNN). In particular the attention in the popular transformer architecture is replaced with a Gated Toeplitz Unit which is a GLU but before the scalar multiplication the transformed input is multiplied ("mixed") with a toeplitz m... |
This paper proposes a multi-prompt alignment method for multi-source unsupervised domain adaptation. The main idea is to first learn an individual prompt for each source-target domain pair and then mine the relationships among learned prompts through deriving a shared embedding space. The resulting embedding is expecte... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposes a multi-prompt alignment method for multi-source unsupervised domain adaptation. The main idea is to first learn an individual prompt for each source-target domain pair and then mine the relationships among learned prompts through deriving a shared embedding space. The resulting embedding is... |
This paper works on the pretext task learning a subfield of self-supervised learning. It follows the track of predicting the original image given random non-overlapped masks. To make it work on non-transformer architectures, the authors propose to use a hierarchical and sparse convolution network to pre-train the netwo... | Recommendation: 5: marginally below the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
This paper works on the pretext task learning a subfield of self-supervised learning. It follows the track of predicting the original image given random non-overlapped masks. To make it work on non-transformer architectures, the authors propose to use a hierarchical and sparse convolution network to pre-train t... |
This paper provides rigorous analysis of operator learning of PDEs with discontinuities. The main contributions are two-fold. First, author prove that frameworks using linear reconstruction (DeepONet or PCA-Net) fail to efficiently capture the discontinuities by proving the lower bound of the approximation error decay ... | Recommendation: 8: accept, good paper | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper provides rigorous analysis of operator learning of PDEs with discontinuities. The main contributions are two-fold. First, author prove that frameworks using linear reconstruction (DeepONet or PCA-Net) fail to efficiently capture the discontinuities by proving the lower bound of the approximation erro... |
This paper provides two federated learning algorithms that aim to minimize the gap between the average performance of the trained model among clients and the performance on the worst-performing subgroups. The methods are designed to either minimize the variance or semi-variance of the clients' performance; called VRed ... | Recommendation: 6: marginally above the acceptance threshold | Area: General Machine Learning | Review:
This paper provides two federated learning algorithms that aim to minimize the gap between the average performance of the trained model among clients and the performance on the worst-performing subgroups. The methods are designed to either minimize the variance or semi-variance of the clients' performance; call... |
The paper proposes a new bivariate causal inference algorithm called MC-PNL (maximal correlation with independence regularisation). The authors propose to use the randomised dependence coefficient (RDC) instead of HSIC test often used by the causal inference community.
Strengths. The paper is in general well-written.... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper proposes a new bivariate causal inference algorithm called MC-PNL (maximal correlation with independence regularisation). The authors propose to use the randomised dependence coefficient (RDC) instead of HSIC test often used by the causal inference community.
Strengths. The paper is in general well-... |
This paper casts the large language models (LLMs) targeting behavior evaluation as a discrete input-output scoring function so that the targeting input-output behavior examples can be located/generated as a discrete function optimization problem. In particular, this method can be used to locate failure behaviors of LLM... | 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 casts the large language models (LLMs) targeting behavior evaluation as a discrete input-output scoring function so that the targeting input-output behavior examples can be located/generated as a discrete function optimization problem. In particular, this method can be used to locate failure behavior... |
This is an interdisciplinary research paper on AI for science, it proposes a neural network framework based on self-attention mechanism, which can get an Anstazes solving the many-electron Schrodinger equation. The authors scaled the input features and concatenate the numerical spin into the input feature vector. Then ... | Recommendation: 5: marginally below the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This is an interdisciplinary research paper on AI for science, it proposes a neural network framework based on self-attention mechanism, which can get an Anstazes solving the many-electron Schrodinger equation. The authors scaled the input features and concatenate the numerical spin into the input feature vecto... |
In this paper, the authors propose a new Transformer-based RecSys model with learnable attention masks (namely behavior pathway) based on global information of the input to each layer, which limit input queries to only certain tokens. It is claimed that through this routing of attention the model can focus more on beha... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
In this paper, the authors propose a new Transformer-based RecSys model with learnable attention masks (namely behavior pathway) based on global information of the input to each layer, which limit input queries to only certain tokens. It is claimed that through this routing of attention the model can focus more... |
The paper introduces light-weight approaches for debugging differentially private stochastic gradient descent (DP-SGD). The authors first identify the possible bugs which invalidate DP-SGD privacy guarantees (per-example clipping, noise calibration), and then proposes tests that aim to identify the exact problem (no gr... | Recommendation: 3: reject, not good enough | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
The paper introduces light-weight approaches for debugging differentially private stochastic gradient descent (DP-SGD). The authors first identify the possible bugs which invalidate DP-SGD privacy guarantees (per-example clipping, noise calibration), and then proposes tests that aim to identify the exact proble... |
This paper discovers a semantic latent space (termed h-space) for pretrained diffusion models. The proposed h-space is a shift/residual in the middle-layer feature of the UNet, and is discovered via finetuning. The authors propose asymmetric reverse process (Asyrp) for both finetune and sampling. The proposed h-space h... | Recommendation: 6: marginally above the acceptance threshold | Area: Generative models | Review:
This paper discovers a semantic latent space (termed h-space) for pretrained diffusion models. The proposed h-space is a shift/residual in the middle-layer feature of the UNet, and is discovered via finetuning. The authors propose asymmetric reverse process (Asyrp) for both finetune and sampling. The proposed h... |
The paper looks at the use of masked-language models trained on a given set of trajectories to generate action sequences that minimize a specified energy function. If the energy function captures the objectives of a sequential decision-making problem, then the procedure could be utilized to generate the course of actio... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper looks at the use of masked-language models trained on a given set of trajectories to generate action sequences that minimize a specified energy function. If the energy function captures the objectives of a sequential decision-making problem, then the procedure could be utilized to generate the course ... |
This paper proposes an approach to improving the sample efficiency of diffusion models by incorporating high-order derivatives. As high-order derivatives are often expensive to compute, the authors propose an approximation. Empirically, the proposed approach is able to generate images using small number of sampling ste... | Recommendation: 5: marginally below the acceptance threshold | Area: Generative models | Review:
This paper proposes an approach to improving the sample efficiency of diffusion models by incorporating high-order derivatives. As high-order derivatives are often expensive to compute, the authors propose an approximation. Empirically, the proposed approach is able to generate images using small number of samp... |
This work proposes an approach for Chinese word segmentation that is happening in the final prediction layer. First, a binary prediction is performed for each position as a preliminary judgement of word segmentation. Then, the binary decision is transformed as a span-wise decision representing a masking for self-attent... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This work proposes an approach for Chinese word segmentation that is happening in the final prediction layer. First, a binary prediction is performed for each position as a preliminary judgement of word segmentation. Then, the binary decision is transformed as a span-wise decision representing a masking for sel... |
The paper proposes a contrastive learning and adversarial training-based approach to accomplish domain adaptation for time series data. The paper is rooted in strong motivations in healthcare where such a transfer is important for reliable operations. The results are convincing and the ablations are much appreciated.
... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The paper proposes a contrastive learning and adversarial training-based approach to accomplish domain adaptation for time series data. The paper is rooted in strong motivations in healthcare where such a transfer is important for reliable operations. The results are convincing and the ablations are much apprec... |
The paper proposed a debasing approach to better video QA performance that utilizes learnt confounders to discover and fix spurious correlations. The confounders include both data-agnostic item, i.e. a learnable base (Z) and a data-specific item that depends on the video and textual input (Z'). The model jointly learns... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper proposed a debasing approach to better video QA performance that utilizes learnt confounders to discover and fix spurious correlations. The confounders include both data-agnostic item, i.e. a learnable base (Z) and a data-specific item that depends on the video and textual input (Z'). The model jointl... |
The authors propose a new method based on Fast Fourier to compute 3D optimal transport problems.
The authors show great speedups and provide theoretical insights using elliptic PDEs. Applications in sampling and for magnification of volumetric data.
The methods is very fast but needs more memory (storage complexity in... | Recommendation: 8: accept, good paper | Area: General Machine Learning | Review:
The authors propose a new method based on Fast Fourier to compute 3D optimal transport problems.
The authors show great speedups and provide theoretical insights using elliptic PDEs. Applications in sampling and for magnification of volumetric data.
The methods is very fast but needs more memory (storage compl... |
This paper studies the problem of online density estimation and classification of streaming data. A new model named RRNADE (Recurrent Real-valued Neural Autoregressive Density Estimator) is proposed for problem-solving. In RRNADE , a recurrent module is used to maintain a set of sufficient statistics for the future sta... | Recommendation: 3: reject, not good enough | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
This paper studies the problem of online density estimation and classification of streaming data. A new model named RRNADE (Recurrent Real-valued Neural Autoregressive Density Estimator) is proposed for problem-solving. In RRNADE , a recurrent module is used to maintain a set of sufficient statistics for the fu... |
The authors consider the task of approximating human didactic
similarity judgments over N pairs of (images/audio/text). While high
quality human judgments over all pairs is ideal, (N choose 2) is too
big for large N. The authors consider gathering N descriptions of the
objects (tags or captions), extracting text repres... | Recommendation: 8: accept, good paper | Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces) | Review:
The authors consider the task of approximating human didactic
similarity judgments over N pairs of (images/audio/text). While high
quality human judgments over all pairs is ideal, (N choose 2) is too
big for large N. The authors consider gathering N descriptions of the
objects (tags or captions), extracting tex... |
The paper proposes a method they call Gradient Reparamerization which allows them to efficiently add priors to the model without additional training structures other than adding a Gradient Multiplier generated based on tuned hyperparameters. They are able to train models that perform on par or better than recent models... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The paper proposes a method they call Gradient Reparamerization which allows them to efficiently add priors to the model without additional training structures other than adding a Gradient Multiplier generated based on tuned hyperparameters. They are able to train models that perform on par or better than recen... |
This study proposes variants of DLSRank and DLSRank-C by (Chen et al., 2021) that apply random features (RF).
In the experiment, RF speeded them up without reducing prediction performance in the pairwise comparison task.
I place special emphasis on comments with the mark *.
---
Strength:
[1] This is the first study ... | Recommendation: 3: reject, not good enough | Area: General Machine Learning | Review:
This study proposes variants of DLSRank and DLSRank-C by (Chen et al., 2021) that apply random features (RF).
In the experiment, RF speeded them up without reducing prediction performance in the pairwise comparison task.
I place special emphasis on comments with the mark *.
---
Strength:
[1] This is the firs... |
When deploying ML models in the field, it is important to be able to detect when incoming data is an outlier. This can be quite difficult. This paper proposes an approach which learns to generate out-of-distribution data, and uses it to train a classifier. This classifier can then be used in deployment with the origina... | Recommendation: 6: marginally above the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
When deploying ML models in the field, it is important to be able to detect when incoming data is an outlier. This can be quite difficult. This paper proposes an approach which learns to generate out-of-distribution data, and uses it to train a classifier. This classifier can then be used in deployment with the... |
The paper aims to solve the model editing problem via training prefix prompts and using them together with a frozen language model for inference. The proposed approach, SEPROG, is less computationally heady and requires less memory than gradient-based approaches. SEPROG outperforms state-of-the-art methods by 20% on en... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper aims to solve the model editing problem via training prefix prompts and using them together with a frozen language model for inference. The proposed approach, SEPROG, is less computationally heady and requires less memory than gradient-based approaches. SEPROG outperforms state-of-the-art methods by 2... |
This paper focuses on lexicographic multi-objective problems. Firstly, the shortcomings of the existing algorithm Lexicographic Q-Learning (TLQ) are analyzed, and the scenarios in which it is not applicable are pointed out. Secondly, this paper proposes the lexicographic projection algorithm (LPA), which performs multi... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper focuses on lexicographic multi-objective problems. Firstly, the shortcomings of the existing algorithm Lexicographic Q-Learning (TLQ) are analyzed, and the scenarios in which it is not applicable are pointed out. Secondly, this paper proposes the lexicographic projection algorithm (LPA), which perfor... |
Authors proposed a method to extract knowledge graph relations from a pretrained LM through automatic prompt creation and leveraging the pretrained LM to score the candidate entity pairs. Compared to previous works that usually rely on human annotated data or existing massive KGs, the authors' approach requires only th... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
Authors proposed a method to extract knowledge graph relations from a pretrained LM through automatic prompt creation and leveraging the pretrained LM to score the candidate entity pairs. Compared to previous works that usually rely on human annotated data or existing massive KGs, the authors' approach requires... |
The authors talk about the idea of utilizing fairness in reducing the need for personalization. The authors have shown experimentally that the fairness doesn't always help in providing a better starting point for personalization. The authors have proposed a knowledge distillation during FL training to improve the local... | Recommendation: 3: reject, not good enough | Area: Optimization (eg, convex and non-convex optimization) | Review:
The authors talk about the idea of utilizing fairness in reducing the need for personalization. The authors have shown experimentally that the fairness doesn't always help in providing a better starting point for personalization. The authors have proposed a knowledge distillation during FL training to improve t... |
The authors provide a new benchmark for constrained inverse reinforcement learning, including modified mujoco environments, as well as a self-driving-car inspired environment. The authors additionally propose a Bayesian algorithm for solving problems in this class they call Variational Inverse Constrained Reinforcemen... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The authors provide a new benchmark for constrained inverse reinforcement learning, including modified mujoco environments, as well as a self-driving-car inspired environment. The authors additionally propose a Bayesian algorithm for solving problems in this class they call Variational Inverse Constrained Rein... |
The authors investigate the effect of activation noise (additive noise applied after the activation function) on an EBM based classification approach.
They mathematically describe activation noise during training and inference and come to the conclusion that (i) activation noise can be understood as a generalisation of... | Recommendation: 5: marginally below the acceptance threshold | Area: Generative models | Review:
The authors investigate the effect of activation noise (additive noise applied after the activation function) on an EBM based classification approach.
They mathematically describe activation noise during training and inference and come to the conclusion that (i) activation noise can be understood as a generalis... |
Left to their own devices agents will learn equilibrium specific to the coplayer(s) that are encountered throughout their training algorithm. This can be problematic in (semi-)cooperative games where successful equilibrium selection depends on a population of players distinct from those that were featured during traini... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
Left to their own devices agents will learn equilibrium specific to the coplayer(s) that are encountered throughout their training algorithm. This can be problematic in (semi-)cooperative games where successful equilibrium selection depends on a population of players distinct from those that were featured durin... |
The authors point out a previously unknown behaviour of Mixup when overtraining: when the number of training epochs is extremely high, the Mixup performance is inferior to the one of ERM. The authors provide sufficient empirical evidence to show this phenomenon generalizes at least across datasets, and provide an expla... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The authors point out a previously unknown behaviour of Mixup when overtraining: when the number of training epochs is extremely high, the Mixup performance is inferior to the one of ERM. The authors provide sufficient empirical evidence to show this phenomenon generalizes at least across datasets, and provide ... |
The paper proposes a new unsupervised metric for evaluating the disentanglement of generative models (named PIPE), and a new approach for training disentangled variational autoencoder (named DAVA). PIPE evaluates the distinguishability of the distribution of reconstructed samples and the distribution of generated sampl... | Recommendation: 6: marginally above the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
The paper proposes a new unsupervised metric for evaluating the disentanglement of generative models (named PIPE), and a new approach for training disentangled variational autoencoder (named DAVA). PIPE evaluates the distinguishability of the distribution of reconstructed samples and the distribution of generat... |
The authors introduce a deep learning framework to analyze time series (identification of different states, detection of state transition, etc.). The framework presented in the paper is based on an ensemble network composed of LSTMs (each corresponding to a state) and a 1D CNN that allow to choose the best LSTM or stat... | Recommendation: 3: reject, not good enough | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
The authors introduce a deep learning framework to analyze time series (identification of different states, detection of state transition, etc.). The framework presented in the paper is based on an ensemble network composed of LSTMs (each corresponding to a state) and a 1D CNN that allow to choose the best LSTM... |
This paper investigates how to improve decision transformers with prompt and meta-learning. Evaluation on D4RL and MuJoCo benchmark tasks shows that the proposed method outperforms other baselines in some cases.
# Strength
- Improving decision transformers with prompting is natural.
- The proposed prompt mechanism is... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper investigates how to improve decision transformers with prompt and meta-learning. Evaluation on D4RL and MuJoCo benchmark tasks shows that the proposed method outperforms other baselines in some cases.
# Strength
- Improving decision transformers with prompting is natural.
- The proposed prompt mech... |
This paper address the issues in the recent proposed S2ST framework and propose to solve the problems with two different aspect.
First of all, the paper proposes to alleviate the acoustic multimodal problem by using bilateral perturbation.
Obvious improvement is achieved with this method.
Next, the paper proposes to so... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper address the issues in the recent proposed S2ST framework and propose to solve the problems with two different aspect.
First of all, the paper proposes to alleviate the acoustic multimodal problem by using bilateral perturbation.
Obvious improvement is achieved with this method.
Next, the paper propos... |
This paper introduces a learning-based distributed multi-view image coding (LDMIC) method. LDMIC consists of independent encoders and a decoder equipped with a cross-attention mechanism based joint context transfer module. The proposed method does not need synchronization between cameras and is insensitive to the epipo... | Recommendation: 6: marginally above the acceptance threshold | Area: Generative models | Review:
This paper introduces a learning-based distributed multi-view image coding (LDMIC) method. LDMIC consists of independent encoders and a decoder equipped with a cross-attention mechanism based joint context transfer module. The proposed method does not need synchronization between cameras and is insensitive to t... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.