review stringlengths 5 16.6k | score stringclasses 5
values | area stringclasses 12
values | text stringlengths 31 5.65k |
|---|---|---|---|
This paper focused on accelerating one-shot neural architecture search (NAS). In particular, the authors aims to accelerate the architecture search phase based on evolutionary approach. The authors first discuss their observation that the evolutionary approaches tend to select the same shallow blocks from the early sta... | Recommendation: 3: reject, not good enough | Area: General Machine Learning | Review:
This paper focused on accelerating one-shot neural architecture search (NAS). In particular, the authors aims to accelerate the architecture search phase based on evolutionary approach. The authors first discuss their observation that the evolutionary approaches tend to select the same shallow blocks from the e... |
This paper provides the interpretation of IMP method in terms of the loss geometry, to better understand why and how IMP finds winning tickets. It provides various interesting empirical results. The main finding is that whether we find a matching network or not is related with whether the subnetworks at successive roun... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper provides the interpretation of IMP method in terms of the loss geometry, to better understand why and how IMP finds winning tickets. It provides various interesting empirical results. The main finding is that whether we find a matching network or not is related with whether the subnetworks at success... |
This paper presents a unified perspective and analysis for almost all of the existing sample efficient RL algorithms.
This notion is based on Admissible Bellman Characterisation, and provides an a bound in terms of the functional eluder dimension.
Together with this analysis, the authors present an algorithm OPERA, whi... | Recommendation: 8: accept, good paper | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper presents a unified perspective and analysis for almost all of the existing sample efficient RL algorithms.
This notion is based on Admissible Bellman Characterisation, and provides an a bound in terms of the functional eluder dimension.
Together with this analysis, the authors present an algorithm OP... |
The paper considers the problem of fitting a rational function to a time series. The authors provide a coreset construction that gets a time-series and returns a small coreset that approximates its sum of (fitting) distances to any rational functions of constant degree. The size of the coreset is sub-linear in $n$ and ... | Recommendation: 5: marginally below the acceptance threshold | Area: Optimization (eg, convex and non-convex optimization) | Review:
The paper considers the problem of fitting a rational function to a time series. The authors provide a coreset construction that gets a time-series and returns a small coreset that approximates its sum of (fitting) distances to any rational functions of constant degree. The size of the coreset is sub-linear in ... |
The paper proposes BALTO, a biased-diversity-based activation learning approach for fast tensor program optimization. BALTO combines active learning and a biased-diversity-based diversity scheme.
BALTO can achieve the same or higher model accuracy with only 5% of the data samples.
Strength:
- The application of core-se... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper proposes BALTO, a biased-diversity-based activation learning approach for fast tensor program optimization. BALTO combines active learning and a biased-diversity-based diversity scheme.
BALTO can achieve the same or higher model accuracy with only 5% of the data samples.
Strength:
- The application of... |
In the paper, the authors use HyperTransformer (HT) in a new setting that mixes continual learning and few-shot learning. The authors propose to reuse these generated weights as input to the HT for the next task.
1. The paper is not well written. For me, it is not trivial to extract information about the setting. What ... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
In the paper, the authors use HyperTransformer (HT) in a new setting that mixes continual learning and few-shot learning. The authors propose to reuse these generated weights as input to the HT for the next task.
1. The paper is not well written. For me, it is not trivial to extract information about the settin... |
This paper proposees a novel method of HARP, which learns both compression rate and mask each layer to achieve a a high reduction rate while maintaining both the clean and adversarial accuracy of original models. Specifically, the method is delicately designed with many skills utilized to implement the non-uniform robu... | 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 proposees a novel method of HARP, which learns both compression rate and mask each layer to achieve a a high reduction rate while maintaining both the clean and adversarial accuracy of original models. Specifically, the method is delicately designed with many skills utilized to implement the non-unif... |
This manuscript proposed a method for motion mimicking using differentiable physics. This manuscript used Brax as the backbone differentiable physics simulator and proposed to use demonstration to enhance the training. This manuscript showed the comparison with several baselines including DeepMimic and AMP, which are w... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This manuscript proposed a method for motion mimicking using differentiable physics. This manuscript used Brax as the backbone differentiable physics simulator and proposed to use demonstration to enhance the training. This manuscript showed the comparison with several baselines including DeepMimic and AMP, whi... |
In the context of MARL, this work introduces the paradigm of centralised training with hybrid execution, a setting in which the information availability of the other agent's observation is not guaranteed during execution. A novel training approach is also introduced, MARO, in order to deal with this setting, comprising... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
In the context of MARL, this work introduces the paradigm of centralised training with hybrid execution, a setting in which the information availability of the other agent's observation is not guaranteed during execution. A novel training approach is also introduced, MARO, in order to deal with this setting, co... |
This paper conducts an analysis of the bottleneck size/channels of the convolutional autoencoder (CAE). The authors find that an increased bottleneck area (i.e., height × width) improves generalization in terms of reconstruction error while also speeding up training. In contrast, decreasing the feature map size will ma... | Recommendation: 6: marginally above the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
This paper conducts an analysis of the bottleneck size/channels of the convolutional autoencoder (CAE). The authors find that an increased bottleneck area (i.e., height × width) improves generalization in terms of reconstruction error while also speeding up training. In contrast, decreasing the feature map size... |
This paper proposed denoising diffusion probabilistic model for image restoration. They specially applied null-space projection at every iteration to target variable x and used A^T y as range spaced values. By considering only null-space contents in reverse process, they achieved realistic images with data consistency.... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposed denoising diffusion probabilistic model for image restoration. They specially applied null-space projection at every iteration to target variable x and used A^T y as range spaced values. By considering only null-space contents in reverse process, they achieved realistic images with data cons... |
This article aims to experimentally and theoretically define the best SG across different stress tests to reduce the future need for grid search and proposes techniques to improve the performance of SNN training from multiple perspectives, such as the dampening of the SG and the normalization method.
Strengths:
1. The ... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This article aims to experimentally and theoretically define the best SG across different stress tests to reduce the future need for grid search and proposes techniques to improve the performance of SNN training from multiple perspectives, such as the dampening of the SG and the normalization method.
Strengths:... |
The paper proposes a new dataset of garment motions under different human movements as well as wind forces. It also introduces a new network that can predict garment motions of different layers at the same time.
Strengths:
1. Multi-layered cloth motion dataset is indeed in great need. This dataset can boost the advance... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper proposes a new dataset of garment motions under different human movements as well as wind forces. It also introduces a new network that can predict garment motions of different layers at the same time.
Strengths:
1. Multi-layered cloth motion dataset is indeed in great need. This dataset can boost the... |
This paper points out the spatial redundancy on background points and useless group operation in MSG for the inappropriate receptive field. The authors present an algorithm named dynamic ball query, which dynamically generates gate masks for each group of MSG to process useful points and block redundant background poin... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper points out the spatial redundancy on background points and useless group operation in MSG for the inappropriate receptive field. The authors present an algorithm named dynamic ball query, which dynamically generates gate masks for each group of MSG to process useful points and block redundant backgro... |
The paper proposes a curriculum learning paradigm to improve the strength of human-like chess-playing models. The paper studies how the occurrence of problems at a level and the labelling strategy affect the learning process. Through various experiments and analysis of the strength of the teacher and the selection of p... | Recommendation: 3: reject, not good enough | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
The paper proposes a curriculum learning paradigm to improve the strength of human-like chess-playing models. The paper studies how the occurrence of problems at a level and the labelling strategy affect the learning process. Through various experiments and analysis of the strength of the teacher and the select... |
This paper provides the first algorithm based on sign SGD, which achieves Byzantine resilience and differential privacy.
1)Author motivates the subject from a theoretical and practical point of view.
2)In the introduction, the author reviewed the previous works carefully.
3)the author successfully addressed the issue... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper provides the first algorithm based on sign SGD, which achieves Byzantine resilience and differential privacy.
1)Author motivates the subject from a theoretical and practical point of view.
2)In the introduction, the author reviewed the previous works carefully.
3)the author successfully addressed t... |
This paper proposes the first preventive learning based approach to guarantee DNN solution feasible for optimization problem with linear constrains. The key idea is to obtain an conservative satisfication of constriants and adjusting the size of DNN accordlying to guarantee that the redundant feasible region is large e... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes the first preventive learning based approach to guarantee DNN solution feasible for optimization problem with linear constrains. The key idea is to obtain an conservative satisfication of constriants and adjusting the size of DNN accordlying to guarantee that the redundant feasible region is... |
This paper proposes a simple method for unlearning training samples, to comply with GDPR (and other privacy acts') right-to-be-forgotten statement, which gives each person the right to delete their data at any time they want. The proposed unlearning method for language models involves doing a gradient ascent (instead o... | Recommendation: 6: marginally above the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This paper proposes a simple method for unlearning training samples, to comply with GDPR (and other privacy acts') right-to-be-forgotten statement, which gives each person the right to delete their data at any time they want. The proposed unlearning method for language models involves doing a gradient ascent (i... |
The author proposed a new structural equation model, named Rhino, that can be used to model causal relations between variables in temporal data. Compared to ANM, the proposed model is more flexible, but there is no sacrificing in identifiable properties. The proposed Rhino model is actually identifiable under some comm... | Recommendation: 8: accept, good paper | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
The author proposed a new structural equation model, named Rhino, that can be used to model causal relations between variables in temporal data. Compared to ANM, the proposed model is more flexible, but there is no sacrificing in identifiable properties. The proposed Rhino model is actually identifiable under s... |
The goal of this study is to measure the “oppeness” of CLIP-based models. The authors are adding class names that are not part of the target dataset domain and evaluating the change in accuracy from that. They then show how poorly models do and propose a new approach to this via two metrics: inter-modal alignment and i... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The goal of this study is to measure the “oppeness” of CLIP-based models. The authors are adding class names that are not part of the target dataset domain and evaluating the change in accuracy from that. They then show how poorly models do and propose a new approach to this via two metrics: inter-modal alignme... |
The presented work proposes a method for estimating model performance and mixed precision configuration without network retraining. The introduced method is based on the Fisher information, what allows for faster computations compared to other existing methods based on e.g., Hessians.
The work is clear and well struct... | Recommendation: 8: accept, good paper | Area: General Machine Learning | Review:
The presented work proposes a method for estimating model performance and mixed precision configuration without network retraining. The introduced method is based on the Fisher information, what allows for faster computations compared to other existing methods based on e.g., Hessians.
The work is clear and wel... |
This work aims to improve the cross-lingual retrieval capability of dual encoder models.
Given access to multi-lingual document corpus and the intuition that sentence ordering across languages are often similar, this work proposes to use sequential sentence relation to facilitate cross-lingual representation learning.
... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This work aims to improve the cross-lingual retrieval capability of dual encoder models.
Given access to multi-lingual document corpus and the intuition that sentence ordering across languages are often similar, this work proposes to use sequential sentence relation to facilitate cross-lingual representation le... |
This main contribution of this paper is that it provides an idea and corresponding theoretical proof about degenerating subgraph matching problem to subtree matching with the help of Graph Neural Network.
Strength: Theoretical proof and support for each claims mentioned.
Weakness:
1. The datasets used in the experime... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This main contribution of this paper is that it provides an idea and corresponding theoretical proof about degenerating subgraph matching problem to subtree matching with the help of Graph Neural Network.
Strength: Theoretical proof and support for each claims mentioned.
Weakness:
1. The datasets used in the ... |
The authors tackle the problem of updating existing models in production-scale
systems while performing Positive-Congruent Training (minimize negative flip
rate and error rate simultaneously). To do so, they make two key observations:
- Previous studies have demonstrated that ensembles can reduce NFR without
negativ... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The authors tackle the problem of updating existing models in production-scale
systems while performing Positive-Congruent Training (minimize negative flip
rate and error rate simultaneously). To do so, they make two key observations:
- Previous studies have demonstrated that ensembles can reduce NFR without
... |
The paper proposed a slimmable contrastive self-supervised learning framework for building small models with SimCLR. It applied the well-known slimmable network and solved the gradient imbalance problem in the training by slow start training, online distillation, and loss reweighting, etc.
1. The proposed approach ach... | Recommendation: 5: marginally below the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
The paper proposed a slimmable contrastive self-supervised learning framework for building small models with SimCLR. It applied the well-known slimmable network and solved the gradient imbalance problem in the training by slow start training, online distillation, and loss reweighting, etc.
1. The proposed appr... |
This paper provides bounds on the multi-task sample complexity of reinforcement learning in bilinear classes (recently introduced by Du et al., generalizing several existing notions) when the Bellman errors of the tasks can be parameterized in terms of a small set of common features.
The main strength is that the work ... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper provides bounds on the multi-task sample complexity of reinforcement learning in bilinear classes (recently introduced by Du et al., generalizing several existing notions) when the Bellman errors of the tasks can be parameterized in terms of a small set of common features.
The main strength is that t... |
This paper proposes PMixUp that combines two augmentation methods (replacement-based augmentation and feature space augmentation) for the topic classification and sentiment analysis. They emphasis the importance of POS tags for those NLP tasks based on their study, and apply the feature space interpolation to swap out ... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposes PMixUp that combines two augmentation methods (replacement-based augmentation and feature space augmentation) for the topic classification and sentiment analysis. They emphasis the importance of POS tags for those NLP tasks based on their study, and apply the feature space interpolation to s... |
This paper introduces a new variant of CTC that can encode conditions to achieve different preferable properties. The authors gave two examples, one is to force the model to emit the last non-blank token as early as possible; the other is to avoid the drift latency of non-blank tokens to provide better trade-off betwee... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper introduces a new variant of CTC that can encode conditions to achieve different preferable properties. The authors gave two examples, one is to force the model to emit the last non-blank token as early as possible; the other is to avoid the drift latency of non-blank tokens to provide better trade-of... |
The paper compares two forms of meta-learning, with inner-loop updates based either on modulated Hebbian plasticity, or on gradient descent over a network-generated synthetic loss function.
Various experiments show that both forms of episodic plasticity (Hebbian and gradient-based) improve performance over using fixe... | Recommendation: 6: marginally above the acceptance threshold | Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces) | Review:
The paper compares two forms of meta-learning, with inner-loop updates based either on modulated Hebbian plasticity, or on gradient descent over a network-generated synthetic loss function.
Various experiments show that both forms of episodic plasticity (Hebbian and gradient-based) improve performance over us... |
In this paper, the authors focus on open set recognition (detection) and propose a method when the known classes are imbalanced. The proposed method is built based on evidential learning and distributionally robust optimization. To this end, the authors first integrate the evidential learning loss function to distribut... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
In this paper, the authors focus on open set recognition (detection) and propose a method when the known classes are imbalanced. The proposed method is built based on evidential learning and distributionally robust optimization. To this end, the authors first integrate the evidential learning loss function to d... |
The authors propose an Attention Retractable Transformer (ART), which incorporates sparse and dense attention to widen the receptive field size. The ART method achieves pretty good results in several image restoration tasks, like super-resolution, denoising, compression artifact reduction.
The idea about using sparse a... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The authors propose an Attention Retractable Transformer (ART), which incorporates sparse and dense attention to widen the receptive field size. The ART method achieves pretty good results in several image restoration tasks, like super-resolution, denoising, compression artifact reduction.
The idea about using ... |
This paper shows that separate batch statistics for co-training on clean and adversarial inputs are not necessary. An extremely lightweight adapter using the class token is enough to achieve comparable performance compared with the dual norm setting. It also enables model soup instead of model ensembling for faster mod... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper shows that separate batch statistics for co-training on clean and adversarial inputs are not necessary. An extremely lightweight adapter using the class token is enough to achieve comparable performance compared with the dual norm setting. It also enables model soup instead of model ensembling for fa... |
The paper proposes an approach to estimate a manifold using an implicit model. The authors use a constrained energy-based model to learn the data distribution within the manifold. A Langevin dynamics is used to sample from the manifold while training and at an inference time.
Strength:
- a manifold learning and density... | Recommendation: 5: marginally below the acceptance threshold | Area: Generative models | Review:
The paper proposes an approach to estimate a manifold using an implicit model. The authors use a constrained energy-based model to learn the data distribution within the manifold. A Langevin dynamics is used to sample from the manifold while training and at an inference time.
Strength:
- a manifold learning and... |
It's always hard to summarize papers that report on such a big project, but fundamentally this is a tech report of training an English+Chinese LLM with techniques that improve on the state of the art for pretraining methodology and training stability.
GLM-130 is concurrent with OPT and BLOOM, two other GPT-3-class LLM... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
It's always hard to summarize papers that report on such a big project, but fundamentally this is a tech report of training an English+Chinese LLM with techniques that improve on the state of the art for pretraining methodology and training stability.
GLM-130 is concurrent with OPT and BLOOM, two other GPT-3-c... |
The paper introduces CAMA, a safety approach for MARL agents based on constraint augmentation of the search space, and especially the reward function under the notion of a safety budget and hazard values.
CAMA is integrated into two MARL paradigms: CTDE and IL.
Experiments are performed to compare CAMA to baselines met... | Recommendation: 5: marginally below the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
The paper introduces CAMA, a safety approach for MARL agents based on constraint augmentation of the search space, and especially the reward function under the notion of a safety budget and hazard values.
CAMA is integrated into two MARL paradigms: CTDE and IL.
Experiments are performed to compare CAMA to basel... |
In this paper, the authors propose the method Edgeformers, which represents the text-attributed edges in a graph.
They utilize the pre-trained language model (BERT) and the concept of virtual node to represent each text in the edge with regards to its adjacent neighboring edges.
Specifically, in Edgeformer-E, they r... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
In this paper, the authors propose the method Edgeformers, which represents the text-attributed edges in a graph.
They utilize the pre-trained language model (BERT) and the concept of virtual node to represent each text in the edge with regards to its adjacent neighboring edges.
Specifically, in Edgeformer-E... |
The paper proposes a variation-based framework that is able to capture the compositionality in emergent languages. Contrary to most previous work, the authors show that compositionality is in fact correlated with generalization. The difference being that the learned compositionality is obscure and posses a high degree ... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper proposes a variation-based framework that is able to capture the compositionality in emergent languages. Contrary to most previous work, the authors show that compositionality is in fact correlated with generalization. The difference being that the learned compositionality is obscure and posses a high... |
The authors propose to analyze the learned representation in a robotic setting by utilizing graph neural networks (GNNs). Using GNNs and Layer-wise Relevance Propagation (LRP), they represent the observations as an entity-relationship to allow us to interpret the learned policy. Finally, they evaluate their approach in... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The authors propose to analyze the learned representation in a robotic setting by utilizing graph neural networks (GNNs). Using GNNs and Layer-wise Relevance Propagation (LRP), they represent the observations as an entity-relationship to allow us to interpret the learned policy. Finally, they evaluate their app... |
This paper studies the infinite width limit of Multi-layer perceptrons, in particular the existence of feature learning.
In contrast to previous work, it studies adaptive optimizers instead of Gradient Descent, but results are roughly the same: NTK limit still results in lazy training (and no feature learning), while ... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper studies the infinite width limit of Multi-layer perceptrons, in particular the existence of feature learning.
In contrast to previous work, it studies adaptive optimizers instead of Gradient Descent, but results are roughly the same: NTK limit still results in lazy training (and no feature learning)... |
This paper proposes neural attention memory (NAM), an alternative to the standard attention mechanisms, which suffer from well known limitations: their quadratic dependency with respect to the sequence length, and thus their inefficiency when dealing with long sequences, as well as their difficulty to solve tasks that ... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes neural attention memory (NAM), an alternative to the standard attention mechanisms, which suffer from well known limitations: their quadratic dependency with respect to the sequence length, and thus their inefficiency when dealing with long sequences, as well as their difficulty to solve tas... |
The authors show that aligning the internal representations of CNNs trained on image classification with macaque inferotemporal cortex renders those nets' image-to-image error patterns more aligned with humans and improves their adversarial robustness.
### Strengths
+ Simple idea well executed
+ Improved alignment ... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The authors show that aligning the internal representations of CNNs trained on image classification with macaque inferotemporal cortex renders those nets' image-to-image error patterns more aligned with humans and improves their adversarial robustness.
### Strengths
+ Simple idea well executed
+ Improved al... |
The study provides evidence that a network architecture plays a significant role in contrastive SSL, by utilizing 116 variants of ResNet and MobileNet architecture, which were evaluated across 11 downstream tasks in the contrastive SSL setting.
It showed that no one architecture demonstrated a consistently good result,... | Recommendation: 6: marginally above the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
The study provides evidence that a network architecture plays a significant role in contrastive SSL, by utilizing 116 variants of ResNet and MobileNet architecture, which were evaluated across 11 downstream tasks in the contrastive SSL setting.
It showed that no one architecture demonstrated a consistently good... |
This paper presents Hybrid Q-Learning (Hy-Q), an algorithm for a hybrid RL setting, where the agent has both offline datasets and can interact with the environment in an online manner. Hy-Q learns a value function by fitted-Q iteration on both the offline dataset and the online experiences, where the online samples are... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper presents Hybrid Q-Learning (Hy-Q), an algorithm for a hybrid RL setting, where the agent has both offline datasets and can interact with the environment in an online manner. Hy-Q learns a value function by fitted-Q iteration on both the offline dataset and the online experiences, where the online sam... |
This paper presents the design of
datasets and benchmark of symbolic regression for scientific
discovery. Authors point our some limitations for existing datasets and
design their own dataset categorizing subsets of small, medium and
large complexity and develop a new metric based on tree distance
between the true and ... | 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 the design of
datasets and benchmark of symbolic regression for scientific
discovery. Authors point our some limitations for existing datasets and
design their own dataset categorizing subsets of small, medium and
large complexity and develop a new metric based on tree distance
between the t... |
This paper proposes a neural network approach to solve PDEs. The method relies on two key points. The first is outputting coefficients for an overcomplete basis of functions which parameterise the solution. The second is a PDE-constrained layer (e.g. solving a linear system) for incorporating the PDE constraints. The a... | Recommendation: 8: accept, good paper | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This paper proposes a neural network approach to solve PDEs. The method relies on two key points. The first is outputting coefficients for an overcomplete basis of functions which parameterise the solution. The second is a PDE-constrained layer (e.g. solving a linear system) for incorporating the PDE constraint... |
This paper inspects the dataset lottery ticket hypothesis, where training on just subsets have similar empirical behaviors and performance trends as training on the full set. So that analysis and hyper-parameter tuning can be conducted efficiently. Various sampling strategy with different models are compared, the propo... | Recommendation: 5: marginally below the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
This paper inspects the dataset lottery ticket hypothesis, where training on just subsets have similar empirical behaviors and performance trends as training on the full set. So that analysis and hyper-parameter tuning can be conducted efficiently. Various sampling strategy with different models are compared, t... |
This paper proposes a new method, Set-SimCLR, which is a version of SimCLR that produces set representations for use in unsupervised meta learning. Set-SimCLR combines two ideas: (1) SimCLR, which is an instance-level self-supervised learning method and has been shown to produce useful representations in downstream su... | Recommendation: 6: marginally above the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
This paper proposes a new method, Set-SimCLR, which is a version of SimCLR that produces set representations for use in unsupervised meta learning. Set-SimCLR combines two ideas: (1) SimCLR, which is an instance-level self-supervised learning method and has been shown to produce useful representations in downs... |
The paper develops a set of tools to measure model distances, and visualize model embeddings/training trajectories, and thus make measurements on different tasks' relationship. Techniques used includes Bhattacharyya distance, linear layer imprinting, InPCA and others. The paper then uses these tools to make several int... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper develops a set of tools to measure model distances, and visualize model embeddings/training trajectories, and thus make measurements on different tasks' relationship. Techniques used includes Bhattacharyya distance, linear layer imprinting, InPCA and others. The paper then uses these tools to make sev... |
This paper proposes an adversarial attack benchmark where the attacked samples are generated by high-quality generative models filtered by a "surrogated oracle" (a model trained with large-scale extra data points, such as CLIP). More specifically, the proposed method generates adversarial samples by maximizing classifi... | Recommendation: 3: reject, not good enough | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This paper proposes an adversarial attack benchmark where the attacked samples are generated by high-quality generative models filtered by a "surrogated oracle" (a model trained with large-scale extra data points, such as CLIP). More specifically, the proposed method generates adversarial samples by maximizing ... |
The paper proposes a generalized federated distillation framework which divides local nodes into groups: the aggregation is first inside each group and then from groups into the final global model. The advantage is groups can do each aggregation in parallel in the first stage.
The experiments exhaust several popular f... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The paper proposes a generalized federated distillation framework which divides local nodes into groups: the aggregation is first inside each group and then from groups into the final global model. The advantage is groups can do each aggregation in parallel in the first stage.
The experiments exhaust several p... |
This paper introduces SimDRC for dialogue representation learning. SimDRC capture the dialogue structure by locality loss and isotropy loss. The locality loss maximizes the cosine similarity of the representations of the tokens within an utterance, while the isotropy minimizes the cosine similarity of the representatio... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper introduces SimDRC for dialogue representation learning. SimDRC capture the dialogue structure by locality loss and isotropy loss. The locality loss maximizes the cosine similarity of the representations of the tokens within an utterance, while the isotropy minimizes the cosine similarity of the repre... |
This paper proposes a new paradigm for reducing representational similarity analysis in CNNs to filter subspace distance assessment. Model representational similarity can be significantly simplified when filter atom coefficients are shared across networks by calculating the cosine distance among respective filter atoms... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes a new paradigm for reducing representational similarity analysis in CNNs to filter subspace distance assessment. Model representational similarity can be significantly simplified when filter atom coefficients are shared across networks by calculating the cosine distance among respective filt... |
The paper proposes a novel framework called Selection-Inference(SI), which exploits pre-trained large language models as general processing modules to solve logical reasoning problems. Using this framework, LLMs will continuously alternates between selection step and inference step to generate a sequence of casual reas... | 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 framework called Selection-Inference(SI), which exploits pre-trained large language models as general processing modules to solve logical reasoning problems. Using this framework, LLMs will continuously alternates between selection step and inference step to generate a sequence of cas... |
This paper studies the problem of blind face restoration. To overcome the two limitations (lack of generalization property and requirement of multiple constraints), this paper proposes a new approach based on the latest diffusion model in the latent space. The key idea is to learn a posterior distribution from LQ to HQ... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper studies the problem of blind face restoration. To overcome the two limitations (lack of generalization property and requirement of multiple constraints), this paper proposes a new approach based on the latest diffusion model in the latent space. The key idea is to learn a posterior distribution from ... |
This paper studies the problem of federated learning with label noises. The proposed method modified the conventional FL paradigm's local training procedure by injecting the noise filter module. The filter module is designed based on previous learning with noise label (LNL) methods.
## Pros
1. The presented method outp... | Recommendation: 5: marginally below the acceptance threshold | Area: General Machine Learning | Review:
This paper studies the problem of federated learning with label noises. The proposed method modified the conventional FL paradigm's local training procedure by injecting the noise filter module. The filter module is designed based on previous learning with noise label (LNL) methods.
## Pros
1. The presented met... |
The paper introduces a Transformer-based method for estimating 3D human pose and shape, and achieves improved performances over SOTA. They adapt previously known visual Transformer architecture overall and extends to add new independent tokens to encode joint rotation, shape, and camera parameters into the network. The... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper introduces a Transformer-based method for estimating 3D human pose and shape, and achieves improved performances over SOTA. They adapt previously known visual Transformer architecture overall and extends to add new independent tokens to encode joint rotation, shape, and camera parameters into the netw... |
In this paper, the authors propose a filter-importance-scoring concept named pruning by active attention manipulation. The proposed method is a one-stage training process training network from scratch without requiring a pre-trained network.
Strength:
The authors proposed a one-stage training process training network f... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
In this paper, the authors propose a filter-importance-scoring concept named pruning by active attention manipulation. The proposed method is a one-stage training process training network from scratch without requiring a pre-trained network.
Strength:
The authors proposed a one-stage training process training n... |
This paper asks the question: Is the poor performance of domain generalization (DG) algorithms a consequence of not having access to sufficiently many training domains? The authors prove a lower bound which suggests that the answer to this question is "yes." They then provide experiments meant to reinforce this theor... | Recommendation: 3: reject, not good enough | Area: General Machine Learning | Review:
This paper asks the question: Is the poor performance of domain generalization (DG) algorithms a consequence of not having access to sufficiently many training domains? The authors prove a lower bound which suggests that the answer to this question is "yes." They then provide experiments meant to reinforce th... |
In this paper, the authors explore an alternative method to temperature sampling for multilingual data sampling. The central premise is that existing methods can oversample low-resource languages resulting in overfitting and memorization. To alleviate this problem, they propose UNIMAX which caps the number of repetitio... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
In this paper, the authors explore an alternative method to temperature sampling for multilingual data sampling. The central premise is that existing methods can oversample low-resource languages resulting in overfitting and memorization. To alleviate this problem, they propose UNIMAX which caps the number of r... |
The authors investigate the space complexity and amortized round time or query time of the sequential (approximate) query answering problem under adversarial queries. First, they deal with the problem of sequentially answering the least-square objective value with an adversary who modifies the outcome values with L0 re... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The authors investigate the space complexity and amortized round time or query time of the sequential (approximate) query answering problem under adversarial queries. First, they deal with the problem of sequentially answering the least-square objective value with an adversary who modifies the outcome values wi... |
This work proves generalization error bounds of multivariate time series forecasting by graph attention network, under the assumption that every node in the graph has the same degree. The theoretical analyses are based on upper bounding empirical Rademacher complexity of the class of functions represented by the graph ... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This work proves generalization error bounds of multivariate time series forecasting by graph attention network, under the assumption that every node in the graph has the same degree. The theoretical analyses are based on upper bounding empirical Rademacher complexity of the class of functions represented by th... |
This paper proposes a self-supervised skeleton representation learning method based on the BYOL and hyperbolic space. The experimental results show that the proposed HYSP model achieves state-of-the-art performances on three public datasets.
Pros:
(1) This is the first self-supervised skeleton representation work on ... | Recommendation: 6: marginally above the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
This paper proposes a self-supervised skeleton representation learning method based on the BYOL and hyperbolic space. The experimental results show that the proposed HYSP model achieves state-of-the-art performances on three public datasets.
Pros:
(1) This is the first self-supervised skeleton representation ... |
In this paper, authors investigated the key factors that could improve the performance of student model from a teacher model in a cross-modal knowledge distillation set. Based on authors investigation authors proposed a hypothesis that high performance of a teacher model does not always bring high performance student m... | Recommendation: 8: accept, good paper | Area: General Machine Learning | Review:
In this paper, authors investigated the key factors that could improve the performance of student model from a teacher model in a cross-modal knowledge distillation set. Based on authors investigation authors proposed a hypothesis that high performance of a teacher model does not always bring high performance s... |
The authors propose a framework for convergence to Stackelberg equilibria in multi-agent RL. The main contribution of the paper can be summarised by Theorem 1 in the paper. Theorem 1 states 3 conditions for convergence so that the solutions for the leader and the follower form a Stackelberg equilibrium. Additionally, 2... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The authors propose a framework for convergence to Stackelberg equilibria in multi-agent RL. The main contribution of the paper can be summarised by Theorem 1 in the paper. Theorem 1 states 3 conditions for convergence so that the solutions for the leader and the follower form a Stackelberg equilibrium. Additio... |
This work proposes a convolution module capable of scaling up to long sequences. In particular the approach uses a convolution layer and upsample the kernels to process longer sequences. The approach also applies a larger weight on kernels with fewer upsampling to emphasize local information. The proposed approach show... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This work proposes a convolution module capable of scaling up to long sequences. In particular the approach uses a convolution layer and upsample the kernels to process longer sequences. The approach also applies a larger weight on kernels with fewer upsampling to emphasize local information. The proposed appro... |
This paper studied generalization of federated learning. They first consider Bernstein function class, and achieve faster rate in risk bound: $O(1/mn)$ for participating clients and $O(1/mn)+O(1/m)$ for nonparticipating clients. They further proceed to the unbounded loss setting, with small-ball condition assumptions. ... | Recommendation: 5: marginally below the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper studied generalization of federated learning. They first consider Bernstein function class, and achieve faster rate in risk bound: $O(1/mn)$ for participating clients and $O(1/mn)+O(1/m)$ for nonparticipating clients. They further proceed to the unbounded loss setting, with small-ball condition assum... |
The paper proposes a novel metric, Time Consistency Prediction (TCP), as criteria to guide curriculum learning for jointly training the label transition matrix and clean classifier.
Strength:
1. The proposed metric TCP for curriculum learning is theoretically motivated. In particular, empirical results show that it is... | Recommendation: 5: marginally below the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
The paper proposes a novel metric, Time Consistency Prediction (TCP), as criteria to guide curriculum learning for jointly training the label transition matrix and clean classifier.
Strength:
1. The proposed metric TCP for curriculum learning is theoretically motivated. In particular, empirical results show th... |
This paper studies the problem of DP optimization in the convex setting. This paper considers the problem in the setting that the loss function is smooth but not Lipschitz and the domain is not bounded. Instead the author assumes a growth condition which basically relates the gradient of a point to the optimal gap of ... | 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 DP optimization in the convex setting. This paper considers the problem in the setting that the loss function is smooth but not Lipschitz and the domain is not bounded. Instead the author assumes a growth condition which basically relates the gradient of a point to the optimal... |
This paper proposes an approximate version of the multivariate Hawkes process. The authors claim that the existing estimation procedure has significant limitations, especially in the computational cost. The authors propose a variant of the binned Hawkes process, where the continuous decay function is replaced by a disc... | Recommendation: 5: marginally below the acceptance threshold | Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces) | Review:
This paper proposes an approximate version of the multivariate Hawkes process. The authors claim that the existing estimation procedure has significant limitations, especially in the computational cost. The authors propose a variant of the binned Hawkes process, where the continuous decay function is replaced b... |
Federated Learning trains a global model collaboratively over a set of clients , where the data is kept locally at the clients and only local gradients or parameters are communicated periodically with the server. Communicating large number of bits mights often slow down convergence and thus various compression schemes ... | Recommendation: 3: reject, not good enough | Area: General Machine Learning | Review:
Federated Learning trains a global model collaboratively over a set of clients , where the data is kept locally at the clients and only local gradients or parameters are communicated periodically with the server. Communicating large number of bits mights often slow down convergence and thus various compression ... |
This paper proposes to regularize continuous control policies trained offline by forcing them away from actions that are too far from the training data's actions. This is achieved by a learned distance function that predicts distance to the training data's actions. The authors show that such a setup has some interestin... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper proposes to regularize continuous control policies trained offline by forcing them away from actions that are too far from the training data's actions. This is achieved by a learned distance function that predicts distance to the training data's actions. The authors show that such a setup has some in... |
This paper addresses the problem of unsupervised semantic segmentation with self-supervised object-centric representations. The authors use object-centric datasets on which localization and categorization priors are learned in a self-supervised way, Combining these priors with an iterative self-training procedure allo... | Recommendation: 6: marginally above the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
This paper addresses the problem of unsupervised semantic segmentation with self-supervised object-centric representations. The authors use object-centric datasets on which localization and categorization priors are learned in a self-supervised way, Combining these priors with an iterative self-training proced... |
The paper studies how pre-trained large language models (LLMs) perform on three HTML understanding tasks: (1) semantic classification of HTML elements, (2) description generation for HTML inputs and (3) autonomous web navigation of HTML pages. It found that pre-trained LLMs can work on these tasks effectively after fin... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper studies how pre-trained large language models (LLMs) perform on three HTML understanding tasks: (1) semantic classification of HTML elements, (2) description generation for HTML inputs and (3) autonomous web navigation of HTML pages. It found that pre-trained LLMs can work on these tasks effectively a... |
This paper studies the applicability of pre-trained vision language models to the medical domain. The paper shows how manually designed expressive prompts can bridge the domain gap between natural and medical images. Further, they propose methods for automatic prompt generation and demonstrate across a range of medical... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper studies the applicability of pre-trained vision language models to the medical domain. The paper shows how manually designed expressive prompts can bridge the domain gap between natural and medical images. Further, they propose methods for automatic prompt generation and demonstrate across a range of... |
This paper presents a curiosity driven unsupervised data collection method for collecting task-agnostic datasets for offline reinforcement learning. The approach proposes a learnable state reachability module that provides an intrinsic reward for exploration by combining a state-action entropy bonus with a forward dyna... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper presents a curiosity driven unsupervised data collection method for collecting task-agnostic datasets for offline reinforcement learning. The approach proposes a learnable state reachability module that provides an intrinsic reward for exploration by combining a state-action entropy bonus with a forw... |
This paper proposes a topic aware transformer (TAT) to adapt pretrained language models to target domains through topic modeling. The motivation is, to alleviate forgetting, TAT explicitly quantify the domain shift as topic shifts. By introducing a topic steering layer (TSL) on top of transformers, TAT decompose the ta... | Recommendation: 6: marginally above the acceptance threshold | Area: Generative models | Review:
This paper proposes a topic aware transformer (TAT) to adapt pretrained language models to target domains through topic modeling. The motivation is, to alleviate forgetting, TAT explicitly quantify the domain shift as topic shifts. By introducing a topic steering layer (TSL) on top of transformers, TAT decompos... |
This manuscript proposes a method that can adaptively scale the loss based on the error of predicting the results of PDE. This manuscript experimented with the method on several classic PDEs, including the heat equation and burger's equation.
Weaknesses:
- The experiments are too toy to show the true efficacy of the pr... | Recommendation: 3: reject, not good enough | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This manuscript proposes a method that can adaptively scale the loss based on the error of predicting the results of PDE. This manuscript experimented with the method on several classic PDEs, including the heat equation and burger's equation.
Weaknesses:
- The experiments are too toy to show the true efficacy o... |
In this paper, the author proposee Factorized Fourier Neural Operator (F-FNO), a learning-based approach for simulating partial differential equations (PDEs). This work is seen as an improvement of the work by [Li2021] in which the Fourier Neural Operator was introduced. In this work, the author aims at improving the s... | Recommendation: 8: accept, good paper | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
In this paper, the author proposee Factorized Fourier Neural Operator (F-FNO), a learning-based approach for simulating partial differential equations (PDEs). This work is seen as an improvement of the work by [Li2021] in which the Fourier Neural Operator was introduced. In this work, the author aims at improvi... |
The paper suggests modifying the variational objective in mixture-based multi-modal VAEs by including both a uni-modal as well as a multi-modal reconstruction term. The authors also aim to present a unified perspective on mixture-based multimodal VAEs by showing that methods motived by a Jensen-Shannon-Divergence or To... | Recommendation: 5: marginally below the acceptance threshold | Area: Generative models | Review:
The paper suggests modifying the variational objective in mixture-based multi-modal VAEs by including both a uni-modal as well as a multi-modal reconstruction term. The authors also aim to present a unified perspective on mixture-based multimodal VAEs by showing that methods motived by a Jensen-Shannon-Divergen... |
The focus of this paper is on federated learning in a setting where the edge clients do not have sufficient resources to train a large model and, additionally, the clients do not want to share any intermediate data and/or labels with the server. The main contribution in the paper is an algorithm, termed Principal Sub-M... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The focus of this paper is on federated learning in a setting where the edge clients do not have sufficient resources to train a large model and, additionally, the clients do not want to share any intermediate data and/or labels with the server. The main contribution in the paper is an algorithm, termed Princip... |
This paper proposes a method named BEVDistill to distill knowledge from LiDAR-based 3D object detectors (teacher) to enhance multi-view 3D detectors (student).
First, since both detectors project their inputs to the BEV space, the proposed method performs feature distillation between the BEV feature maps under the gui... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposes a method named BEVDistill to distill knowledge from LiDAR-based 3D object detectors (teacher) to enhance multi-view 3D detectors (student).
First, since both detectors project their inputs to the BEV space, the proposed method performs feature distillation between the BEV feature maps under... |
The paper provides a framework for incrementally learning a generative and discriminative model for multi-class problems using a Linear Discriminative Representation (LDR) and a coding rate reduction objective. The closed-loop transcription framework (CTRL) is formulated as a minimax game wherein the encoder tries to m... | Recommendation: 8: accept, good paper | Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces) | Review:
The paper provides a framework for incrementally learning a generative and discriminative model for multi-class problems using a Linear Discriminative Representation (LDR) and a coding rate reduction objective. The closed-loop transcription framework (CTRL) is formulated as a minimax game wherein the encoder tr... |
This paper concerns the problem of question answering via multi-hop inference, where multiple separate facts need to be taken into account to answer a complex question. To allow for interpretable structured explanations of the reasoning process, this and previous work explicitly encode multi-hop inference in the constr... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper concerns the problem of question answering via multi-hop inference, where multiple separate facts need to be taken into account to answer a complex question. To allow for interpretable structured explanations of the reasoning process, this and previous work explicitly encode multi-hop inference in th... |
The paper provides an empirical evaluation of whether object-centric representation pre-training is useful for RL learning. They find that OCR pre-training generally delivers better and more data-efficient model, also allowing generalization to unseen settings (e.g., an unseen number of objects).
The paper presents a ... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper provides an empirical evaluation of whether object-centric representation pre-training is useful for RL learning. They find that OCR pre-training generally delivers better and more data-efficient model, also allowing generalization to unseen settings (e.g., an unseen number of objects).
The paper pre... |
The authors identify that deep learning models (DLM) give state of the art performance on NLP tasks, but are black box models which are not interpretable in themselves. They propose using a generalized additive model (GAM) setup which uses the sum of ngram embeddings for text classification tasks to bridge the gap be... | 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 identify that deep learning models (DLM) give state of the art performance on NLP tasks, but are black box models which are not interpretable in themselves. They propose using a generalized additive model (GAM) setup which uses the sum of ngram embeddings for text classification tasks to bridge th... |
The authors proposed an approach for drug repurposing based on a biomedical knowledge graph. It not only predicts drug efficacy against a disease, but it also finds paths that could provide a biological explanation for the predictions. They compared their method against competitors and showed their performance in predi... | Recommendation: 5: marginally below the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
The authors proposed an approach for drug repurposing based on a biomedical knowledge graph. It not only predicts drug efficacy against a disease, but it also finds paths that could provide a biological explanation for the predictions. They compared their method against competitors and showed their performance ... |
The authors tried to explain the cause of catastrophic overfitting (CO) during FGSM adversarial training. The authors first showed that CO can be deliberately induced by dataset intervention. Then, using this intervened dataset as a starting point, the authors conducted three well-designed experiments to study the chai... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The authors tried to explain the cause of catastrophic overfitting (CO) during FGSM adversarial training. The authors first showed that CO can be deliberately induced by dataset intervention. Then, using this intervened dataset as a starting point, the authors conducted three well-designed experiments to study ... |
The paper proposes a new task of multimodal analogical reasoning that takes the inputs of a pair of head and tail entities in different modalities, and predicts the missing tail entity for a given query head entity. The task is inspired by conventional single modal analogical reasoning and cognitive theory: human learn... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper proposes a new task of multimodal analogical reasoning that takes the inputs of a pair of head and tail entities in different modalities, and predicts the missing tail entity for a given query head entity. The task is inspired by conventional single modal analogical reasoning and cognitive theory: hum... |
This paper proposed a knowledge distillation based federated learning method by utilizing unlabeled data on the server. A global model, including a feature extractor and classifier, is trained to approximate entropy-weighted pseudo-label on the server. Further, a self-supervised learning framework is applied on top to ... | Recommendation: 6: marginally above the acceptance threshold | Area: General Machine Learning | Review:
This paper proposed a knowledge distillation based federated learning method by utilizing unlabeled data on the server. A global model, including a feature extractor and classifier, is trained to approximate entropy-weighted pseudo-label on the server. Further, a self-supervised learning framework is applied on... |
This work targets the end-to-end autonomous driving task from monocular images.
In particular, they propose **PPGeo**, and leverage large-scale unlabeled driving videos mined from the web in order to pre-train a visual encoder.
To do this, they first train a DepthNet and PoseNet on their unlabeled dataset, using co... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This work targets the end-to-end autonomous driving task from monocular images.
In particular, they propose **PPGeo**, and leverage large-scale unlabeled driving videos mined from the web in order to pre-train a visual encoder.
To do this, they first train a DepthNet and PoseNet on their unlabeled dataset, ... |
This paper considers the problem of providing generalization bounds using the disintegrated PAC-Bayesian framework. The main idea behind the paper is that we can start with an arbitrary complexity measure which provides a hierarchy over the hypotheses. Then the authors show that a particular learning algorithm based on... | Recommendation: 5: marginally below the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper considers the problem of providing generalization bounds using the disintegrated PAC-Bayesian framework. The main idea behind the paper is that we can start with an arbitrary complexity measure which provides a hierarchy over the hypotheses. Then the authors show that a particular learning algorithm ... |
This paper proposes the projected Bellman operator (PBO), an operator on the parameter space of the value function, for value-based reinforcement learning. The paper argues that PBO can approximate repeated applications of Bellman operator at once. To show the advantage of this, the paper considers three example of app... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper proposes the projected Bellman operator (PBO), an operator on the parameter space of the value function, for value-based reinforcement learning. The paper argues that PBO can approximate repeated applications of Bellman operator at once. To show the advantage of this, the paper considers three exampl... |
This paper presents LMSeg, which aims to train a model for image segmentation on multi-datasets. The authors claim that they resolve two major challenges in this paper:
- 1 the domain gap or inconsistency between semantic segmentation and panoptic segmentation.
- 2 the separated label space.
Experiments show that the ... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper presents LMSeg, which aims to train a model for image segmentation on multi-datasets. The authors claim that they resolve two major challenges in this paper:
- 1 the domain gap or inconsistency between semantic segmentation and panoptic segmentation.
- 2 the separated label space.
Experiments show t... |
1) The paper proposes ACT to utilize 2D pre-trained models as teachers for cross-modality knowledge transfer by masked point modeling. This can alleviate the data desert problem in 3D by using rich semantics learned from 2D images.
2) ACT consists of three steps: 1. Adapt the pre-trained 2D/language models into 3D tea... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
1) The paper proposes ACT to utilize 2D pre-trained models as teachers for cross-modality knowledge transfer by masked point modeling. This can alleviate the data desert problem in 3D by using rich semantics learned from 2D images.
2) ACT consists of three steps: 1. Adapt the pre-trained 2D/language models int... |
A motion retargeting method based on vision transformer is proposed in this paper. This task is formulated into the pattern matching problem where global and local search are required in one human image. Considering the local perception of conv layer and global perception of cross attentions, this paper combines the ad... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
A motion retargeting method based on vision transformer is proposed in this paper. This task is formulated into the pattern matching problem where global and local search are required in one human image. Considering the local perception of conv layer and global perception of cross attentions, this paper combine... |
This paper proposes a new scheme to pretrain the neural networks, which combines the calculated persistent homology of a sublevel set filtration of images as the topology information. The topology information aims to guide the neural networks to learn non-local topological structures. To avoid the human bias in the ann... | Recommendation: 5: marginally below the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
This paper proposes a new scheme to pretrain the neural networks, which combines the calculated persistent homology of a sublevel set filtration of images as the topology information. The topology information aims to guide the neural networks to learn non-local topological structures. To avoid the human bias in... |
In this paper, the authors explore Transformer's systematic generalization in algorithmic tasks, including copy, reverse, and hierarchical group or sort operations on an input sequence. The authors create a set of tasks and show that a two-layer Transformer successfully learns these tasks and generalizes to sequences l... | Recommendation: 1: strong reject | Area: Deep Learning and representational learning | Review:
In this paper, the authors explore Transformer's systematic generalization in algorithmic tasks, including copy, reverse, and hierarchical group or sort operations on an input sequence. The authors create a set of tasks and show that a two-layer Transformer successfully learns these tasks and generalizes to seq... |
This paper investigates properties of trained manifolds with different learning methods on simple image data. For this, the authors propose data augmentation method and define metrics that lead to quantification of the quality of the overall manifold. They show that the proposed metric, i.e., RMQM, has high correlation... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper investigates properties of trained manifolds with different learning methods on simple image data. For this, the authors propose data augmentation method and define metrics that lead to quantification of the quality of the overall manifold. They show that the proposed metric, i.e., RMQM, has high cor... |
The paper looks at the problem of ensuring the right-to-be-forgotten (RTBF), under multiple adaptive edit requests to the dataset. The paper has three main contributions (a) they show that the machine unlearning definitions used in the prior works are not sufficient to ensure RTBF, especially when the edit requests are... | 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 looks at the problem of ensuring the right-to-be-forgotten (RTBF), under multiple adaptive edit requests to the dataset. The paper has three main contributions (a) they show that the machine unlearning definitions used in the prior works are not sufficient to ensure RTBF, especially when the edit requ... |
This paper develops a federated neural contextual bandit algorithm FN-UCB which extends existing neural contextual bandits to the federated setting. The key idea of FN-UCB is that it adopts a weighted combination of two UCBs, where the first UCB allows every agent to additionally use the observations from the other age... | Recommendation: 6: marginally above the acceptance threshold | Area: General Machine Learning | Review:
This paper develops a federated neural contextual bandit algorithm FN-UCB which extends existing neural contextual bandits to the federated setting. The key idea of FN-UCB is that it adopts a weighted combination of two UCBs, where the first UCB allows every agent to additionally use the observations from the o... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.