review stringlengths 5 16.6k | score stringclasses 5
values | area stringclasses 12
values | text stringlengths 31 5.65k |
|---|---|---|---|
The paper investigates the difference is speech representations towards end for streaming input vs when complete utterance input is available. Based on this investigation the work proposes future aware streaming ST which introduces few frames of future speech signals. Extensive experiments verify the improvements compa... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper investigates the difference is speech representations towards end for streaming input vs when complete utterance input is available. Based on this investigation the work proposes future aware streaming ST which introduces few frames of future speech signals. Extensive experiments verify the improvemen... |
The paper propose a cross attention mechanism for classifying protein-protein interactions. The hypothesis is that information from both proteins get mixed during encoding, leading to better predictions. Paper also propose using the Wasserstein distance measure while processing the attention values.
Key new ideas are (... | Recommendation: 3: reject, not good enough | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
The paper propose a cross attention mechanism for classifying protein-protein interactions. The hypothesis is that information from both proteins get mixed during encoding, leading to better predictions. Paper also propose using the Wasserstein distance measure while processing the attention values.
Key new ide... |
This paper proposed a method called FedPA that deals with client and period drift problems. The period drift problem is caused by the asynchronized updates of each client, leading to extra bias in model aggregation. The authors proposed a learning-based aggregation strategy, that parameterizes the aggregation function ... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposed a method called FedPA that deals with client and period drift problems. The period drift problem is caused by the asynchronized updates of each client, leading to extra bias in model aggregation. The authors proposed a learning-based aggregation strategy, that parameterizes the aggregation f... |
This paper introduces a new kind of audio-visual navigation task which requires agent to generalize to novel audio sources in 3D indoor environments from the Matterport dataset. The proposed approach leverages multiple sources of information of which objects the source is likely coming from, where they might be found, ... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper introduces a new kind of audio-visual navigation task which requires agent to generalize to novel audio sources in 3D indoor environments from the Matterport dataset. The proposed approach leverages multiple sources of information of which objects the source is likely coming from, where they might be... |
This paper theoretically studies the notion of neural collapse (NC) -- the penultimate layer representations of all the examples in a specific class collapse to a single representation, and separate from other classes. Specifically, this paper studies this notion under uniform label noises, and proposed a model called ... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper theoretically studies the notion of neural collapse (NC) -- the penultimate layer representations of all the examples in a specific class collapse to a single representation, and separate from other classes. Specifically, this paper studies this notion under uniform label noises, and proposed a model... |
This concerns learning the hierarchical representation (e.g., a.a., backbone, all-atom) for proteins with 3D structures. A novel hierarchical graph network, termed ProNet, was developed. ProNet is flexible, efficient and effective. It is shown that ProNet representations are complete at all levels if the base 3D graph ... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This concerns learning the hierarchical representation (e.g., a.a., backbone, all-atom) for proteins with 3D structures. A novel hierarchical graph network, termed ProNet, was developed. ProNet is flexible, efficient and effective. It is shown that ProNet representations are complete at all levels if the base 3... |
This work studies patterns in the performance of ML models on in-distribution (ID) and out-of-distribution (OOD) data. The central claim of this work is that ID performance can be inversely correlated with OOD performance in practice, which has not been explicitly observed before in deep ML models. This work then provi... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This work studies patterns in the performance of ML models on in-distribution (ID) and out-of-distribution (OOD) data. The central claim of this work is that ID performance can be inversely correlated with OOD performance in practice, which has not been explicitly observed before in deep ML models. This work th... |
The paper proposed a new RL algorithm for continuous control. A key idea is to represent the policy as a distribution of trajectories in the problem space to capture the multi-modality nature of the problem. A variational lower-bound is derived to create a practical optimization objective and with some assumptions on t... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper proposed a new RL algorithm for continuous control. A key idea is to represent the policy as a distribution of trajectories in the problem space to capture the multi-modality nature of the problem. A variational lower-bound is derived to create a practical optimization objective and with some assumpti... |
This work studies the layer-wise representations of different VAEs. The similarity between the layer-wise representations is measured using the Centered Kernel Alignment metric and the Procrustes scores. Experiments are performed to study the effect of different hyperparameters on the same model, regularization, initia... | Recommendation: 5: marginally below the acceptance threshold | Area: Generative models | Review:
This work studies the layer-wise representations of different VAEs. The similarity between the layer-wise representations is measured using the Centered Kernel Alignment metric and the Procrustes scores. Experiments are performed to study the effect of different hyperparameters on the same model, regularization... |
The paper studies the trade-off between the ability to achieve algorithmic resource vs. the right to be forgotten in machine learning, specifically via linear models and wide neural networks. It illustrates that these two desiderate (algorithimic resource and the right to be forgotten) are fundamentally at odds by defi... | 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 studies the trade-off between the ability to achieve algorithmic resource vs. the right to be forgotten in machine learning, specifically via linear models and wide neural networks. It illustrates that these two desiderate (algorithimic resource and the right to be forgotten) are fundamentally at odds... |
This paper first compares the performance of contrastive and non-contrastive methods on the graph link prediction task. Second, a novel model i.e. Triplet-BGRL (T-BGRL) is proposed based on Bootstrapped Graph Latents (BGRL). The proposed T-BGRL is categorised as a non-contrastive method and it relies on an efficient co... | Recommendation: 5: marginally below the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
This paper first compares the performance of contrastive and non-contrastive methods on the graph link prediction task. Second, a novel model i.e. Triplet-BGRL (T-BGRL) is proposed based on Bootstrapped Graph Latents (BGRL). The proposed T-BGRL is categorised as a non-contrastive method and it relies on an effi... |
The paper proposes a transformer based method to solve offline meta reinforcement learning and offline reinforcement learning tasks. An auto-regressive transformer is learned on the existing trajectory, and prompt tuning is used to guide the prediction towards policy improvement. There is an additional contrastive loss... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper proposes a transformer based method to solve offline meta reinforcement learning and offline reinforcement learning tasks. An auto-regressive transformer is learned on the existing trajectory, and prompt tuning is used to guide the prediction towards policy improvement. There is an additional contrast... |
This paper improves the previous path integration based model interpretation works by overcoming the limit of absolute based attribute scores. The method is mainly consisting of a) building a better "reference" than the manual way previously; b) identifying the interpolation point in the non-linear path through the rel... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper improves the previous path integration based model interpretation works by overcoming the limit of absolute based attribute scores. The method is mainly consisting of a) building a better "reference" than the manual way previously; b) identifying the interpolation point in the non-linear path through... |
This paper considers using autoregressive models to predict the different state dimensions when learning a transition model. The authors argue that autoregressive models are able to capture correlations between state dimensions and therefore work better than standard neural nets in the context of model-based offline RL... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper considers using autoregressive models to predict the different state dimensions when learning a transition model. The authors argue that autoregressive models are able to capture correlations between state dimensions and therefore work better than standard neural nets in the context of model-based of... |
Summary
Based on former findings, this paper first proposes a new definition of robust features with taking dynamics into consideration. Focused on the phenomenon that robust overfitting usually starts after learning rate decay, the authors provide an explanation of robust overfitting based on several experiments. New... | Recommendation: 6: marginally above the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
Summary
Based on former findings, this paper first proposes a new definition of robust features with taking dynamics into consideration. Focused on the phenomenon that robust overfitting usually starts after learning rate decay, the authors provide an explanation of robust overfitting based on several experime... |
The paper studies the linear mode connectivity problem empirically and uncovers a new phenomenon called variance collapse (where activation variances of interpolated networks between two parent networks reduces significantly). Test accuracy barrier reduction is shown successfully for the interpolated networks (for CIFA... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper studies the linear mode connectivity problem empirically and uncovers a new phenomenon called variance collapse (where activation variances of interpolated networks between two parent networks reduces significantly). Test accuracy barrier reduction is shown successfully for the interpolated networks (... |
This paper proposes a novel algorithm for offline RL that works by dividing the state-action space into discrete latent regions, learning a deterministic policy for each, and acting with a mixture of these policies. The authors demonstrate the effectiveness of their method on a series of experiments from the D4RL bench... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper proposes a novel algorithm for offline RL that works by dividing the state-action space into discrete latent regions, learning a deterministic policy for each, and acting with a mixture of these policies. The authors demonstrate the effectiveness of their method on a series of experiments from the D4... |
This paper presents a new approach for object depth estimation by using audio and video propagation times.
Strengths
I really like this paper. Although the idea of using time of arrival differences is simple, it hasn't been explored so thoroughly before. The execution is nice. One main advantage is that this method wor... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper presents a new approach for object depth estimation by using audio and video propagation times.
Strengths
I really like this paper. Although the idea of using time of arrival differences is simple, it hasn't been explored so thoroughly before. The execution is nice. One main advantage is that this me... |
The paper identifies that with Tensor Programming Optimisation in general the dataset collected is significantly imbalanced. Using this they develop an active learning approach which favours the selection of new samples as those which are hoped to be in areas with less prior knowledge. The authors show that this allows... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper identifies that with Tensor Programming Optimisation in general the dataset collected is significantly imbalanced. Using this they develop an active learning approach which favours the selection of new samples as those which are hoped to be in areas with less prior knowledge. The authors show that thi... |
This paper proposes a method for deepfake detection against adversarial attacks. It proposes to use an ensemble of models whose inputs are subsets of frequency spectrum. It also theoretically proves that the ensemble of models reduce the dimension of the adversarial subspace, which could increase the robustness.
Streng... | Recommendation: 8: accept, good paper | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This paper proposes a method for deepfake detection against adversarial attacks. It proposes to use an ensemble of models whose inputs are subsets of frequency spectrum. It also theoretically proves that the ensemble of models reduce the dimension of the adversarial subspace, which could increase the robustness... |
This paper proposes a measure of conditional independence called CIRCE that can be used as a regularizer in a large-scale mini-batch training. The key idea of CIRCE is that the conditional independence holds if and only if Eq. (4) holds, so we can measure the conditional dependence by how much the equation is violated.... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper proposes a measure of conditional independence called CIRCE that can be used as a regularizer in a large-scale mini-batch training. The key idea of CIRCE is that the conditional independence holds if and only if Eq. (4) holds, so we can measure the conditional dependence by how much the equation is v... |
This paper proposes a meta-learning approach based on generation of new tasks from the columns of the training data. The authors's technique targets tabular data through modification of the task generation using randomization of the columns as well as an unsupervised validation technique. Through generation of such new... | Recommendation: 6: marginally above the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
This paper proposes a meta-learning approach based on generation of new tasks from the columns of the training data. The authors's technique targets tabular data through modification of the task generation using randomization of the columns as well as an unsupervised validation technique. Through generation of ... |
This paper proposed a transformer-based architecture to discover diverse behaviors from the offline dataset.
Strength:
1. This paper is well-writing.
2. The discovery of diverse behaviors is an interesting problem.
Weakness:
1. The experiment results are not good enough. The proposed method is much worse than baseline... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper proposed a transformer-based architecture to discover diverse behaviors from the offline dataset.
Strength:
1. This paper is well-writing.
2. The discovery of diverse behaviors is an interesting problem.
Weakness:
1. The experiment results are not good enough. The proposed method is much worse than ... |
The paper presents a way of performing knowledge distillation using contrastive learning. The authors point out that existing distillation methods that use contrastive learning have two main issues: (i) memory intensive - as it needs to store the representations of the whole dataset to construct negatives, (ii) the neg... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper presents a way of performing knowledge distillation using contrastive learning. The authors point out that existing distillation methods that use contrastive learning have two main issues: (i) memory intensive - as it needs to store the representations of the whole dataset to construct negatives, (ii)... |
The paper describes a proposal to enhance real-valued neural autoregressive density estimator (RNADE) by utilizing RNN-based mechanisms to be applicable over a concept-drifting data stream for density estimation and classification tasks. Using RNNs for estimating mean and variance, and constraining the number of parame... | Recommendation: 3: reject, not good enough | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
The paper describes a proposal to enhance real-valued neural autoregressive density estimator (RNADE) by utilizing RNN-based mechanisms to be applicable over a concept-drifting data stream for density estimation and classification tasks. Using RNNs for estimating mean and variance, and constraining the number o... |
This work presents a new probabilistic algorithm ("DiscoBAX") for subset selection that aims to approximately optimize phenotype movement in genomic intervention and can be useful in drug discovery tasks according to the authors. The method identifies a set of interventions whose elements will trigger maximum expected ... | Recommendation: 3: reject, not good enough | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This work presents a new probabilistic algorithm ("DiscoBAX") for subset selection that aims to approximately optimize phenotype movement in genomic intervention and can be useful in drug discovery tasks according to the authors. The method identifies a set of interventions whose elements will trigger maximum e... |
This manuscript proposes a method, PA-LoFTE, for solving feature matching between images which generally follows a detection-description-matching three-stage pipeline. In order to achieve that, the authors utilize depth information from a depth predictor to generate 3D position embedding, then combine visual features, ... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This manuscript proposes a method, PA-LoFTE, for solving feature matching between images which generally follows a detection-description-matching three-stage pipeline. In order to achieve that, the authors utilize depth information from a depth predictor to generate 3D position embedding, then combine visual fe... |
In this paper, the authors transplant the idea of spiking neurons to MLP.
Strength:
+ The authors ensure multiplication-free inference.
+ This work may be the first attempt for combining LIF and MLP.
Weakness:
- The motivation for this work is not convincing for me. In the abstract, the authors claimed that the ... | Recommendation: 3: reject, not good enough | Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces) | Review:
In this paper, the authors transplant the idea of spiking neurons to MLP.
Strength:
+ The authors ensure multiplication-free inference.
+ This work may be the first attempt for combining LIF and MLP.
Weakness:
- The motivation for this work is not convincing for me. In the abstract, the authors claimed t... |
This paper proposed a new finding that between the image content and the additive degradation, deep networks tend to learn the less complex element in the separation task. To solve the generalization problem in image deraining, it tried to train the deraining networks with the fewer and less complex background images.
... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposed a new finding that between the image content and the additive degradation, deep networks tend to learn the less complex element in the separation task. To solve the generalization problem in image deraining, it tried to train the deraining networks with the fewer and less complex background ... |
In this paper, the authors try to address the multi-instance interactive segmentation task instead of salient interactive segmentation via the Label Propagation algorithm with patch feature representation from Transformers.
In particular, the authors utilize keys from the last ViT-B layer for feature representation wh... | Recommendation: 3: reject, not good enough | Area: Unsupervised and Self-supervised learning | Review:
In this paper, the authors try to address the multi-instance interactive segmentation task instead of salient interactive segmentation via the Label Propagation algorithm with patch feature representation from Transformers.
In particular, the authors utilize keys from the last ViT-B layer for feature represent... |
This paper studies offline multi-objective reinforcement learning (offline MORL). In the first half of the paper, the authors introduce a new benchmarking dataset. For 6 tasks it contains trajectories with different preferences, where for each preference we have data from an expert policy (with similar preference profi... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper studies offline multi-objective reinforcement learning (offline MORL). In the first half of the paper, the authors introduce a new benchmarking dataset. For 6 tasks it contains trajectories with different preferences, where for each preference we have data from an expert policy (with similar preferen... |
Sparse Mixture-of-Experts (SMoE) have been widely used to increase the representation capacity of transformers with similar computational cost as dense transformers. SMoE consists of many experts, only few of which are activate for any given input example. This increased representational power comes with two issues:
(... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
Sparse Mixture-of-Experts (SMoE) have been widely used to increase the representation capacity of transformers with similar computational cost as dense transformers. SMoE consists of many experts, only few of which are activate for any given input example. This increased representational power comes with two is... |
This paper studies a new performance measuring method that measures the performance of a collection of models when evaluated on a single input point. The authors compare the models' average performance on the test distribution and their pointwise performance on an individual point. The empirical results show that for s... | Recommendation: 6: marginally above the acceptance threshold | Area: General Machine Learning | Review:
This paper studies a new performance measuring method that measures the performance of a collection of models when evaluated on a single input point. The authors compare the models' average performance on the test distribution and their pointwise performance on an individual point. The empirical results show th... |
The paper introduces a state abstraction method for neural episodic control. States or state-action pairs are mapped to grid coordinates and dimensionality is reduced further by random projections. The method is suitable for state spaces with a limited number of independent dimensions. The method provides better result... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper introduces a state abstraction method for neural episodic control. States or state-action pairs are mapped to grid coordinates and dimensionality is reduced further by random projections. The method is suitable for state spaces with a limited number of independent dimensions. The method provides bette... |
This paper uses the transformer to leverage a sizeable online resume dataset by pretraining and then fine-tuning it on the small and carefully constructed longitudinal survey datasets. According to the results based on their experiments, their approach shows a significant improvement compared to the current state of th... | Recommendation: 5: marginally below the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This paper uses the transformer to leverage a sizeable online resume dataset by pretraining and then fine-tuning it on the small and carefully constructed longitudinal survey datasets. According to the results based on their experiments, their approach shows a significant improvement compared to the current sta... |
The paper considers the case of population-based approaches for exploration in reinforcement learning, in particular the Quality-Diversity approach, an evolutionary algorithm to create collections of high performing solutions. The authors propose two algorithm variations of QD which take into consideration the learned ... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper considers the case of population-based approaches for exploration in reinforcement learning, in particular the Quality-Diversity approach, an evolutionary algorithm to create collections of high performing solutions. The authors propose two algorithm variations of QD which take into consideration the ... |
This paper introduces a parameterized similarity measure that shows significant improvement over existing closed-form similarity measures.
Strength:
- The paper is well-written and easy to follow.
- The method is simple yet effective.
- The empirical analysis is comprehensive.
- The provided benchmark can be... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper introduces a parameterized similarity measure that shows significant improvement over existing closed-form similarity measures.
Strength:
- The paper is well-written and easy to follow.
- The method is simple yet effective.
- The empirical analysis is comprehensive.
- The provided benchmar... |
The authors propose CO3, Cooperative Contrastive Learning, and Contextual Shape Prediction for unsupervised 3D representation learning in outdoor scenes. By using DAIR-V2X, a vehicle-infrastructure-cooperation dataset, the data mitigates challenges due to the moving objects that would make it hard to find correct corre... | Recommendation: 3: reject, not good enough | Area: Unsupervised and Self-supervised learning | Review:
The authors propose CO3, Cooperative Contrastive Learning, and Contextual Shape Prediction for unsupervised 3D representation learning in outdoor scenes. By using DAIR-V2X, a vehicle-infrastructure-cooperation dataset, the data mitigates challenges due to the moving objects that would make it hard to find corre... |
This paper proposes an adversarial training framework for resource-constrained federated learning. The proposed framework decouples the entire model into small modules to fit into the edge device memory. Adversarial training is only performed on a single module in each communication round.
Strengths:
1. The paper aims ... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes an adversarial training framework for resource-constrained federated learning. The proposed framework decouples the entire model into small modules to fit into the edge device memory. Adversarial training is only performed on a single module in each communication round.
Strengths:
1. The pap... |
This paper designs a circuit GNN (CktGNN) to facilitate the learning of circuit graphs and electronic design automation. CktGNN is a generation of the nested GNN structure to DAGs. The paper also presents a circuit benchmark dataset OCB with open-source code for automated circuit design methods evaluation.
Strength:
1.... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper designs a circuit GNN (CktGNN) to facilitate the learning of circuit graphs and electronic design automation. CktGNN is a generation of the nested GNN structure to DAGs. The paper also presents a circuit benchmark dataset OCB with open-source code for automated circuit design methods evaluation.
Stre... |
This paper tries to measure whether adding causal information to a differentiably private generative model allows for a more favorable utility-privacy tradeoff curve.
STRENGTHS
- Rather than just relying on the privacy budget (epsilon) to quantify privacy, this work uses susceptibility to a membership inference attack... | 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 tries to measure whether adding causal information to a differentiably private generative model allows for a more favorable utility-privacy tradeoff curve.
STRENGTHS
- Rather than just relying on the privacy budget (epsilon) to quantify privacy, this work uses susceptibility to a membership inferenc... |
This paper studies sparse training in a federated learning setting. The authors show that a naïve implementation has significant accuracy degradation, and they proposed a method called federated lottery-aware sparsity hunting. Experiments on ResNet-18 on MNIST, EMNIST, and CIFAR-10 show that the proposed method improve... | Recommendation: 3: reject, not good enough | Area: General Machine Learning | Review:
This paper studies sparse training in a federated learning setting. The authors show that a naïve implementation has significant accuracy degradation, and they proposed a method called federated lottery-aware sparsity hunting. Experiments on ResNet-18 on MNIST, EMNIST, and CIFAR-10 show that the proposed method... |
The paper presents an optimizer in the K-FAC family. K-FAC approximates the Fisher information matrix as the Kronecker product of two smaller matrices, by assuming independence --- they approximate E((a_{l−1} ⊗ g_l)(a_{l-1} ⊗ g_l)^T] as E[a_{l-1}a_{l-1}^T] ⊗ E[g_l g_l^T ]. The proposed algorithm, Eva, goes one step fur... | Recommendation: 5: marginally below the acceptance threshold | Area: Optimization (eg, convex and non-convex optimization) | Review:
The paper presents an optimizer in the K-FAC family. K-FAC approximates the Fisher information matrix as the Kronecker product of two smaller matrices, by assuming independence --- they approximate E((a_{l−1} ⊗ g_l)(a_{l-1} ⊗ g_l)^T] as E[a_{l-1}a_{l-1}^T] ⊗ E[g_l g_l^T ]. The proposed algorithm, Eva, goes one ... |
In this work, by redefining GCN’s depth d as a trainable parameter continuously adjustable within positive infinity and negative infinity, a simple and powerful GCN model RED-GCN is proposed to retain the simplicity of GCN and meanwhile automatically search for the optimal d without the prior knowledge regarding whethe... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
In this work, by redefining GCN’s depth d as a trainable parameter continuously adjustable within positive infinity and negative infinity, a simple and powerful GCN model RED-GCN is proposed to retain the simplicity of GCN and meanwhile automatically search for the optimal d without the prior knowledge regardin... |
This work aims to study the problem of improving the resilience of a network while trading off between network utility. The authors point out that though edge rewiring can be a promising direction for network resilience improving, existing learning-free methods are not enough due to their limitations of transduction, l... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This work aims to study the problem of improving the resilience of a network while trading off between network utility. The authors point out that though edge rewiring can be a promising direction for network resilience improving, existing learning-free methods are not enough due to their limitations of transdu... |
In this paper, authors propose a dual-level generative model, considering the individual movements and social interactions. The proposed method achieves good performance on CMU-Mocap, MuPoTS-3D, and SoMoF benchmarks.
**Strengths**:
Overall, it is a good paper with strong motivation. The method is clearly introduced and... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
In this paper, authors propose a dual-level generative model, considering the individual movements and social interactions. The proposed method achieves good performance on CMU-Mocap, MuPoTS-3D, and SoMoF benchmarks.
**Strengths**:
Overall, it is a good paper with strong motivation. The method is clearly introd... |
This draft studies the problem of continual learning with streaming data in the presence of distribution change. The data distribution is changing over time. The proposed method uses a time-varying importance weight estimator to correct the distribution change. Experiments on online supervised learning and reinforcemen... | Recommendation: 3: reject, not good enough | Area: General Machine Learning | Review:
This draft studies the problem of continual learning with streaming data in the presence of distribution change. The data distribution is changing over time. The proposed method uses a time-varying importance weight estimator to correct the distribution change. Experiments on online supervised learning and rein... |
This paper demonstrates an interpretation of DINO as a von Mises-Fisher mixture model on the unit hypersphere. Using this interpretation, the authors alter the architecture of DINO in order to incorporate a normalization term directly in the distribution, and keep the embeddings unnormalized. Using this approach, the a... | Recommendation: 8: accept, good paper | Area: Unsupervised and Self-supervised learning | Review:
This paper demonstrates an interpretation of DINO as a von Mises-Fisher mixture model on the unit hypersphere. Using this interpretation, the authors alter the architecture of DINO in order to incorporate a normalization term directly in the distribution, and keep the embeddings unnormalized. Using this approac... |
The authors address the problem of stability and plasticity in continual learning in a fully online manner. They do that by introducing the extraction of multi-scale feature maps from shallow and deep layers of a pre-trained model, a structure-wise distillation loss across multiple tasks, and a parallel normalization m... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The authors address the problem of stability and plasticity in continual learning in a fully online manner. They do that by introducing the extraction of multi-scale feature maps from shallow and deep layers of a pre-trained model, a structure-wise distillation loss across multiple tasks, and a parallel normali... |
This paper proposes a regularization method for constraining policy improvements in offline RL. The proposed regularization is based on a lower bound to the mutual information between states and actions, and attempts to mitigate the issue of distribution shift that arises when the policy is queried on out-of-distributi... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper proposes a regularization method for constraining policy improvements in offline RL. The proposed regularization is based on a lower bound to the mutual information between states and actions, and attempts to mitigate the issue of distribution shift that arises when the policy is queried on out-of-di... |
This paper propose the hybrid discrete-continuous group convolution on sphere that possess both equivariant property and computational scalability. The sparse tensor representation is used in implementation to further save computation cost and memory. Experiments are performed on spherical MNIST, Omni-SYNTHIA, 2D3DS an... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper propose the hybrid discrete-continuous group convolution on sphere that possess both equivariant property and computational scalability. The sparse tensor representation is used in implementation to further save computation cost and memory. Experiments are performed on spherical MNIST, Omni-SYNTHIA, ... |
This paper studies the low raw rank General sum Markov games, and provides two algorithms, model based and model free for finding the Nash equilibrium. In the model based algorithm, we sample state-action-next state tuples from the environment, and we estimate the transition probability directly from these tuples. In t... | Recommendation: 8: accept, good paper | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper studies the low raw rank General sum Markov games, and provides two algorithms, model based and model free for finding the Nash equilibrium. In the model based algorithm, we sample state-action-next state tuples from the environment, and we estimate the transition probability directly from these tupl... |
The paper considers empirical attacks against models protected with randomized smoothing.
The paper proposes some simple optimizations and shows to find smaller adversarial examples than other attacks.
- The paper is not particularly well motivated: the whole point of certified defenses is that we get a proof of robust... | Recommendation: 5: marginally below the acceptance threshold | Area: General Machine Learning | Review:
The paper considers empirical attacks against models protected with randomized smoothing.
The paper proposes some simple optimizations and shows to find smaller adversarial examples than other attacks.
- The paper is not particularly well motivated: the whole point of certified defenses is that we get a proof o... |
This paper proposes a simple strategy to improve DP-GANs by using more update steps for discriminator, adopting a step scheduler, and taking a larger batch size. The authors provide empirical findings to justify such improvement by linking generation quality with the discriminator accuracy though the training process. ... | Recommendation: 5: marginally below the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This paper proposes a simple strategy to improve DP-GANs by using more update steps for discriminator, adopting a step scheduler, and taking a larger batch size. The authors provide empirical findings to justify such improvement by linking generation quality with the discriminator accuracy though the training p... |
The paper studies the Semantic Audio-Visual Navigation (SAVi) and proposes the use of Knowledge-driven scene priors for encoding the object-region relations, spatial knowledge, and background knowledge to address the embodied navigation problem. The method named K-SAVEN incorporates graph encoder networks to model audi... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper studies the Semantic Audio-Visual Navigation (SAVi) and proposes the use of Knowledge-driven scene priors for encoding the object-region relations, spatial knowledge, and background knowledge to address the embodied navigation problem. The method named K-SAVEN incorporates graph encoder networks to mo... |
This work proposed a new method called Asyrp (asymmetric reverse process) to discover the semantic directions in the latent space of pre-trained diffusion models. Specifically, this work first theoretically and empirically showed that a shift added to the UNet noise prediction results in almost the same reverse process... | Recommendation: 6: marginally above the acceptance threshold | Area: Generative models | Review:
This work proposed a new method called Asyrp (asymmetric reverse process) to discover the semantic directions in the latent space of pre-trained diffusion models. Specifically, this work first theoretically and empirically showed that a shift added to the UNet noise prediction results in almost the same reverse... |
The authors introduce PackedEnsembles (PE) to improve the efficiency of deep ensembles. Although deep ensembles achieve SOTA results on a variety of benchmarks, this comes at significant inference-time and memory costs, since the same model architecture is repeated $M$ times for ensembles of size $M$. In this sense, th... | Recommendation: 8: accept, good paper | Area: General Machine Learning | Review:
The authors introduce PackedEnsembles (PE) to improve the efficiency of deep ensembles. Although deep ensembles achieve SOTA results on a variety of benchmarks, this comes at significant inference-time and memory costs, since the same model architecture is repeated $M$ times for ensembles of size $M$. In this s... |
In this paper, authors study the performance and properties of SORNs that have been exposed to the training dataset in terms of its ability to differentiate between task relevant and noise inputs. They show that these SORNs have sub-critical dynamics and can outperform RNNs at the edge of criticality in a couple of ben... | Recommendation: 3: reject, not good enough | Area: Unsupervised and Self-supervised learning | Review:
In this paper, authors study the performance and properties of SORNs that have been exposed to the training dataset in terms of its ability to differentiate between task relevant and noise inputs. They show that these SORNs have sub-critical dynamics and can outperform RNNs at the edge of criticality in a coupl... |
This paper studies how the choice of task heads influence the pretrained features z’s adaptation and hence influence the downstream performance. The authors explain feature adaptation by decomposing the learning dynamics and identify the energy and direction terms matter most. They find that the training accuracy and ... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper studies how the choice of task heads influence the pretrained features z’s adaptation and hence influence the downstream performance. The authors explain feature adaptation by decomposing the learning dynamics and identify the energy and direction terms matter most. They find that the training accur... |
This paper considers the global distribution of the dataset in deep metric learning, and introduces the skewed mean function to only considers the most considerable distances of a set of samples. The paper also proves that current energy functions are special cases of the skewed mean function. Extensive experiments are... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This paper considers the global distribution of the dataset in deep metric learning, and introduces the skewed mean function to only considers the most considerable distances of a set of samples. The paper also proves that current energy functions are special cases of the skewed mean function. Extensive experim... |
This work observes that while a pretrained language model is well-calibrated on the pretraining task as measured by ECE, it becomes poorly calibrated on downstream tasks after finetuning. It is further observed that efficient finetuning methods, such as Adapter, LoRA, and Prefix Tuning, result in better calibrated mode... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This work observes that while a pretrained language model is well-calibrated on the pretraining task as measured by ECE, it becomes poorly calibrated on downstream tasks after finetuning. It is further observed that efficient finetuning methods, such as Adapter, LoRA, and Prefix Tuning, result in better calibra... |
This paper proposes a method for enhancing the depth perception of an image. The proposed method first embeds content-independent depth perception of a scene using the visual representation learning technique, and then trains a controllable depth enhancer network based on a parametric feature rotation block (PFRB). Som... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This paper proposes a method for enhancing the depth perception of an image. The proposed method first embeds content-independent depth perception of a scene using the visual representation learning technique, and then trains a controllable depth enhancer network based on a parametric feature rotation block (PF... |
Authors extend graph signal processing techniques to cope with discrete random label noise.
Strength: Authors consider a useful application of graph signal processing to recommender systems.
Weaknesses:
* The main contributions of the paper are unclear. Is it a novel graph signal model ? Is it a novel graph signal... | Recommendation: 3: reject, not good enough | Area: General Machine Learning | Review:
Authors extend graph signal processing techniques to cope with discrete random label noise.
Strength: Authors consider a useful application of graph signal processing to recommender systems.
Weaknesses:
* The main contributions of the paper are unclear. Is it a novel graph signal model ? Is it a novel grap... |
The paper presents several large autoregressive language models trained using large datasets scraped from the web, and in particular datasets of code from GitHub. The authors evaluate the models on tasks of generating code from natural language. First, the authors show state-of-the-art results on the HumanEval dataset ... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper presents several large autoregressive language models trained using large datasets scraped from the web, and in particular datasets of code from GitHub. The authors evaluate the models on tasks of generating code from natural language. First, the authors show state-of-the-art results on the HumanEval ... |
This paper defines positive successor information in the framework of reinforcement learning, and proposes positive decorrelative nonnegative matrix factorization for dimension reduction of successor information. The paper applies the proposed method to spatial navigation and word embedding, and obtained meaningful res... | Recommendation: 6: marginally above the acceptance threshold | Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces) | Review:
This paper defines positive successor information in the framework of reinforcement learning, and proposes positive decorrelative nonnegative matrix factorization for dimension reduction of successor information. The paper applies the proposed method to spatial navigation and word embedding, and obtained meanin... |
The paper proposes to address the problem of estimating transferability from a source to the target domain by using examples from the harder subset of the target dataset. The authors introduce class-agnostic and class-specific techniques to identify harder subsets and show that the proposed method can be used with exis... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper proposes to address the problem of estimating transferability from a source to the target domain by using examples from the harder subset of the target dataset. The authors introduce class-agnostic and class-specific techniques to identify harder subsets and show that the proposed method can be used w... |
The paper introduces a reinforcement learning framework for generating a graph as a variable-length edge sequence, where a structured-aware decoder selects new edges by simulating action sequences into the future. It reviews related works, explains the methodology, and presents the settings and results of experiments. ... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper introduces a reinforcement learning framework for generating a graph as a variable-length edge sequence, where a structured-aware decoder selects new edges by simulating action sequences into the future. It reviews related works, explains the methodology, and presents the settings and results of exper... |
The kernel packet approach allows fast solution for kernel systems with a 1D Matern kernel by reducing linear algebra with the dense kernel matrix to computations with a pair of dense matrices. On tensor product grids, the tensor product of 1D Matern kernels can be treated the same way. This approach can be used for ... | Recommendation: 6: marginally above the acceptance threshold | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
The kernel packet approach allows fast solution for kernel systems with a 1D Matern kernel by reducing linear algebra with the dense kernel matrix to computations with a pair of dense matrices. On tensor product grids, the tensor product of 1D Matern kernels can be treated the same way. This approach can be u... |
The paper proposes a linear semi-supervised classification model, where the low density separation assumption is implemented via quadratic margin maximization.
It bridges supervised and unsupervised learning - the least-square support vector machine in the supervised case, the spectral clustering in the fully unsuper... | Recommendation: 8: accept, good paper | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The paper proposes a linear semi-supervised classification model, where the low density separation assumption is implemented via quadratic margin maximization.
It bridges supervised and unsupervised learning - the least-square support vector machine in the supervised case, the spectral clustering in the fully... |
This paper studies the instability of Transformers by studying the progression of attention entropy: first a decrease followed by a quick increase then a long stable phase. A strong correlation exists between the minima of attention entropy and training stability. In the study, decreasing learning rate and increasing t... | Recommendation: 3: reject, not good enough | Area: Optimization (eg, convex and non-convex optimization) | Review:
This paper studies the instability of Transformers by studying the progression of attention entropy: first a decrease followed by a quick increase then a long stable phase. A strong correlation exists between the minima of attention entropy and training stability. In the study, decreasing learning rate and incr... |
The paper presents a new method for model-based offline RL.\
It uses both a simple uncertainty estimate based on the modeling error instead of an ensemble-based uncertainty estimate of the model, and maximizes the entropy of the model outside the data distribution. \
The method is tested on multiple datasets from two d... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper presents a new method for model-based offline RL.\
It uses both a simple uncertainty estimate based on the modeling error instead of an ensemble-based uncertainty estimate of the model, and maximizes the entropy of the model outside the data distribution. \
The method is tested on multiple datasets fr... |
This work presents the analysis that decision boundary is of critical importance to the performance of few-shot demonstrations and the traditional decision boundary leads to the fragility of prompting LMs. The authors propose prototypical calibration to adaptively learn a more robust decision boundary for few-shot lear... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This work presents the analysis that decision boundary is of critical importance to the performance of few-shot demonstrations and the traditional decision boundary leads to the fragility of prompting LMs. The authors propose prototypical calibration to adaptively learn a more robust decision boundary for few-s... |
the paper proposes a method that combines transfer learning (based on fitting linear model on pretrained features), secure aggregation, and differentially private mechanisms, to achieve secure and private machine learning. authors empirically compare against DP-FL and claim performance improvements in the large user re... | 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 method that combines transfer learning (based on fitting linear model on pretrained features), secure aggregation, and differentially private mechanisms, to achieve secure and private machine learning. authors empirically compare against DP-FL and claim performance improvements in the large... |
This paper studies black-box optimization and proposes BONET, which is a generative pre-trained model from offline datasets. An autoregressive model on fixed-length trajectories is trained, and a sampling strategy is designed to synthesize trajectories from offline data using a simple heuristic of rolling out monotonic... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper studies black-box optimization and proposes BONET, which is a generative pre-trained model from offline datasets. An autoregressive model on fixed-length trajectories is trained, and a sampling strategy is designed to synthesize trajectories from offline data using a simple heuristic of rolling out m... |
The paper describes a 3D scene representation built from 2D observations.
The representation allows the decomposition of static and movable objects in the scene, and can support tasks including novel view synthesis, 3D instance segmentation, and object-level scene editing. The authors propose a self-supervised traini... | Recommendation: 6: marginally above the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
The paper describes a 3D scene representation built from 2D observations.
The representation allows the decomposition of static and movable objects in the scene, and can support tasks including novel view synthesis, 3D instance segmentation, and object-level scene editing. The authors propose a self-supervise... |
The paper presents a novel and generic framework Planning-guided self-Imitation learning for Goal-conditioned policies (PIG) to improve the sample efficiency of goal-conditioned RL (GCRL). Empirical results show that PIG significantly boosts the performance of the existing GCRL methods under various goal-reaching tasks... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper presents a novel and generic framework Planning-guided self-Imitation learning for Goal-conditioned policies (PIG) to improve the sample efficiency of goal-conditioned RL (GCRL). Empirical results show that PIG significantly boosts the performance of the existing GCRL methods under various goal-reachi... |
This paper describes a method that can generate a sets of molecules that approximately match an input 3D "shape". The method employs an autoregressive encoder-decoder architecture that learns a representation of the input shape (VN-DGCNN) and partial graph and decodes an updated molecule graph with an additional atom ... | Recommendation: 6: marginally above the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This paper describes a method that can generate a sets of molecules that approximately match an input 3D "shape". The method employs an autoregressive encoder-decoder architecture that learns a representation of the input shape (VN-DGCNN) and partial graph and decodes an updated molecule graph with an addition... |
The paper proposes Classwise Separability Discriminant (CSD), an unlearnable strategy to transfer the unlearnable effects (perturbations to avoid unauthorized data usage) to other training settings and datasets by enhancing the linear separability. Experiments showcase transferability of the proposed unlearnable exampl... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper proposes Classwise Separability Discriminant (CSD), an unlearnable strategy to transfer the unlearnable effects (perturbations to avoid unauthorized data usage) to other training settings and datasets by enhancing the linear separability. Experiments showcase transferability of the proposed unlearnabl... |
This paper studies how to leverage deep active learning to infer the existence of directed connections in dynamic systems. The authors propose a framework called Active Learning based Structural Inference (ALaSI). The authors design inter- and out-of-scope operations to make ALaSI scalable, and evaluate the framework o... | Recommendation: 6: marginally above the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This paper studies how to leverage deep active learning to infer the existence of directed connections in dynamic systems. The authors propose a framework called Active Learning based Structural Inference (ALaSI). The authors design inter- and out-of-scope operations to make ALaSI scalable, and evaluate the fra... |
The paper presents a method for training gradient-boosted trees with fairness constraints via a (proxy) Lagrangian approach. They provide an algorithm, an open-source implementation, and empirical results on two datasets (only one appears to be open-source) showing that the proposed algorithm generally improves over ex... | 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 presents a method for training gradient-boosted trees with fairness constraints via a (proxy) Lagrangian approach. They provide an algorithm, an open-source implementation, and empirical results on two datasets (only one appears to be open-source) showing that the proposed algorithm generally improves... |
Subtokenization is one of the unsung heroes of application of deep learning to code. The paper fills the gap by systematically investigating the results of several subtokenization approaches: BPE, UnigramLM, punctuation combination, native, and systematically reports statistics.
(+) Studies an important under-studied p... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
Subtokenization is one of the unsung heroes of application of deep learning to code. The paper fills the gap by systematically investigating the results of several subtokenization approaches: BPE, UnigramLM, punctuation combination, native, and systematically reports statistics.
(+) Studies an important under-s... |
This paper conducts an empirical study of existing unsupervised pre-training methods for RL. Specifically, this paper focuses on successor features (SFs) and forward-backward representation (FB). The paper uses a variety of existing unsupervised representation learning methods as a way to provide state features for SFs... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper conducts an empirical study of existing unsupervised pre-training methods for RL. Specifically, this paper focuses on successor features (SFs) and forward-backward representation (FB). The paper uses a variety of existing unsupervised representation learning methods as a way to provide state features... |
This paper proposes a simple model to improve the GNN expressiveness by encoding a multi-hop multi-color rooted subtree. It is shown that the proposed method is more expressive than 1-WL GNNs and is efficient in terms of running time and memory usage. Experiments on several benchmarks are performed to support the claim... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This paper proposes a simple model to improve the GNN expressiveness by encoding a multi-hop multi-color rooted subtree. It is shown that the proposed method is more expressive than 1-WL GNNs and is efficient in terms of running time and memory usage. Experiments on several benchmarks are performed to support t... |
This work considers the problem in offline meta-reinforcement learning, where there is a distribution shift between the contexts seen in the offline data, and the contexts obtained by online roll-outs. This work first offers some formal characterizations of this shift, and then uses these characterizations to motivate ... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This work considers the problem in offline meta-reinforcement learning, where there is a distribution shift between the contexts seen in the offline data, and the contexts obtained by online roll-outs. This work first offers some formal characterizations of this shift, and then uses these characterizations to m... |
In this paper, the authors discuss the properties of recourse-type counterfactual explanations under model perturbation by removing a data point. Drawing a line to the impact this would have on the usefulness of recourse recommendations in a regime where data deletion occurs post-training, they specify two ways in whic... | Recommendation: 6: marginally above the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
In this paper, the authors discuss the properties of recourse-type counterfactual explanations under model perturbation by removing a data point. Drawing a line to the impact this would have on the usefulness of recourse recommendations in a regime where data deletion occurs post-training, they specify two ways... |
This paper proposes a new neural network architecture which is radial: instead of pointwise activation, the activation is applied to the whole layer which rescales the output vector according to its norm. Universal approximation results are shown, with additional model compression algorithms.
Strength:
1, the proposed... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper proposes a new neural network architecture which is radial: instead of pointwise activation, the activation is applied to the whole layer which rescales the output vector according to its norm. Universal approximation results are shown, with additional model compression algorithms.
Strength:
1, the ... |
This paper studies the problem of multi-agent RL under state uncertainty, by formulating the state uncertainties as an adversary and formulating the problem into a Markov game. Sufficient conditions are established under which an equilibrium exists for such a Markov game. Furthermore, both a value-based method and a po... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper studies the problem of multi-agent RL under state uncertainty, by formulating the state uncertainties as an adversary and formulating the problem into a Markov game. Sufficient conditions are established under which an equilibrium exists for such a Markov game. Furthermore, both a value-based method ... |
This paper proposes a cross-modal knowledge distillation framework for mutli-view 3D object detection, with a 3D point cloud detector as teacher and an image detector as student. The proposed method unifies different modalities in the BEV space and conducts knowledge distillation through the dense feature distillation... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposes a cross-modal knowledge distillation framework for mutli-view 3D object detection, with a 3D point cloud detector as teacher and an image detector as student. The proposed method unifies different modalities in the BEV space and conducts knowledge distillation through the dense feature dist... |
* This paper proposes a test-time prompt editing technique with reinforcement learning. Compare to prior methods, TEMPERA can efficiently leverage prior knowledge, adaptive to different queries, and provides an interpretable prompt for every query. This method achieves 5.33x on average improvement in sample efficiency ... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
* This paper proposes a test-time prompt editing technique with reinforcement learning. Compare to prior methods, TEMPERA can efficiently leverage prior knowledge, adaptive to different queries, and provides an interpretable prompt for every query. This method achieves 5.33x on average improvement in sample eff... |
The paper proposes to learn an energy-based conditional generative model from trajectories of multiple particles. Specifically, the model (i) uses a graph neural network to encode partial trajectories into typed relations (each type is equivalently seen as a constraint) and then (ii) uses such information to define an ... | Recommendation: 5: marginally below the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
The paper proposes to learn an energy-based conditional generative model from trajectories of multiple particles. Specifically, the model (i) uses a graph neural network to encode partial trajectories into typed relations (each type is equivalently seen as a constraint) and then (ii) uses such information to de... |
The paper proposes Analogical Networks, a method for segmenting 3D parts of objects which excel in the few-shot setting. Specifically, the method retrieves examples from a memory bank closest to the query object, then assigns correspondences between parts of the query object and those of the examples. The approach outp... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The paper proposes Analogical Networks, a method for segmenting 3D parts of objects which excel in the few-shot setting. Specifically, the method retrieves examples from a memory bank closest to the query object, then assigns correspondences between parts of the query object and those of the examples. The appro... |
The paper proposes an evidential uncertainty and diversity guided deep active learning framework for the scene graph generation task. In particular, uncertainty is estimated by coupling evidential deep learning (EDL) and global relationship mining. Also, a context blocking module (CBM) and image blocking module (IBM) a... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper proposes an evidential uncertainty and diversity guided deep active learning framework for the scene graph generation task. In particular, uncertainty is estimated by coupling evidential deep learning (EDL) and global relationship mining. Also, a context blocking module (CBM) and image blocking module... |
The authors propose a gradient-free adversarial training technique called AutoJoin, which attaches a denoising autoencoder to the original regression model. It shows superior performance compared with the baselines on the benchmarks. The joint learning of steering and denoising reinforce each other.
## Strength
1. Thi... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The authors propose a gradient-free adversarial training technique called AutoJoin, which attaches a denoising autoencoder to the original regression model. It shows superior performance compared with the baselines on the benchmarks. The joint learning of steering and denoising reinforce each other.
## Strength... |
The paper considers the stochastic bandit learning problem when the algorithm has access to information regarding historical actions and their corresponding rewards. By leveraging already available information regarding the rewards from historical actions, a bandit algorithm can obtain significantly improved regret ove... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper considers the stochastic bandit learning problem when the algorithm has access to information regarding historical actions and their corresponding rewards. By leveraging already available information regarding the rewards from historical actions, a bandit algorithm can obtain significantly improved re... |
This paper questions the widespread argument/intuition for the success of contrastive learning that a good augmentation must be label preserving. The paper argues that label-destroying augmentations may be important for contrastive learning to learn diverse general purpose representations. It further hypothesizes that ... | Recommendation: 5: marginally below the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
This paper questions the widespread argument/intuition for the success of contrastive learning that a good augmentation must be label preserving. The paper argues that label-destroying augmentations may be important for contrastive learning to learn diverse general purpose representations. It further hypothesiz... |
The authors work on the problem of generating multiple interest embedding to represent user interest across multiple topics via sequence modeling through user’s sequential actions. The main contribution compared to the previous papers is that the authors learns a set of weights to represent the preference over each clu... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The authors work on the problem of generating multiple interest embedding to represent user interest across multiple topics via sequence modeling through user’s sequential actions. The main contribution compared to the previous papers is that the authors learns a set of weights to represent the preference over ... |
The paper considers the problem of accelerating the sampling process of the classifier-guided diffusion models. The classifier-guided diffusion consists of two components: the conditional function (gradient of classifier) and the standard diffusion term. The authors observe that high-order numerical solvers can lead to... | Recommendation: 6: marginally above the acceptance threshold | Area: Generative models | Review:
The paper considers the problem of accelerating the sampling process of the classifier-guided diffusion models. The classifier-guided diffusion consists of two components: the conditional function (gradient of classifier) and the standard diffusion term. The authors observe that high-order numerical solvers can... |
The paper proposes a brand-new few-shot class-incremental learning method called soft-subNetworks (SoftNet). The two main problems in few-shot class-incremental learning contains catastrophic forgetting and overfitting. The former one asks the new session training not to interfering the former session and the latter on... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The paper proposes a brand-new few-shot class-incremental learning method called soft-subNetworks (SoftNet). The two main problems in few-shot class-incremental learning contains catastrophic forgetting and overfitting. The former one asks the new session training not to interfering the former session and the l... |
The work tackles the problem of error detection in semantic segmentation. The naive approach of training a binary pixel-wise classifier on the image and the corresponding semantic map (produced by a segmentation network) is extended by perturbing the semantic map with a three types of straightforward transformations. T... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The work tackles the problem of error detection in semantic segmentation. The naive approach of training a binary pixel-wise classifier on the image and the corresponding semantic map (produced by a segmentation network) is extended by perturbing the semantic map with a three types of straightforward transforma... |
In this work, the authors introduce a model-based quality diversity (QD) approach, which aims to both solve a problem whilst inducing diverse solutions. To do this, the authors perform several rounds of quality diversity optimization over their population inside the world model, and further augment a subset of the popu... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
In this work, the authors introduce a model-based quality diversity (QD) approach, which aims to both solve a problem whilst inducing diverse solutions. To do this, the authors perform several rounds of quality diversity optimization over their population inside the world model, and further augment a subset of ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.