review
stringlengths
5
16.6k
score
stringclasses
5 values
area
stringclasses
12 values
text
stringlengths
31
5.65k
This paper puts forward a method of mutual information estimation within neural networks where the stochasticity of observations is ensured by Gaussian dropout. The authors then use MC methods to estimate entropies and conditional entropies. The proposed approach is compared to MI estimation based on binning and the au...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper puts forward a method of mutual information estimation within neural networks where the stochasticity of observations is ensured by Gaussian dropout. The authors then use MC methods to estimate entropies and conditional entropies. The proposed approach is compared to MI estimation based on binning an...
This paper theoretically studies the generalization of a multi-layer neural network containing a self-attention module (resembling a simplified vision transformer), trained with SGD on a dataset consists of a mixture of label-relevant and irrelevant tokens. This paper is the first to formally study the generalization o...
Recommendation: 6: marginally above the acceptance threshold
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: This paper theoretically studies the generalization of a multi-layer neural network containing a self-attention module (resembling a simplified vision transformer), trained with SGD on a dataset consists of a mixture of label-relevant and irrelevant tokens. This paper is the first to formally study the generali...
The authors propose a technique for improving distributionally robust techniques for individual fairness by generating antidote samples. These adversarial samples are constrained to be on the manifold of the data distribution. The antidote data generator is a generative adversarial network (GAN) model that takes sample...
Recommendation: 5: marginally below the acceptance threshold
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: The authors propose a technique for improving distributionally robust techniques for individual fairness by generating antidote samples. These adversarial samples are constrained to be on the manifold of the data distribution. The antidote data generator is a generative adversarial network (GAN) model that take...
This paper focuses on the ability of large language models (LLMs) and humans to handle ambiguity in task prompts, of the type that are currently popular in the LLM literature. A small suite of six synthetic tasks are created. Each asks the model (or human) to identify whether a sentence contains a particular category ...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper focuses on the ability of large language models (LLMs) and humans to handle ambiguity in task prompts, of the type that are currently popular in the LLM literature. A small suite of six synthetic tasks are created. Each asks the model (or human) to identify whether a sentence contains a particular c...
This paper looks at a new method for adding gaussian noise to nodes during training such that the amount of noise added is a learned parameter. The paper, the does some theoretical analysis, to obtain some heuristics about the effect of the noise. This followed up by empirical work looking at the evolution of the norms...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper looks at a new method for adding gaussian noise to nodes during training such that the amount of noise added is a learned parameter. The paper, the does some theoretical analysis, to obtain some heuristics about the effect of the noise. This followed up by empirical work looking at the evolution of t...
This paper proposes a new secure aggregation protocol P2PRISM for decentralized peer-to-peer learning, against malicious adversaries, in various network topologies. Strength: This paper considers a fairly interesting setting where no centralized trusted server is presented to aggregate the model updates as in federate...
Recommendation: 3: reject, not good enough
Area: General Machine Learning
Review: This paper proposes a new secure aggregation protocol P2PRISM for decentralized peer-to-peer learning, against malicious adversaries, in various network topologies. Strength: This paper considers a fairly interesting setting where no centralized trusted server is presented to aggregate the model updates as in ...
The paper adopts a reinforcement learning framework to estimate the long-term treatment effects in nonstationary environments. The main contributions lies in the development of a practical algorithm to estimate causal effect under nonstationarity. The algorithm is justified via both theoretical results, synthetic envir...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The paper adopts a reinforcement learning framework to estimate the long-term treatment effects in nonstationary environments. The main contributions lies in the development of a practical algorithm to estimate causal effect under nonstationarity. The algorithm is justified via both theoretical results, synthet...
The authors propose DiffSBDD, an approach to structure-based drug design (SBDD) that aims to generate molecules in 3D that are conditioned on a protein binding interface. The approach is E(3)-equivariant and leverages the denoising diffusion probabilistic model (DDPM) formulation inspired by non-equilibrium thermodynam...
Recommendation: 3: reject, not good enough
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: The authors propose DiffSBDD, an approach to structure-based drug design (SBDD) that aims to generate molecules in 3D that are conditioned on a protein binding interface. The approach is E(3)-equivariant and leverages the denoising diffusion probabilistic model (DDPM) formulation inspired by non-equilibrium the...
The authors propose a gradient-weighted visualized explanation technique for object detectors called ODAM. The technique produces instance-specific heat maps indicating the regions that have an impact on the object prediction. It combines attributions from the class and object localization prediction to produce a singl...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: The authors propose a gradient-weighted visualized explanation technique for object detectors called ODAM. The technique produces instance-specific heat maps indicating the regions that have an impact on the object prediction. It combines attributions from the class and object localization prediction to produce...
This paper introduces a latent variable model for both generating and clustering neural activity. In simulated datasets, they study the performance of the model and its ability to recover underlying ensembles in a synthetic and real-world toroid task. Overall, the paper provides an interesting model and a strong set of...
Recommendation: 6: marginally above the acceptance threshold
Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces)
Review: This paper introduces a latent variable model for both generating and clustering neural activity. In simulated datasets, they study the performance of the model and its ability to recover underlying ensembles in a synthetic and real-world toroid task. Overall, the paper provides an interesting model and a stron...
This paper evaluates the performance of deepfake detectors on images generated by five diffusion models (DM) and five GANs. It also analyzes the spectral representation of DM-generated images. (+) The paper is an easy-to-read paper evaluating how well images generated by DM can be detected The paper evaluates the perfo...
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 evaluates the performance of deepfake detectors on images generated by five diffusion models (DM) and five GANs. It also analyzes the spectral representation of DM-generated images. (+) The paper is an easy-to-read paper evaluating how well images generated by DM can be detected The paper evaluates t...
The paper proposes an alternative objective for Reinforcement Learning called ReMax. The authors claim that an agent optimizing this objective naturally develops an exploratory behavior, differently from standard RL, where exploration typically should be enforced, for instance adding an entropy bonus. The main idea con...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The paper proposes an alternative objective for Reinforcement Learning called ReMax. The authors claim that an agent optimizing this objective naturally develops an exploratory behavior, differently from standard RL, where exploration typically should be enforced, for instance adding an entropy bonus. The main ...
The paper introduces a library (open-sourced) called RL4LMs, which is for optimizing generation models using RL. The library is compatible with HuggingFace. Second, the paper comes up with a GRUE (general reinforced-language understanding evaluation) benchmark, which consists of six language generation tasks (under the...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper introduces a library (open-sourced) called RL4LMs, which is for optimizing generation models using RL. The library is compatible with HuggingFace. Second, the paper comes up with a GRUE (general reinforced-language understanding evaluation) benchmark, which consists of six language generation tasks (u...
This paper investigates the problem of building robust models by only enhancing a part of the whole model (subnetwork). The paper is mostly theoretical and propose a new concept of semi-robust. The authors also provide empirical evidences to support their claim. # Strength By only enhancing a part of the whole network,...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper investigates the problem of building robust models by only enhancing a part of the whole model (subnetwork). The paper is mostly theoretical and propose a new concept of semi-robust. The authors also provide empirical evidences to support their claim. # Strength By only enhancing a part of the whole ...
The paper proposes a framework for online knowledge distillation from an intentionally diversified ensemble of teachers. A common hypothesis for the success of distillation from an ensemble is that diverse teacher models increase the efficacy of the ensemble. The paper provides a formal framework to enhance teacher div...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper proposes a framework for online knowledge distillation from an intentionally diversified ensemble of teachers. A common hypothesis for the success of distillation from an ensemble is that diverse teacher models increase the efficacy of the ensemble. The paper provides a formal framework to enhance tea...
The paper proposes a new framework for measuring trustworthiness of a model including new proposed metrics that can evaluate various models comparingly. The framework is applicable to text and image domains and is validated through experiments on datasets from each domain accordingly. The results showed that a model wi...
Recommendation: 5: marginally below the acceptance threshold
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: The paper proposes a new framework for measuring trustworthiness of a model including new proposed metrics that can evaluate various models comparingly. The framework is applicable to text and image domains and is validated through experiments on datasets from each domain accordingly. The results showed that a ...
This work examines whether the secret information that may be contained in the training data set can be extracted from a model which satisfies RDP. This problem is positioned as a problem of intermediate difficulty between the reconstruction and membership attacks. The authors define leakage as the probability that an ...
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 work examines whether the secret information that may be contained in the training data set can be extracted from a model which satisfies RDP. This problem is positioned as a problem of intermediate difficulty between the reconstruction and membership attacks. The authors define leakage as the probability ...
This paper presents a novel problem setting named adversary-aware partial label learning. The authors propose an Adversary-Aware loss function and the immature teacher within momentum (ITWM) disambiguation algorithm to tackle this problem. (+) The proposed new setting is potentially interesting. (+) The experimental r...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: This paper presents a novel problem setting named adversary-aware partial label learning. The authors propose an Adversary-Aware loss function and the immature teacher within momentum (ITWM) disambiguation algorithm to tackle this problem. (+) The proposed new setting is potentially interesting. (+) The experi...
This paper formulates skip connection based models a learnable Markov chain. The paper then introduces the content of an efficient Markov chain which maps data from the input to the target domain efficeintly. A simple regularisation scheme is introduce to enable the learning of efficient Markov chains. Evaluation is pe...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper formulates skip connection based models a learnable Markov chain. The paper then introduces the content of an efficient Markov chain which maps data from the input to the target domain efficeintly. A simple regularisation scheme is introduce to enable the learning of efficient Markov chains. Evaluati...
The paper proposes PETALS, a system that enables inference or finetune processing of large language models (LLM) without the cost of HPC hardware, but rather by sharing a large pool of consumer-grade hardware. PETALS uses pipeline parallelism to partition LLM layers over the geographically distributed devices and propo...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper proposes PETALS, a system that enables inference or finetune processing of large language models (LLM) without the cost of HPC hardware, but rather by sharing a large pool of consumer-grade hardware. PETALS uses pipeline parallelism to partition LLM layers over the geographically distributed devices a...
The paper tackles target-aware small molecule generation. Specifically, small synthetic ligand molecules are generated using a deep generative model, such that the molecules best fit into the binding site of a larger protein. To this end, the paper jointly models the ligand and the protein using a generative diffusion ...
Recommendation: 5: marginally below the acceptance threshold
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: The paper tackles target-aware small molecule generation. Specifically, small synthetic ligand molecules are generated using a deep generative model, such that the molecules best fit into the binding site of a larger protein. To this end, the paper jointly models the ligand and the protein using a generative di...
The paper proposes an approach for boosting the effectiveness of kernelized Ridge regression by first learning a set of random features through a deep-learning inspired preprocessing step, then applying kernelized Ridge regression to the learned features. - **Strength:** While much work has been done on constructing a...
Recommendation: 3: reject, not good enough
Area: Unsupervised and Self-supervised learning
Review: The paper proposes an approach for boosting the effectiveness of kernelized Ridge regression by first learning a set of random features through a deep-learning inspired preprocessing step, then applying kernelized Ridge regression to the learned features. - **Strength:** While much work has been done on constr...
The manuscript proposes to use homotopy optimization between a stabilized version of a neural ODE and the original neural ODE to learn dynamical systems from time series data. The proposed method is tested on three synthetic problems, where it is shown to outperform a naive gradient descent training of the neural ODE. ...
Recommendation: 3: reject, not good enough
Area: Optimization (eg, convex and non-convex optimization)
Review: The manuscript proposes to use homotopy optimization between a stabilized version of a neural ODE and the original neural ODE to learn dynamical systems from time series data. The proposed method is tested on three synthetic problems, where it is shown to outperform a naive gradient descent training of the neur...
This paper explores neural image compression and focuses on improving existing methods in several ways: 1. A single model that allows variable bit rate encodings, variable encode compute, and faster run time. Although previous research has explored these items in isolation, I do not know of a model that incorporates a...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper explores neural image compression and focuses on improving existing methods in several ways: 1. A single model that allows variable bit rate encodings, variable encode compute, and faster run time. Although previous research has explored these items in isolation, I do not know of a model that incorp...
The paper analyses the solution to the multi-agent adversarial RL (MaARL) problem via mean-field optimal control viewpoint. The authors characterizes the solution using the two-sided extremism principle (TSEP) and HJI equation then provides a connection between them. At the end, the authors provide a generalization bou...
Recommendation: 3: reject, not good enough
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The paper analyses the solution to the multi-agent adversarial RL (MaARL) problem via mean-field optimal control viewpoint. The authors characterizes the solution using the two-sided extremism principle (TSEP) and HJI equation then provides a connection between them. At the end, the authors provide a generaliza...
The authors propose a technique to prioritize which samples to select next in an active learning setting for node attribute completion in graphs. The proposed method uses metrics related to the "density" of a data point as well as its centrality in the graph. The proposed approach is used as input to SAT, a previously-...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: The authors propose a technique to prioritize which samples to select next in an active learning setting for node attribute completion in graphs. The proposed method uses metrics related to the "density" of a data point as well as its centrality in the graph. The proposed approach is used as input to SAT, a pre...
This paper studies the convergence behavior of SGD. Specifically, it says that there is a way to project the learning process onto a set of orthogonal basis functions so that the leading coefficients in the basis functions exhibit 'smoothly' convergence behavior. While not explicitly stated in the paper, I think that i...
Recommendation: 6: marginally above the acceptance threshold
Area: Optimization (eg, convex and non-convex optimization)
Review: This paper studies the convergence behavior of SGD. Specifically, it says that there is a way to project the learning process onto a set of orthogonal basis functions so that the leading coefficients in the basis functions exhibit 'smoothly' convergence behavior. While not explicitly stated in the paper, I thin...
This work proposes a new method to produce robust models by data augmentations that corrupt semantic information. Semantic corruptions power nuisance-avoiding methods to build robust models against spurious correlations without requiring extra annotations or strong assumptions. This paper analyzes semantic corruptions ...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This work proposes a new method to produce robust models by data augmentations that corrupt semantic information. Semantic corruptions power nuisance-avoiding methods to build robust models against spurious correlations without requiring extra annotations or strong assumptions. This paper analyzes semantic corr...
This work solves personalized federated learning (PFL) setting by developing feature alignment mechanism and classifier collaboration. Concretely, this feature alignment minimizes the distance between local feature representations and global centroids. And classifier collaboration utilizes linear combination of multipl...
Recommendation: 5: marginally below the acceptance threshold
Area: General Machine Learning
Review: This work solves personalized federated learning (PFL) setting by developing feature alignment mechanism and classifier collaboration. Concretely, this feature alignment minimizes the distance between local feature representations and global centroids. And classifier collaboration utilizes linear combination of...
The work studies the robustness of dynamic neural networks (DyNNs) from four perspectives: 1) comparison of the black-box robustness between static and DyNNs; 2) The inference time of adversarial samples in DyNNs; 3) Dynamic mechanisms with the best robustness; 4) synthesize samples to reduce the effectiveness of DyNNs...
Recommendation: 3: reject, not good enough
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: The work studies the robustness of dynamic neural networks (DyNNs) from four perspectives: 1) comparison of the black-box robustness between static and DyNNs; 2) The inference time of adversarial samples in DyNNs; 3) Dynamic mechanisms with the best robustness; 4) synthesize samples to reduce the effectiveness ...
The paper presents an algorithm to learn shortest-path (SP) representation of nodes in a graph. Existing strategies to learn SP are based on random-walks that, based on the structure of the graph, have limitations in terms of performance as well as distance preservation. The authors propose a method called Between Cent...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: The paper presents an algorithm to learn shortest-path (SP) representation of nodes in a graph. Existing strategies to learn SP are based on random-walks that, based on the structure of the graph, have limitations in terms of performance as well as distance preservation. The authors propose a method called Betw...
The paper tackles the problem of estimating the effect of continuous and multi-dimensional treatments in the setting with unobserved confounders. The paper assumes access to high dimensional proxy variables for the unobserved confounders and proposes a Contrastive regulariser which learns a proxy representation for the...
Recommendation: 5: marginally below the acceptance threshold
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: The paper tackles the problem of estimating the effect of continuous and multi-dimensional treatments in the setting with unobserved confounders. The paper assumes access to high dimensional proxy variables for the unobserved confounders and proposes a Contrastive regulariser which learns a proxy representation...
This paper proposes a framework inspired by Laurentzian audacity theory like learn directed graph representation. This framework is evaluted in different tasks and show how this framework can represent graphs with directed cycles. Strength - The experiments results show the superiority of the proposed spacetime graph....
Recommendation: 6: marginally above the acceptance threshold
Area: General Machine Learning
Review: This paper proposes a framework inspired by Laurentzian audacity theory like learn directed graph representation. This framework is evaluted in different tasks and show how this framework can represent graphs with directed cycles. Strength - The experiments results show the superiority of the proposed spacetim...
The paper investigates contrastive learning in the context of building sentence representations. It finds that the decoupled form that decomposes the contrastive loss into aligment and uniformity components can have a detrimental effect in this setting, due to different training dynamics compared to the InfoNCE loss. T...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper investigates contrastive learning in the context of building sentence representations. It finds that the decoupled form that decomposes the contrastive loss into aligment and uniformity components can have a detrimental effect in this setting, due to different training dynamics compared to the InfoNCE...
This paper presents a framework for protein thermostability prediction. A large-scale protein dataset with organism-level temperature annotations is curated, and one pretraining and one tuning module are proposed for prediction. The main contributions are: 1. A dataset of protein sequences and folded 3D structures data...
Recommendation: 5: marginally below the acceptance threshold
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: This paper presents a framework for protein thermostability prediction. A large-scale protein dataset with organism-level temperature annotations is curated, and one pretraining and one tuning module are proposed for prediction. The main contributions are: 1. A dataset of protein sequences and folded 3D structu...
This paper seeks to approximate a given high-dimensional manifold with a product of some smaller, simpler manifolds. It learns this approximate mapping using neural network based optimization. The paper motivates this approach by discussing the concept of PGA (which is essentially Tangent PCA as stated here) and a spar...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: This paper seeks to approximate a given high-dimensional manifold with a product of some smaller, simpler manifolds. It learns this approximate mapping using neural network based optimization. The paper motivates this approach by discussing the concept of PGA (which is essentially Tangent PCA as stated here) an...
The paper proposes a scalable estimation method for non-parametric Markov network structures, using regularized score matching. They first introduce necessary and sufficient conditions of conditional independence between variables in general distributions for all data types (i.e., continuous, discrete, and mixed-type)...
Recommendation: 6: marginally above the acceptance threshold
Area: General Machine Learning
Review: The paper proposes a scalable estimation method for non-parametric Markov network structures, using regularized score matching. They first introduce necessary and sufficient conditions of conditional independence between variables in general distributions for all data types (i.e., continuous, discrete, and mix...
The paper presents a method for formulating particular multivariate functions based on indices as a particular tensor train decomposition. An overview of the construction is presented, where so-called derivative functions are used to define index dependences as well as the cores of the TT representation. Analysis of th...
Recommendation: 6: marginally above the acceptance threshold
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: The paper presents a method for formulating particular multivariate functions based on indices as a particular tensor train decomposition. An overview of the construction is presented, where so-called derivative functions are used to define index dependences as well as the cores of the TT representation. Analys...
This paper provides theoretical results on the formal verifiability of message passing neural networks (MPNNs), a popular class of graph neural network models, for graph and node classification tasks. In particular, it proves that, without assuming a bound on the degree of the graph, the formal verification of output ...
Recommendation: 8: accept, good paper
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: This paper provides theoretical results on the formal verifiability of message passing neural networks (MPNNs), a popular class of graph neural network models, for graph and node classification tasks. In particular, it proves that, without assuming a bound on the degree of the graph, the formal verification of...
This paper proposes a self-supervised or pretrained method for molecular representation learning. It can be summarized as follows, #### 1. A Transformer-based backbone. #### 2. Two self-supervised learning or pretraining tasks: 3D position recovery and masked atom prediction. #### 3. A few finetuning strategies are ...
Recommendation: 5: marginally below the acceptance threshold
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: This paper proposes a self-supervised or pretrained method for molecular representation learning. It can be summarized as follows, #### 1. A Transformer-based backbone. #### 2. Two self-supervised learning or pretraining tasks: 3D position recovery and masked atom prediction. #### 3. A few finetuning strateg...
Summary. This paper is dedicated to investigating knowledge distillation. The authors argue that the vanilla learning objective of knowledge distillation is sub-optimal since there exists a discrepancy between the teacher's output distribution and the ground truth label distribution. Therefore, they introduce the PTLo...
Recommendation: 3: reject, not good enough
Area: General Machine Learning
Review: Summary. This paper is dedicated to investigating knowledge distillation. The authors argue that the vanilla learning objective of knowledge distillation is sub-optimal since there exists a discrepancy between the teacher's output distribution and the ground truth label distribution. Therefore, they introduce ...
In this paper authors propose a mechanism for deriving low-dimensional representations suitable for effective use of established non-parametric and parametric out-of-distribution data detection methods. Specifically they utilize graphs which represent relationships among the objects detected in an image. They claim tha...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: In this paper authors propose a mechanism for deriving low-dimensional representations suitable for effective use of established non-parametric and parametric out-of-distribution data detection methods. Specifically they utilize graphs which represent relationships among the objects detected in an image. They c...
This paper studies MARL problems and proposes the Heterogeneous-Agent Mirror Learning (HAML) framework that enjoys monotonic improvement of the joint reward and convergence to NE. They show that HAML includes HATRPO and HAPPO as special instances. They provide HAML extensions of A2C and DDPG and show their effectivenes...
Recommendation: 8: accept, good paper
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper studies MARL problems and proposes the Heterogeneous-Agent Mirror Learning (HAML) framework that enjoys monotonic improvement of the joint reward and convergence to NE. They show that HAML includes HATRPO and HAPPO as special instances. They provide HAML extensions of A2C and DDPG and show their effe...
To solve the distribution shift problem in offline reinforcement learning of conservative methods, the paper let value functions learn on different degrees of conservatism (optimism/pessimism) instead of a fixed degree of conservatism. The paper proposes an algorithm, called CCVL, to achieve its goal in discrete-action...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: To solve the distribution shift problem in offline reinforcement learning of conservative methods, the paper let value functions learn on different degrees of conservatism (optimism/pessimism) instead of a fixed degree of conservatism. The paper proposes an algorithm, called CCVL, to achieve its goal in discret...
The paper considers a scenario in which there are M sequences of events, and each sequence consists of K event types. The FullyNN based neural point process model (Omi 2019) demonstrates useful but needs to model each event type with a separate cumulative conditional intensity, which could be computationally demanding!...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper considers a scenario in which there are M sequences of events, and each sequence consists of K event types. The FullyNN based neural point process model (Omi 2019) demonstrates useful but needs to model each event type with a separate cumulative conditional intensity, which could be computationally de...
This paper studies how to adapt a black box to the testing distribution in an online fashion under the label shift condition. The main contributions are to propose several heuristics to improve the algorithm proposed by Wu et al., (2021) when the label-shift assumption is broken, or the confusion matrix is non-invertib...
Recommendation: 3: reject, not good enough
Area: General Machine Learning
Review: This paper studies how to adapt a black box to the testing distribution in an online fashion under the label shift condition. The main contributions are to propose several heuristics to improve the algorithm proposed by Wu et al., (2021) when the label-shift assumption is broken, or the confusion matrix is non-...
The paper studies various types of misclassification of images by deep neural networks. The study is done using a quantity called "interaction" between pixels. This quantity is motivated from game theoretic concept of quantifying interaction between players in a co-operative game. This quantity has been used in other...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper studies various types of misclassification of images by deep neural networks. The study is done using a quantity called "interaction" between pixels. This quantity is motivated from game theoretic concept of quantifying interaction between players in a co-operative game. This quantity has been used ...
This paper shows how induced matchings guarantee the spatially correct matching between barcodes in a segmentation setting. Furthermore, this paper proposes an efficient algorithm to compute TopoMatch for images. Also this paper shows that TopoMatch is an interpretable metric to evaluate the topological correctness of ...
Recommendation: 6: marginally above the acceptance threshold
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: This paper shows how induced matchings guarantee the spatially correct matching between barcodes in a segmentation setting. Furthermore, this paper proposes an efficient algorithm to compute TopoMatch for images. Also this paper shows that TopoMatch is an interpretable metric to evaluate the topological correct...
The authors propose a single-pass contrastive learning method for graph data, without the need of graph augmentation or encoder perturbation to generate contrastive samples. In particular, they select the positive samples based on the inner-product of the hidden representation for each central node. The method is quite...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: The authors propose a single-pass contrastive learning method for graph data, without the need of graph augmentation or encoder perturbation to generate contrastive samples. In particular, they select the positive samples based on the inner-product of the hidden representation for each central node. The method ...
The authors present a new environment for supporting RL research, especially for more physics-oriented tasks. In the environment, each "pixel" may be occupied by a certain type of material, and the material properties and environmental forces define how the update should be updated to the next state, and can be accomp...
Recommendation: 8: accept, good paper
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The authors present a new environment for supporting RL research, especially for more physics-oriented tasks. In the environment, each "pixel" may be occupied by a certain type of material, and the material properties and environmental forces define how the update should be updated to the next state, and can b...
The paper explores how attention may impact language emergence in two instances of the Lewis Game setting. The authors observe that transformers seem to introduce an inductive bias toward compositionality. They then look at the alignment between concepts and attention weights. First of all, the authors point out a rel...
Recommendation: 3: reject, not good enough
Area: General Machine Learning
Review: The paper explores how attention may impact language emergence in two instances of the Lewis Game setting. The authors observe that transformers seem to introduce an inductive bias toward compositionality. They then look at the alignment between concepts and attention weights. First of all, the authors point o...
CLIPSep demonstrates how a pretrained CLIP model can be used to train a source separation model using unlabeled videos and achieve competitive results in some settings. Strengths: - This model shows a path toward training a sound separation model that is text queryable for arbitrary sources and can be trained on unlab...
Recommendation: 8: accept, good paper
Area: Applications (eg, speech processing, computer vision, NLP)
Review: CLIPSep demonstrates how a pretrained CLIP model can be used to train a source separation model using unlabeled videos and achieve competitive results in some settings. Strengths: - This model shows a path toward training a sound separation model that is text queryable for arbitrary sources and can be trained ...
This paper presents a new method for multi-agent trajectory forecasting. Unlike existing methods that just encode inter-agent interactions, the proposed method additionally learns to predict the priority of agents that explains the dependency between agents regarding their future trajectories (i.e., future trajectories...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper presents a new method for multi-agent trajectory forecasting. Unlike existing methods that just encode inter-agent interactions, the proposed method additionally learns to predict the priority of agents that explains the dependency between agents regarding their future trajectories (i.e., future traj...
The authors present a neural network called contextual convolutional network, which adds classification layers at multiple stages and uses the top (most probable) class embeddings in following stages. The proposed layers / blocks are added to ConvNeXt models and tested on several mainstream / large-scale datasets (Imag...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The authors present a neural network called contextual convolutional network, which adds classification layers at multiple stages and uses the top (most probable) class embeddings in following stages. The proposed layers / blocks are added to ConvNeXt models and tested on several mainstream / large-scale datase...
Training neural networks on large-scale real-world datasets typically involve gradient-based updates of deep networks. Therefore, understanding the learning dynamics of these models is critical from the perspective of interpretability, as well as designing better architectures/training algorithms. In this work, the aut...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: Training neural networks on large-scale real-world datasets typically involve gradient-based updates of deep networks. Therefore, understanding the learning dynamics of these models is critical from the perspective of interpretability, as well as designing better architectures/training algorithms. In this work,...
This paper proposes a new method in the area of Positive-Congruent Training, by distilling a homogeneous ensemble to a single student model. The authors carefully analyze the properties of logic displacement magnitude in ensembles, and present a method called Ensemble Logit Difference Inhibition (ELODI). The proposed a...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper proposes a new method in the area of Positive-Congruent Training, by distilling a homogeneous ensemble to a single student model. The authors carefully analyze the properties of logic displacement magnitude in ensembles, and present a method called Ensemble Logit Difference Inhibition (ELODI). The pr...
The paper proposes to refine orthogonal bases, as commonly used for "proper orthogonal decomposition" (POD) algorithms with a stochastic, data driven optimization. The paper focuses on a class of reversible, circulation-based flow descriptions. The improvements in terms of reconstruction errors of the optimized basis a...
Recommendation: 3: reject, not good enough
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: The paper proposes to refine orthogonal bases, as commonly used for "proper orthogonal decomposition" (POD) algorithms with a stochastic, data driven optimization. The paper focuses on a class of reversible, circulation-based flow descriptions. The improvements in terms of reconstruction errors of the optimized...
The paper proposes a novel framework for compression-aware training of neural networks. The proposed method uses norm constraints, for two types of pruning (1) convolutional filter pruning (2) low-rank matrix decomposition, expressed via updates of the Stochastic Frank-Wolfe (SFW) algorithm efficiently. Pros: - The p...
Recommendation: 8: accept, good paper
Area: Optimization (eg, convex and non-convex optimization)
Review: The paper proposes a novel framework for compression-aware training of neural networks. The proposed method uses norm constraints, for two types of pruning (1) convolutional filter pruning (2) low-rank matrix decomposition, expressed via updates of the Stochastic Frank-Wolfe (SFW) algorithm efficiently. Pros: ...
In this paper, the authors introduce a KFIoU loss for rotated object detection. The general idea of KFIoU loss is to approximate the SkewIoU based on Gaussian Modeling and Kalman filter. Particularly, a bounding box is firstly represented as a Gaussian distribution form. Then (1) a scale-insensitive center point loss ...
Recommendation: 8: accept, good paper
Area: Applications (eg, speech processing, computer vision, NLP)
Review: In this paper, the authors introduce a KFIoU loss for rotated object detection. The general idea of KFIoU loss is to approximate the SkewIoU based on Gaussian Modeling and Kalman filter. Particularly, a bounding box is firstly represented as a Gaussian distribution form. Then (1) a scale-insensitive center poi...
The authors list 5 technical contributions: 1. the structural causal explanations algorithm - "a new algorithm (SCE) for computing explanations from SCM making them truly causal explanations by construction" 2. an illustration of "how SCE fixes several of the shortcomings of previous explainers" 3. an application of "S...
Recommendation: 3: reject, not good enough
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: The authors list 5 technical contributions: 1. the structural causal explanations algorithm - "a new algorithm (SCE) for computing explanations from SCM making them truly causal explanations by construction" 2. an illustration of "how SCE fixes several of the shortcomings of previous explainers" 3. an applicati...
The authors propose an algorithm to leverage LLM's rational through prompt, to improve final downstream models' performance by taking the computation into account. Specifically, to save human efforts, the authors propose to use LLM to generate rationals. It then train a QA model based by giving the generated rationals....
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The authors propose an algorithm to leverage LLM's rational through prompt, to improve final downstream models' performance by taking the computation into account. Specifically, to save human efforts, the authors propose to use LLM to generate rationals. It then train a QA model based by giving the generated ra...
This paper aims to learn slimmable neural networks with contrastive self-supervised learning without labels. To further improve the performance of sub-networks, this paper suggests using (i) slow-start training for sub-networks, (ii) online distillation, and (iii) loss reweighting. This increases the gradient norm of t...
Recommendation: 3: reject, not good enough
Area: Unsupervised and Self-supervised learning
Review: This paper aims to learn slimmable neural networks with contrastive self-supervised learning without labels. To further improve the performance of sub-networks, this paper suggests using (i) slow-start training for sub-networks, (ii) online distillation, and (iii) loss reweighting. This increases the gradient n...
The authors consider a restless bandit problem where the states are unobserved. The authors propose algorithm Thompson Sampling with an Episodic Explore-Then-Commit (TSEETC). In the exploration phase, the algorithm uses a bayesian approach, based on mixtures of Dirichelet priors to update the unkown parameters and beli...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The authors consider a restless bandit problem where the states are unobserved. The authors propose algorithm Thompson Sampling with an Episodic Explore-Then-Commit (TSEETC). In the exploration phase, the algorithm uses a bayesian approach, based on mixtures of Dirichelet priors to update the unkown parameters ...
## Summary The paper presents SeqComm, a multi-agent communication scheme allowing agents to condition on one another's actions by imposing ordering over the agents. The paper introduces multi-agent sequential decision and demonstrates that ordering in this paradigm can affect the optimality of the learnt policy. The...
Recommendation: 5: marginally below the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: ## Summary The paper presents SeqComm, a multi-agent communication scheme allowing agents to condition on one another's actions by imposing ordering over the agents. The paper introduces multi-agent sequential decision and demonstrates that ordering in this paradigm can affect the optimality of the learnt polic...
The work proposes quantization methods for low bit training of GNNs. Pro: The paper claims to improve training speed by using dynamic quantization. Con: The solution is complex, which limits its applicability. And technical novelty is rather limited. The paper is not ready for publication. Additional works are nee...
Recommendation: 3: reject, not good enough
Area: Deep Learning and representational learning
Review: The work proposes quantization methods for low bit training of GNNs. Pro: The paper claims to improve training speed by using dynamic quantization. Con: The solution is complex, which limits its applicability. And technical novelty is rather limited. The paper is not ready for publication. Additional works...
In this paper, the authors propose three different methods to improve the framework of DETR: a contrastive way for centre-surrounding, twice forward prediction for refining results and a mixed query selection. The experiments demonstrate the necessity of these methods and significant improvement in classical benchmarks...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: In this paper, the authors propose three different methods to improve the framework of DETR: a contrastive way for centre-surrounding, twice forward prediction for refining results and a mixed query selection. The experiments demonstrate the necessity of these methods and significant improvement in classical be...
The paper shows that a standard CNP (trained with the diagonal covariance assumption) can be used, at test time, to sample target values capturing their non-diagonal covariance structure. This is done by sampling one target point at a time from the CNP and feeding that predicted target point back into the context set o...
Recommendation: 6: marginally above the acceptance threshold
Area: General Machine Learning
Review: The paper shows that a standard CNP (trained with the diagonal covariance assumption) can be used, at test time, to sample target values capturing their non-diagonal covariance structure. This is done by sampling one target point at a time from the CNP and feeding that predicted target point back into the conte...
The submission presents conceptual SCAN (cSCAN) as an instance of a conceptual learning task (CLT). CLTs, as defined in the manuscript, are tasks that contain a combination of examples and rules. Concretely, each example is defined as a tuple including a context, where the context is a set of rules and examples (potent...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The submission presents conceptual SCAN (cSCAN) as an instance of a conceptual learning task (CLT). CLTs, as defined in the manuscript, are tasks that contain a combination of examples and rules. Concretely, each example is defined as a tuple including a context, where the context is a set of rules and examples...
The paper proposes a data augmentation technique to improve the performance of the existing state-of-the-art methods in the incremental few-shot semantic segmentation setting. The proposed technique, called GAPS, augments the few-shot samples by pasting the new classes' pixels onto a subset of exemplar images coming f...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper proposes a data augmentation technique to improve the performance of the existing state-of-the-art methods in the incremental few-shot semantic segmentation setting. The proposed technique, called GAPS, augments the few-shot samples by pasting the new classes' pixels onto a subset of exemplar images ...
The authors propose a new mechanism, called *gradient-guided parity alignment* to ensure fairness in neural models. This is done by studying the fairness problem from the perspective of decision rationale, which has been one of the mainstream areas of focus in interpretability literature. The authors implement their pr...
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 authors propose a new mechanism, called *gradient-guided parity alignment* to ensure fairness in neural models. This is done by studying the fairness problem from the perspective of decision rationale, which has been one of the mainstream areas of focus in interpretability literature. The authors implement ...
In games of imperfect information, players' payoffs are known, but actions may not be. An example would be a two player simultaneous move game, whose game tree depicts one player as moving second, but unable to distinguish between the nodes reachable from each of the other player's actions. As imperfect information c...
Recommendation: 5: marginally below the acceptance threshold
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: In games of imperfect information, players' payoffs are known, but actions may not be. An example would be a two player simultaneous move game, whose game tree depicts one player as moving second, but unable to distinguish between the nodes reachable from each of the other player's actions. As imperfect infor...
This paper investigates the behavior of disentangled representation learning in VAEs. Especially, the authors utilizes Centred Kernel Alignment to compare the internal behavior of VAEs. Procrustes score is mentioned in the main paper, but the authors did not utilize it due to its limitation on the computational complex...
Recommendation: 5: marginally below the acceptance threshold
Area: Generative models
Review: This paper investigates the behavior of disentangled representation learning in VAEs. Especially, the authors utilizes Centred Kernel Alignment to compare the internal behavior of VAEs. Procrustes score is mentioned in the main paper, but the authors did not utilize it due to its limitation on the computational...
The paper proposes a norm-bounded graph attention network (GAT) for multivariate time series forecasting. The norm of the weight matrix in the proposed model is bounded to ensure the generalization error bound, the paper proves this theoretically. The experimental section in the paper shows that the generalization perf...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper proposes a norm-bounded graph attention network (GAT) for multivariate time series forecasting. The norm of the weight matrix in the proposed model is bounded to ensure the generalization error bound, the paper proves this theoretically. The experimental section in the paper shows that the generalizat...
The paper deals with offline RL. It takes the position that iterated policy evaluation can be given so little trust that behavior cloning is preferable. It makes the assumption that it is useful to decompose the data set into episodes and (assuming that different policies were active in different episodes) to create in...
Recommendation: 6: marginally above the acceptance threshold
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: The paper deals with offline RL. It takes the position that iterated policy evaluation can be given so little trust that behavior cloning is preferable. It makes the assumption that it is useful to decompose the data set into episodes and (assuming that different policies were active in different episodes) to c...
In this work, the authors concentrate on variants of the fair classification problem. They unify some of the most popular fairness notions in a general representation framework by defining a quantity whose magnitude reveals (dis-)advantage to specific groups. By using the aforementioned quantity, they represent the fai...
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 concentrate on variants of the fair classification problem. They unify some of the most popular fairness notions in a general representation framework by defining a quantity whose magnitude reveals (dis-)advantage to specific groups. By using the aforementioned quantity, they represent...
This paper studies the impact of the choice of colored noise in popular off-policy RL algorithms, TD3, SAC and MPO. They find that pink noise—an intermediary form of colored noise between totally, temporally uncorrelated white noise and temporally-correlated red noise (Brownian motion)—consistently results in the best ...
Recommendation: 8: accept, good paper
Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics)
Review: This paper studies the impact of the choice of colored noise in popular off-policy RL algorithms, TD3, SAC and MPO. They find that pink noise—an intermediary form of colored noise between totally, temporally uncorrelated white noise and temporally-correlated red noise (Brownian motion)—consistently results in t...
This paper proposed NGF, which uses clean data to remove the backdoor from a model. The proposed method works by fine-tuning the last layer of the model such that the false local minima are smoothed out and the effect of removing the backdoor from the model is achieved. Finally, this paper gives very extensive and com...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper proposed NGF, which uses clean data to remove the backdoor from a model. The proposed method works by fine-tuning the last layer of the model such that the false local minima are smoothed out and the effect of removing the backdoor from the model is achieved. Finally, this paper gives very extensive...
Please refer to Summary Of The Review. Please refer to Summary Of The Review. This paper applies the deep neural networks technology to clustering and establishes a novel clustering model which is dubbed CoHiClust. In this model, a contrastive learning method is employed to create the base network (i.e. a binary tree)....
Recommendation: 5: marginally below the acceptance threshold
Area: Unsupervised and Self-supervised learning
Review: Please refer to Summary Of The Review. Please refer to Summary Of The Review. This paper applies the deep neural networks technology to clustering and establishes a novel clustering model which is dubbed CoHiClust. In this model, a contrastive learning method is employed to create the base network (i.e. a binar...
The task this paper targeted is to train a model purely on a synthetic dataset without a clean oracle validation set. The paper proposed a bi-level algorithm where the coarse level uses a noise-robust loss optimizing re-weighting each data sample, and the fine level trains a model under the given weighted data sample d...
Recommendation: 8: accept, good paper
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The task this paper targeted is to train a model purely on a synthetic dataset without a clean oracle validation set. The paper proposed a bi-level algorithm where the coarse level uses a noise-robust loss optimizing re-weighting each data sample, and the fine level trains a model under the given weighted data ...
The paper proposes a novel approach towards improving the explainability of vision transformers. Specifically, the paper proposes updating each component in the model using the B-cos transform, which is designed to increase the alignment of the inputs and the weights. The paper builds on a previous state-of-the-art wor...
Recommendation: 6: marginally above the acceptance threshold
Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics)
Review: The paper proposes a novel approach towards improving the explainability of vision transformers. Specifically, the paper proposes updating each component in the model using the B-cos transform, which is designed to increase the alignment of the inputs and the weights. The paper builds on a previous state-of-the...
Transformers are complex and require several compute-intensive operations. This paper proposes to simplify the execution of the BERT inference by using matrix arithmetic-only operations. The results show that the proposed method achieves considerable inference time reduction with relatively low accuracy loss compared t...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: Transformers are complex and require several compute-intensive operations. This paper proposes to simplify the execution of the BERT inference by using matrix arithmetic-only operations. The results show that the proposed method achieves considerable inference time reduction with relatively low accuracy loss co...
The work proposes an algorithm, Cost-Optimized Local Search (COLS) to optimize the objective Expected Minimum Cost (EMC) [proxy to the original cost matrix of a user] to come up with a recourse set (actionable and feasible requests) personalized to the preferences of a user. Strengths : The problem statement was well ...
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 work proposes an algorithm, Cost-Optimized Local Search (COLS) to optimize the objective Expected Minimum Cost (EMC) [proxy to the original cost matrix of a user] to come up with a recourse set (actionable and feasible requests) personalized to the preferences of a user. Strengths : The problem statement w...
The authors construct a PAC-Bayes bound that is insensitive to the fact that some parameters of neural nets can be arbitrarily rescaled due to normalization layers rectifying such rescalings. In a second step, they design a variant of the Laplacian approximation and evaluate both on a series of experiments. ## Strengt...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The authors construct a PAC-Bayes bound that is insensitive to the fact that some parameters of neural nets can be arbitrarily rescaled due to normalization layers rectifying such rescalings. In a second step, they design a variant of the Laplacian approximation and evaluate both on a series of experiments. ##...
The author(s) proposed an preconditioned gradient descent algorithm for kernel networks. The algorithm is built on EigenPro 2.0. Experiments on real-world datasets are conducted to evaluate the proposed EigenPro 3.0. Strengths: - The paper is well-written and well-motivated; - The analysis is quite thorough and easy to...
Recommendation: 5: marginally below the acceptance threshold
Area: General Machine Learning
Review: The author(s) proposed an preconditioned gradient descent algorithm for kernel networks. The algorithm is built on EigenPro 2.0. Experiments on real-world datasets are conducted to evaluate the proposed EigenPro 3.0. Strengths: - The paper is well-written and well-motivated; - The analysis is quite thorough and...
The authors use two methodologies to generate textual prompts with information related to the analyzed diseases in order to explore whether the injection of expressive attributes can improve the generalization and performance of the GLIP model. They did experiments using a broad range of medical datasets from various m...
Recommendation: 8: accept, good paper
Area: Deep Learning and representational learning
Review: The authors use two methodologies to generate textual prompts with information related to the analyzed diseases in order to explore whether the injection of expressive attributes can improve the generalization and performance of the GLIP model. They did experiments using a broad range of medical datasets from v...
This paper a Sentiment- oriented Transformer-based Variational Autoencoder (So-TVAE) , which consists of a sentiment-oriented diversity encoder module and a batch-attention module. The encoder part combines VAE and random mask mechanism to achieve semantic diversity under sentiment guidance, which is then fused with cr...
Recommendation: 3: reject, not good enough
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper a Sentiment- oriented Transformer-based Variational Autoencoder (So-TVAE) , which consists of a sentiment-oriented diversity encoder module and a batch-attention module. The encoder part combines VAE and random mask mechanism to achieve semantic diversity under sentiment guidance, which is then fused...
The paper studies performance of a differentially private model, which is trained on top of a feature extractor. Paper considers feature extractors which are trained using self-supervised learning techniques on public datasets. Paper studies how the amount of public data for pre-training affect performance of the model...
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 studies performance of a differentially private model, which is trained on top of a feature extractor. Paper considers feature extractors which are trained using self-supervised learning techniques on public datasets. Paper studies how the amount of public data for pre-training affect performance of t...
The paper describes a new collection of datasets, the goal being to analyze discourse phenomena. Strengths: data set construction is valuable, and the goals of the work seem worthwhile. Weaknesses: first, there is no attempt to evaluate the quality of the resulting data, either through expert evaluations or inter-anno...
Recommendation: 3: reject, not good enough
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper describes a new collection of datasets, the goal being to analyze discourse phenomena. Strengths: data set construction is valuable, and the goals of the work seem worthwhile. Weaknesses: first, there is no attempt to evaluate the quality of the resulting data, either through expert evaluations or in...
The authors proposes their compression approach for multidimensional weather data leveraging Neural Networks. The authors argue that this could provide compression ratios from 300x to 3,000x which is quite important in complex high resolution data regime. They evaluate this on the ERA5 weather dataset benchmarked aga...
Recommendation: 8: accept, good paper
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: The authors proposes their compression approach for multidimensional weather data leveraging Neural Networks. The authors argue that this could provide compression ratios from 300x to 3,000x which is quite important in complex high resolution data regime. They evaluate this on the ERA5 weather dataset benchma...
This paper focuses on the problem that existing GAN inversion models fail to maintain high-frequency features precisely. In this paper, the authors prove that the widely used L2 loss term is biased towards the low-frequency components. To solve this problem, the authors attempt to interpret GAN inversion in the frequen...
Recommendation: 6: marginally above the acceptance threshold
Area: Generative models
Review: This paper focuses on the problem that existing GAN inversion models fail to maintain high-frequency features precisely. In this paper, the authors prove that the widely used L2 loss term is biased towards the low-frequency components. To solve this problem, the authors attempt to interpret GAN inversion in the...
The paper devises a strategy for unsupervised continual learning by formulating gradient updates as actions taken by an actor whose loss is determined by a critic approximating the future SimSiam loss value. Specifically, the predictions of the actor determine how much memory and current data are weighted in the encode...
Recommendation: 6: marginally above the acceptance threshold
Area: Deep Learning and representational learning
Review: The paper devises a strategy for unsupervised continual learning by formulating gradient updates as actions taken by an actor whose loss is determined by a critic approximating the future SimSiam loss value. Specifically, the predictions of the actor determine how much memory and current data are weighted in th...
For the task of shot boundary detection, this paper releases a new public dataset SHOT, which is complementary to existing related datasets. In addition, the model design is optimized by conducting neural architecture search in a search space encapsulating various advanced 3D ConvNets and Transformers. Experiments show...
Recommendation: 6: marginally above the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: For the task of shot boundary detection, this paper releases a new public dataset SHOT, which is complementary to existing related datasets. In addition, the model design is optimized by conducting neural architecture search in a search space encapsulating various advanced 3D ConvNets and Transformers. Experime...
In this paper, the authors propose SiamDiff, a method that employs a multimodal diffusion process to simulate the structure-sequence co-diffusion trajectory. SiamDiff maximises the Mutual Information (MI) between paired correlated views of proteins, where one is the native protein and the other is obtained with a struc...
Recommendation: 8: accept, good paper
Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability )
Review: In this paper, the authors propose SiamDiff, a method that employs a multimodal diffusion process to simulate the structure-sequence co-diffusion trajectory. SiamDiff maximises the Mutual Information (MI) between paired correlated views of proteins, where one is the native protein and the other is obtained with...
This paper discusses policy optimization in two-player zero-sum Markov games with sharp last iterate guarantee. The paper doesn't come with an appendix and I can't verify the correctness of the paper. The discussion about the technical highlight is also very limited. The authors may want to move the episodic case to th...
Recommendation: 6: marginally above the acceptance threshold
Area: Theory (eg, control theory, learning theory, algorithmic game theory)
Review: This paper discusses policy optimization in two-player zero-sum Markov games with sharp last iterate guarantee. The paper doesn't come with an appendix and I can't verify the correctness of the paper. The discussion about the technical highlight is also very limited. The authors may want to move the episodic ca...
The authors consider a setting where the goal is to solve the parameterized partial PDE $\mathcal{F}_\phi(u) = \mathbf{0}$, where $\mathcal{F}_\phi$ is an affine differential operator, the PDE parameter $\phi$ is a function over some domain $\mathcal{X}$, and the solution $u$ is also a function over some domain $\mathc...
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 setting where the goal is to solve the parameterized partial PDE $\mathcal{F}_\phi(u) = \mathbf{0}$, where $\mathcal{F}_\phi$ is an affine differential operator, the PDE parameter $\phi$ is a function over some domain $\mathcal{X}$, and the solution $u$ is also a function over some domain...
This paper studies the continual meta learning, widely used in low-resource setting. Compared with the existing works, this work is motivated by two points. One is existing works assume the number of components of meta knowledge is mutually exclusive. Two, existing works usually only use a prior determined by Chinese ...
Recommendation: 5: marginally below the acceptance threshold
Area: Deep Learning and representational learning
Review: This paper studies the continual meta learning, widely used in low-resource setting. Compared with the existing works, this work is motivated by two points. One is existing works assume the number of components of meta knowledge is mutually exclusive. Two, existing works usually only use a prior determined by ...
The paper proposes SOLIS, where during model inference, complex numbers are substituted with simpler numbers (anchors) from 1 to 20, the language model outputs the arithmetic between the anchors, and through these, the original answer of the arithmetic between the complex numbers are derived through solving linear syst...
Recommendation: 5: marginally below the acceptance threshold
Area: Applications (eg, speech processing, computer vision, NLP)
Review: The paper proposes SOLIS, where during model inference, complex numbers are substituted with simpler numbers (anchors) from 1 to 20, the language model outputs the arithmetic between the anchors, and through these, the original answer of the arithmetic between the complex numbers are derived through solving lin...
This paper focuses on unsupervised visual anomaly detection in a changeover-based few-shot learning setting. It is a fundamental problem since the changeover scenario requires an anomaly detection model to localize the anomalies in a few samples. Unlike previous meta-learning settings, the authors propose a native few-...
Recommendation: 8: accept, good paper
Area: Applications (eg, speech processing, computer vision, NLP)
Review: This paper focuses on unsupervised visual anomaly detection in a changeover-based few-shot learning setting. It is a fundamental problem since the changeover scenario requires an anomaly detection model to localize the anomalies in a few samples. Unlike previous meta-learning settings, the authors propose a nat...
- To alleviate the reliance on the domain index for domain adaptation, this paper proposes an adversarial variational Bayesian framework that infers domain indices from multi-domain data and provides insights on domain relations to improve domain adaptation performance. - The main contributions include 1. analyze a...
Recommendation: 8: accept, good paper
Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes)
Review: - To alleviate the reliance on the domain index for domain adaptation, this paper proposes an adversarial variational Bayesian framework that infers domain indices from multi-domain data and provides insights on domain relations to improve domain adaptation performance. - The main contributions include 1. a...
In a multi-agent environment, the joint action space can be exponential in the number of agents. A naïve application of the GFlowNet framework requires learning a flow function over |A_i|^N actions, which can be hard to optimize. Another naïve approach which treats each agent independently also fails due to difficultie...
Recommendation: 3: reject, not good enough
Area: Generative models
Review: In a multi-agent environment, the joint action space can be exponential in the number of agents. A naïve application of the GFlowNet framework requires learning a flow function over |A_i|^N actions, which can be hard to optimize. Another naïve approach which treats each agent independently also fails due to dif...