review stringlengths 5 16.6k | score stringclasses 5
values | area stringclasses 12
values | text stringlengths 31 5.65k |
|---|---|---|---|
The authors study the phenomenon of neural collapse (NC) under several variants of the layer-peeled model. Since features from modern networks are the outcome of some non-negative activation functions, such as ReLU, the paper first considers the case of non-negative features and shows that label smoothing also produce... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The authors study the phenomenon of neural collapse (NC) under several variants of the layer-peeled model. Since features from modern networks are the outcome of some non-negative activation functions, such as ReLU, the paper first considers the case of non-negative features and shows that label smoothing also... |
The paper presents a Maximum Entropy Information Bottleneck (MEIB), which is a different take on the information bottleneck compared to the well-known variational information bottleneck.
I liked very much the idea, both the simplicity and the motivation behind it. I also found very intriguing the property of MEIB be... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The paper presents a Maximum Entropy Information Bottleneck (MEIB), which is a different take on the information bottleneck compared to the well-known variational information bottleneck.
I liked very much the idea, both the simplicity and the motivation behind it. I also found very intriguing the property of... |
This paper aims to verify the existence of vocoder fingerprints by training a classifier to identify the sources of generated audio waveforms. The authors analyzed the distinguishability of different vocoders from four aspects: (1) vocoders with different architectures, (2) vocoders trained on different datasets, (3) v... | 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 aims to verify the existence of vocoder fingerprints by training a classifier to identify the sources of generated audio waveforms. The authors analyzed the distinguishability of different vocoders from four aspects: (1) vocoders with different architectures, (2) vocoders trained on different dataset... |
This paper focuses on few-shot anomaly detection where only a few normal samples are available in training. The new method leverages contrastive learning to transfer pre-trained from the source domain to target domains supported by few-shot samples. In addition, the instance positive pair loss is used to tight up norma... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper focuses on few-shot anomaly detection where only a few normal samples are available in training. The new method leverages contrastive learning to transfer pre-trained from the source domain to target domains supported by few-shot samples. In addition, the instance positive pair loss is used to tight ... |
This paper is about multivariate time series forecasting with structure learning. Existing works usually assume the graph structure of the multiple time series is given or learned by
the node similarity. However, in some applications, the relationship between time series can be much more complicated and the graph stru... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper is about multivariate time series forecasting with structure learning. Existing works usually assume the graph structure of the multiple time series is given or learned by
the node similarity. However, in some applications, the relationship between time series can be much more complicated and the gr... |
This draft considers the problem of online learning with label shift in the presence of additional conditional shift. In addition to the change in the class-priors $\Pr[y]$, the posterior probability $\Pr[x|y]$ can also change over time. Based on the previous work of Wu et al. (2021), the authors propose three heuristi... | Recommendation: 3: reject, not good enough | Area: General Machine Learning | Review:
This draft considers the problem of online learning with label shift in the presence of additional conditional shift. In addition to the change in the class-priors $\Pr[y]$, the posterior probability $\Pr[x|y]$ can also change over time. Based on the previous work of Wu et al. (2021), the authors propose three ... |
This work focused on adversarial MDPs with switching costs. The author proposed the SEEDs algorithms and provided a $O(T^{2/3})$ regret guarantee for both known and unknown transitions. In addition, the author also provided a theoretical guarantee for the lower regret bound, which suggests the proposed SEEDs algorithms... | Recommendation: 8: accept, good paper | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This work focused on adversarial MDPs with switching costs. The author proposed the SEEDs algorithms and provided a $O(T^{2/3})$ regret guarantee for both known and unknown transitions. In addition, the author also provided a theoretical guarantee for the lower regret bound, which suggests the proposed SEEDs al... |
This work proposes to replace hand-written prompts used in CLIP style models with GPT-generated prompts for zero-shot image classification. The authors show that their approach (CuPL) of using LLMs to generate diverse text prompts, can improve classification accuracy while removing the need for hand-crafted prompts.
St... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This work proposes to replace hand-written prompts used in CLIP style models with GPT-generated prompts for zero-shot image classification. The authors show that their approach (CuPL) of using LLMs to generate diverse text prompts, can improve classification accuracy while removing the need for hand-crafted pro... |
The work focuses on learning representation for offline reinforcement learning. The authors propose a representation learning method based on cloning the behaviour under which the offline dataset was collected. The main motivations of the work is to (1) reduce the difficulty of learning a policy from limited high-dimen... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The work focuses on learning representation for offline reinforcement learning. The authors propose a representation learning method based on cloning the behaviour under which the offline dataset was collected. The main motivations of the work is to (1) reduce the difficulty of learning a policy from limited hi... |
The authors are interested in the long-term engagement of users in recommender systems, which is less studied than immediate engagement. To optimize this long-term engagement in sequential recommendation, they resort reinforcement learning (RL). However, directly applying RL methods to recommender systems can be expens... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The authors are interested in the long-term engagement of users in recommender systems, which is less studied than immediate engagement. To optimize this long-term engagement in sequential recommendation, they resort reinforcement learning (RL). However, directly applying RL methods to recommender systems can b... |
This paper proposes a self-supervised approach for training a speech enhancement network, given data from an inertial measurement unit (IMU) and audio recorded from an earphone microphone. The IMU captures a nonlinear and lower-frequency version of the user's speech through the bone condution channel. The proposed appr... | Recommendation: 5: marginally below the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
This paper proposes a self-supervised approach for training a speech enhancement network, given data from an inertial measurement unit (IMU) and audio recorded from an earphone microphone. The IMU captures a nonlinear and lower-frequency version of the user's speech through the bone condution channel. The propo... |
This paper proposes a new knowledge graph reasoning (KGR) model that combines embedding-based and rule-based methods. The authors claim that this is the first attempt to embed entities, relations, and logical rules into a unified space for KGR.
## Strength
1. The idea of embedding both knowledge graphs and logical rule... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This paper proposes a new knowledge graph reasoning (KGR) model that combines embedding-based and rule-based methods. The authors claim that this is the first attempt to embed entities, relations, and logical rules into a unified space for KGR.
## Strength
1. The idea of embedding both knowledge graphs and logi... |
This paper analyzes the denoising score matching objective used to train diffusion models, which have recently become the dominating class of deep generative models. The paper argues that at intermediate perturbation levels the denoising score matching objective is particularly noisy and "unstable", because one perturb... | Recommendation: 6: marginally above the acceptance threshold | Area: Generative models | Review:
This paper analyzes the denoising score matching objective used to train diffusion models, which have recently become the dominating class of deep generative models. The paper argues that at intermediate perturbation levels the denoising score matching objective is particularly noisy and "unstable", because one... |
This paper focuses on the task of 3D object detection with only a small portion of labeled data. Conventional active learning-based approaches show a promising solution, but they fail to balance the trade-off between point cloud informativeness and box-level annotation costs. To overcome this limitation, this paper joi... | Recommendation: 6: marginally above the acceptance threshold | Area: General Machine Learning | Review:
This paper focuses on the task of 3D object detection with only a small portion of labeled data. Conventional active learning-based approaches show a promising solution, but they fail to balance the trade-off between point cloud informativeness and box-level annotation costs. To overcome this limitation, this p... |
This paper proposes an approximation of the hypergeometric distribution that introduces a differentiable hyperparameter. The benefit is that, in machine learning algorithms where data may fall into discrete categories, the number and size of the categories is potentially learnable with gradient methods. The paper illus... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes an approximation of the hypergeometric distribution that introduces a differentiable hyperparameter. The benefit is that, in machine learning algorithms where data may fall into discrete categories, the number and size of the categories is potentially learnable with gradient methods. The pap... |
The paper studies the problem of reducing the memory consumption of pre-trained GPT-like models via post-training quantization methods. These models often have billions or even hundreds of billions of parameters, making the compression overhead also a big cost. To address this issue, the paper introduces layer-by-layer... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper studies the problem of reducing the memory consumption of pre-trained GPT-like models via post-training quantization methods. These models often have billions or even hundreds of billions of parameters, making the compression overhead also a big cost. To address this issue, the paper introduces layer-... |
The paper extended weakly supervised image scene graph generation to videos, and presented a new task of weakly supervised video scene graph generation, where a model must learn from unlocalized scene graphs on a sparse set of video frames. In tandem with the new task, the paper also proposed an interesting solution. T... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper extended weakly supervised image scene graph generation to videos, and presented a new task of weakly supervised video scene graph generation, where a model must learn from unlocalized scene graphs on a sparse set of video frames. In tandem with the new task, the paper also proposed an interesting sol... |
In this work, the authors propose Deep Graph Ensemble (DGE) to tackle the additional information available in higher order networks $-$ something which standard Message Passing GNNs methods are unable to process without loss of information. The authors propose to do this by leveraging an ensemble of standard MPNNs - wh... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
In this work, the authors propose Deep Graph Ensemble (DGE) to tackle the additional information available in higher order networks $-$ something which standard Message Passing GNNs methods are unable to process without loss of information. The authors propose to do this by leveraging an ensemble of standard MP... |
This paper tackles the problem of video prediction: given a video, the aim is to predict the future frames. This is a challenging problem as it requires learning the dynamics of the scene content in addition to the content itself. The authors argue that the classical autoregressive paradigm is both inconsistent with ma... | Recommendation: 8: accept, good paper | Area: Generative models | Review:
This paper tackles the problem of video prediction: given a video, the aim is to predict the future frames. This is a challenging problem as it requires learning the dynamics of the scene content in addition to the content itself. The authors argue that the classical autoregressive paradigm is both inconsistent... |
In this paper, a lightweight blind source separation model (TDANet) is presented. The model is inspired from the brain’s top-down attention architecture. The separation is carried out using an embedder, a separation and a decoder (with the same parameters for all speakers) on the time samples.
The model is consiste... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
In this paper, a lightweight blind source separation model (TDANet) is presented. The model is inspired from the brain’s top-down attention architecture. The separation is carried out using an embedder, a separation and a decoder (with the same parameters for all speakers) on the time samples.
The model is ... |
This paper builds connections between existing diffusion models such as DDPM with serial reproduction paradigm. One major conclusion is that, current diffusion models can be explained as a natural consequence of this connection correspondence. Simulations on the MNIST dataset shows that the connection can be utilized f... | Recommendation: 6: marginally above the acceptance threshold | Area: Generative models | Review:
This paper builds connections between existing diffusion models such as DDPM with serial reproduction paradigm. One major conclusion is that, current diffusion models can be explained as a natural consequence of this connection correspondence. Simulations on the MNIST dataset shows that the connection can be ut... |
The paper proposes a new kind of tensor decomposition (TD) framework for non-negative tensors which is inspired by many-body interactions in physics. Unlike most traditional TDs which are hard to fit since they correspond to non-convex optimization problems, the proposed framework corresponds to a *convex* optimization... | Recommendation: 8: accept, good paper | Area: General Machine Learning | Review:
The paper proposes a new kind of tensor decomposition (TD) framework for non-negative tensors which is inspired by many-body interactions in physics. Unlike most traditional TDs which are hard to fit since they correspond to non-convex optimization problems, the proposed framework corresponds to a *convex* opti... |
In this paper, the authors proposed the spike-efficiency measurement for spiking neural networks and showed the relationship between spike-efficiency and the heterogeneity. They also performed some empirical experiments to demonstrate the significance of neuronal and synaptic heterogeneity in reducing spiking activity.... | Recommendation: 6: marginally above the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
In this paper, the authors proposed the spike-efficiency measurement for spiking neural networks and showed the relationship between spike-efficiency and the heterogeneity. They also performed some empirical experiments to demonstrate the significance of neuronal and synaptic heterogeneity in reducing spiking a... |
This paper first analyzes the relationship between ensemble and mixup and empirically shows that both have some similarities in terms of their decision boundary --- there is some uncertainty region for mixup and ensemble, that is not seen in vanilla training. Then, the paper proposes a Test-Time mixup technique that al... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper first analyzes the relationship between ensemble and mixup and empirically shows that both have some similarities in terms of their decision boundary --- there is some uncertainty region for mixup and ensemble, that is not seen in vanilla training. Then, the paper proposes a Test-Time mixup technique... |
This paper inspects MIM pre-training approaches and finds MIM essentially helps the model to learn better middle-order interactions between patches. Motivated by that, this paper proposes a novel MIM-based method, dubbed A$^2$MIM, that works well for both (small-sized) ConvNets & ViTs. Extensive experiments are conduct... | Recommendation: 8: accept, good paper | Area: Unsupervised and Self-supervised learning | Review:
This paper inspects MIM pre-training approaches and finds MIM essentially helps the model to learn better middle-order interactions between patches. Motivated by that, this paper proposes a novel MIM-based method, dubbed A$^2$MIM, that works well for both (small-sized) ConvNets & ViTs. Extensive experiments are... |
The paper proposes an approach to augment a ML model's training process when ground truth explanations (in this case, subsets of relevant features) are available. The approach is based on encouraging a model's learned representation to be similar with the full input and with the subset of relevant features.
--- Strengt... | Recommendation: 5: marginally below the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
The paper proposes an approach to augment a ML model's training process when ground truth explanations (in this case, subsets of relevant features) are available. The approach is based on encouraging a model's learned representation to be similar with the full input and with the subset of relevant features.
---... |
The paper provides a convergence analysis of Neural TD Learning with a projection onto a ball of fixed radius around the initial point.
The paper provides some new results on the convergence of TD learnign with neural network.
The results seem interesting.
Weaknesses of the paper are summarized as follows:
1) The de... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
The paper provides a convergence analysis of Neural TD Learning with a projection onto a ball of fixed radius around the initial point.
The paper provides some new results on the convergence of TD learnign with neural network.
The results seem interesting.
Weaknesses of the paper are summarized as follows:
1... |
This work tries to develop an upper bound of the robust risk and design a new algorithm for
adversarial training called ARoW which minimizes a surrogate version of the developed upper bound.
Strength:
1. Well-written
2. Claim both theoretical and empirical contributions
Weakness:
1. **(1)** I guess Equation A.1 should... | 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 work tries to develop an upper bound of the robust risk and design a new algorithm for
adversarial training called ARoW which minimizes a surrogate version of the developed upper bound.
Strength:
1. Well-written
2. Claim both theoretical and empirical contributions
Weakness:
1. **(1)** I guess Equation A.... |
The paper studies the problem of simultaneously predicting times and location of *multiple* (fixed number of) future events with a neural spatio-temporal point process model.
The proposed model is based on an encoder-decoder transformer architecture, and the distribution of the future events is modeled by
**Strengths:... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The paper studies the problem of simultaneously predicting times and location of *multiple* (fixed number of) future events with a neural spatio-temporal point process model.
The proposed model is based on an encoder-decoder transformer architecture, and the distribution of the future events is modeled by
**St... |
The authors propose TDPM, a truncated diffusion probabilistic model that essentially skips the diffusion steps by truncating the start/end of the process, stopping at an implicit non-gaussian distribution which can be sampled from another generative model. The goal is to reduce the number of steps without compromising ... | Recommendation: 8: accept, good paper | Area: Generative models | Review:
The authors propose TDPM, a truncated diffusion probabilistic model that essentially skips the diffusion steps by truncating the start/end of the process, stopping at an implicit non-gaussian distribution which can be sampled from another generative model. The goal is to reduce the number of steps without compr... |
The paper shows that the adoption of contrastive learning can improve the text-image semantic consistency and the quality of synthetic images, and the adoption of style block can enhance the fine-grained details of the images. The experiments by implementing both methods on AttnGAN and SSAGAN shows the effectiveness of... | Recommendation: 3: reject, not good enough | Area: Generative models | Review:
The paper shows that the adoption of contrastive learning can improve the text-image semantic consistency and the quality of synthetic images, and the adoption of style block can enhance the fine-grained details of the images. The experiments by implementing both methods on AttnGAN and SSAGAN shows the effectiv... |
The paper introduces truncated diffusion models, which truncates the forward process at certain timesteps so that when sampling, only a small portion of the reverse process is needed, which saves sampling time. To map noise to the noisy data at the truncated timestep, a conditional GAN is trained. The paper also builds... | Recommendation: 8: accept, good paper | Area: Generative models | Review:
The paper introduces truncated diffusion models, which truncates the forward process at certain timesteps so that when sampling, only a small portion of the reverse process is needed, which saves sampling time. To map noise to the noisy data at the truncated timestep, a conditional GAN is trained. The paper als... |
The paper proposes to use Dense Correlation Fields which is a pyramid of correlation volume of visual features. The correlation takes into account long-term correlation, and high-level semantically correlation feature. The method shows improvement over 2D CNN and 3D CNN baselines by a healthy margin.
### Pros
1. The id... | Recommendation: 5: marginally below the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper proposes to use Dense Correlation Fields which is a pyramid of correlation volume of visual features. The correlation takes into account long-term correlation, and high-level semantically correlation feature. The method shows improvement over 2D CNN and 3D CNN baselines by a healthy margin.
### Pros
1... |
This paper proposes a deep neural network to approximate the computation of the hyper-volume, which becomes expensive for a large number of objectives or points. The network has a special architecture to take into account the particularities of the hyper-volume computations such as invariances to permutations. ... | Recommendation: 6: marginally above the acceptance threshold | Area: Optimization (eg, convex and non-convex optimization) | Review:
This paper proposes a deep neural network to approximate the computation of the hyper-volume, which becomes expensive for a large number of objectives or points. The network has a special architecture to take into account the particularities of the hyper-volume computations such as invariances to permut... |
The paper explores a method for pretraining an Audio-Visual speech recognition model directly from raw video with both audio and visual signals. It does so by asymmetrically applying two student-teacher networks 1. the audio student learns to predict both audio and visual targets generated by respective teachers, 2. th... | Recommendation: 6: marginally above the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
The paper explores a method for pretraining an Audio-Visual speech recognition model directly from raw video with both audio and visual signals. It does so by asymmetrically applying two student-teacher networks 1. the audio student learns to predict both audio and visual targets generated by respective teacher... |
The paper aims to improve the numerical stability of stein mixture in variational inference. To achieve this, the proposed EBLO-within-stein method allows the choice of a class of hierarchical attractives forces indexed by the hyper-parameter $\alpha$ in the Renyi divergence. Different values of $\alpha$ acounts for di... | Recommendation: 8: accept, good paper | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
The paper aims to improve the numerical stability of stein mixture in variational inference. To achieve this, the proposed EBLO-within-stein method allows the choice of a class of hierarchical attractives forces indexed by the hyper-parameter $\alpha$ in the Renyi divergence. Different values of $\alpha$ acount... |
This paper proposes a new method to improve previous (cluster-based) important client sampling methods in federated learning. The new method is motivated by the insight that it would be beneficial to select clients from diverse groups. Convergence analysis are also provided and the authors claim they improve over exist... | Recommendation: 3: reject, not good enough | Area: Optimization (eg, convex and non-convex optimization) | Review:
This paper proposes a new method to improve previous (cluster-based) important client sampling methods in federated learning. The new method is motivated by the insight that it would be beneficial to select clients from diverse groups. Convergence analysis are also provided and the authors claim they improve ov... |
The submission proposes an online learning approach to bidding in repeated stochastic first price auctions with a global budget constraint. The main idea is to approximately learn the distribution of values and other bidders’ top bid, and then solve a DP for the optimal “non-anticipating” strategy assuming values and b... | Recommendation: 5: marginally below the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
The submission proposes an online learning approach to bidding in repeated stochastic first price auctions with a global budget constraint. The main idea is to approximately learn the distribution of values and other bidders’ top bid, and then solve a DP for the optimal “non-anticipating” strategy assuming valu... |
This paper gives lower bounds for differentially private ERM in the unconstrained and non-euclidean case. They provide a simple blackbox reduction approach to reduce lower bounds in the constrained case to unconstrained cases based on the idea of a Lipschitz extension of a function. They also give lower bounds for both... | 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 gives lower bounds for differentially private ERM in the unconstrained and non-euclidean case. They provide a simple blackbox reduction approach to reduce lower bounds in the constrained case to unconstrained cases based on the idea of a Lipschitz extension of a function. They also give lower bounds ... |
In this work authors adopt hierarchical classification for OOD detection and based on hierarchy they make predictions at varying level of granularity which could provide enhance examinability w.r.t OOD. This is indeed useful for OOD detection or open-set detection, and authors provide various qualitative & quantitative... | Recommendation: 5: marginally below the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
In this work authors adopt hierarchical classification for OOD detection and based on hierarchy they make predictions at varying level of granularity which could provide enhance examinability w.r.t OOD. This is indeed useful for OOD detection or open-set detection, and authors provide various qualitative & quan... |
The paper proposes a framework to accelerate and stabilize the process of neural network inversion. Specifically, the proposed method uses a neural network to learn a mapping between the latent spaces that allows gradient descent over the input to converge in fewer steps. Experiments show that the proposed framework ca... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper proposes a framework to accelerate and stabilize the process of neural network inversion. Specifically, the proposed method uses a neural network to learn a mapping between the latent spaces that allows gradient descent over the input to converge in fewer steps. Experiments show that the proposed fram... |
This work proposes a method to reparameterize and gaussianize the latent tensors for deep generative models such as StyleGAN2 and Glow. This idea was evaluated in a number of inverse problems such as compressive-sensing MRI, image deblurring, and eikonal tomography.
Strength:
- Unless this work clearly resolved the ... | Recommendation: 5: marginally below the acceptance threshold | Area: Generative models | Review:
This work proposes a method to reparameterize and gaussianize the latent tensors for deep generative models such as StyleGAN2 and Glow. This idea was evaluated in a number of inverse problems such as compressive-sensing MRI, image deblurring, and eikonal tomography.
Strength:
- Unless this work clearly resol... |
This paper considers the problem of distributed training of Graph Neural Networks (GNNs) over large-scale graphs. The authors proposed a framework called Distributed Graph Representation Synchronization (DIGEST), which leverages the stale representation of neighbors from other subgraphs to eliminate the information los... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper considers the problem of distributed training of Graph Neural Networks (GNNs) over large-scale graphs. The authors proposed a framework called Distributed Graph Representation Synchronization (DIGEST), which leverages the stale representation of neighbors from other subgraphs to eliminate the informa... |
The paper proposes a computational graph-based method for graph generation, in which computational graphs for nodes, used in graph neural networks to compute node-level outputs, are the generation objective, rather than the graphs themselves. To this end, the paper first balances the node-level computational graphs, i.... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The paper proposes a computational graph-based method for graph generation, in which computational graphs for nodes, used in graph neural networks to compute node-level outputs, are the generation objective, rather than the graphs themselves. To this end, the paper first balances the node-level computational gr... |
This paper presents an approach for variational inference on large-scale hierarchical models which takes advantage of conditional independence in plate structures to factorise its variational approximations and better scale with problem dimensionality. The proposed framework is based on normalising flows taking shared ... | Recommendation: 5: marginally below the acceptance threshold | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
This paper presents an approach for variational inference on large-scale hierarchical models which takes advantage of conditional independence in plate structures to factorise its variational approximations and better scale with problem dimensionality. The proposed framework is based on normalising flows taking... |
The paper covers a novel approach to understanding neural networks in terms of an "object view" (the activations of the network given the input representation of an object) and the "class view" (the set of weights between the neurons and the class outputs----I think). In addition the paper introduces an intermediate r... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The paper covers a novel approach to understanding neural networks in terms of an "object view" (the activations of the network given the input representation of an object) and the "class view" (the set of weights between the neurons and the class outputs----I think). In addition the paper introduces an interm... |
This paper proposes a test-time normalization (TTN) method that combines the normalization statistics of source domain and target domain (during test), by adjusting the importance between them according to the domain-shift sensitivity of each BN layer. The motivation of the proposed method is clear, and the comprehensi... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes a test-time normalization (TTN) method that combines the normalization statistics of source domain and target domain (during test), by adjusting the importance between them according to the domain-shift sensitivity of each BN layer. The motivation of the proposed method is clear, and the com... |
The paper addresses the need to detect backdoor poisoned data, in which a subset of training data is permuted with a watermark, resulting in some elements of a testing set being incorrectly classified. The paper first identifies an incompatibility property, in which poisoned training data does not improve model accura... | 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 addresses the need to detect backdoor poisoned data, in which a subset of training data is permuted with a watermark, resulting in some elements of a testing set being incorrectly classified. The paper first identifies an incompatibility property, in which poisoned training data does not improve mode... |
This paper presented a new method for self-supervised learning on sparse time series data. Specifically, Transformers for EHR data with self-supervised learning -- TESS was proposed with an input binning scheme and a combination of both missingness masks and event values. Experimental analysis on two public EHR dataset... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper presented a new method for self-supervised learning on sparse time series data. Specifically, Transformers for EHR data with self-supervised learning -- TESS was proposed with an input binning scheme and a combination of both missingness masks and event values. Experimental analysis on two public EHR... |
This paper proposes a novel adversarial training approach, which can increase the logit margin without losing too much clean accuracy. The authors discover that the logit margin of traditional adversarial training has two peaks. Based on this, they designed a switching mechanism and a novel margin loss function (OVR) t... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper proposes a novel adversarial training approach, which can increase the logit margin without losing too much clean accuracy. The authors discover that the logit margin of traditional adversarial training has two peaks. Based on this, they designed a switching mechanism and a novel margin loss function... |
The authors propose some extensions to existing work on VQ-VIB architecture for modeling EC with a more explicitly information theoretic framework. Namely, they extend the number of tokens which are chosen, and in doing so combine two threads of EC research -- existing VQ-VIB, and more traditional RNN/sequential type ... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The authors propose some extensions to existing work on VQ-VIB architecture for modeling EC with a more explicitly information theoretic framework. Namely, they extend the number of tokens which are chosen, and in doing so combine two threads of EC research -- existing VQ-VIB, and more traditional RNN/sequenti... |
This paper proposes a method which can adapt a testing graph for best performance with some pretrained GNN model. It finds this change to the test graph by jointly optimizing the feature and adjacency matrices via projected gradient descent to maximize a self-supervised loss (basically drop edge + DGI) over the test g... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper proposes a method which can adapt a testing graph for best performance with some pretrained GNN model. It finds this change to the test graph by jointly optimizing the feature and adjacency matrices via projected gradient descent to maximize a self-supervised loss (basically drop edge + DGI) over th... |
This paper introduces Clifford neural layers for both convolution and Fourier operations in the context of deep learning. The main motivation is that Clifford algebras can describe the algebraic property (e.g. multiplication, addition) of multivector fields consisting scalar, vector, as well as higher-order components.... | Recommendation: 8: accept, good paper | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This paper introduces Clifford neural layers for both convolution and Fourier operations in the context of deep learning. The main motivation is that Clifford algebras can describe the algebraic property (e.g. multiplication, addition) of multivector fields consisting scalar, vector, as well as higher-order com... |
This paper analyzes the SDE for SGD with momentum and label noise and tries to show that adding momentum accelerates the convergence but not hurting the generalization. This is an important challenge while training big models with numerous training datasets such as DNN. They show that there is an interplay between the ... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper analyzes the SDE for SGD with momentum and label noise and tries to show that adding momentum accelerates the convergence but not hurting the generalization. This is an important challenge while training big models with numerous training datasets such as DNN. They show that there is an interplay betw... |
The author has discussed the transformers models' training stability on various tasks. The author has investigated the sharpness of attention concerning attention entropy on each attention head during training. The author observes that the attention entropy first decreases then increases, and then enters into the long ... | Recommendation: 3: reject, not good enough | Area: Optimization (eg, convex and non-convex optimization) | Review:
The author has discussed the transformers models' training stability on various tasks. The author has investigated the sharpness of attention concerning attention entropy on each attention head during training. The author observes that the attention entropy first decreases then increases, and then enters into t... |
When facing an ML problem with multiple tasks, and few datapoints per task, meta learning is used as a mean to provide good results simultaneously on all tasks. Typical approaches to meta learning include 1) fine-tuning a large model for each task at hand, and 2) learning a low dimensional representation to be shared b... | Recommendation: 6: marginally above the acceptance threshold | Area: Optimization (eg, convex and non-convex optimization) | Review:
When facing an ML problem with multiple tasks, and few datapoints per task, meta learning is used as a mean to provide good results simultaneously on all tasks. Typical approaches to meta learning include 1) fine-tuning a large model for each task at hand, and 2) learning a low dimensional representation to be ... |
Neuroscientists are generating rich datasets with population recordings from multiple brain areas simultaneously while the animal is engaged in a complicated behavior. It urges for an analytical tool to extract interpretable information from these rich datasets. Latent variable models are popular approaches for generat... | Recommendation: 8: accept, good paper | Area: Neuroscience and Cognitive Science (e.g., neural coding, brain-computer interfaces) | Review:
Neuroscientists are generating rich datasets with population recordings from multiple brain areas simultaneously while the animal is engaged in a complicated behavior. It urges for an analytical tool to extract interpretable information from these rich datasets. Latent variable models are popular approaches for... |
This paper focuses on the generalization ability of graph neural networks and derives the generalization error bound based on PAC-Bayes framework. The new theoretical bound improves the state-of-the-art result, and empirical studies show that the proposed model can help to address size generalization problem on graphs.... | Recommendation: 5: marginally below the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper focuses on the generalization ability of graph neural networks and derives the generalization error bound based on PAC-Bayes framework. The new theoretical bound improves the state-of-the-art result, and empirical studies show that the proposed model can help to address size generalization problem on... |
The paper proposes a new method for improving the robustness of learning neural networks with respect to group correlations using the Gram matrix that is extracted from the output of different layers in a learned neural network.
Strength:
- This is an important problem.
- The proposed method seems to be mostly competit... | 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 new method for improving the robustness of learning neural networks with respect to group correlations using the Gram matrix that is extracted from the output of different layers in a learned neural network.
Strength:
- This is an important problem.
- The proposed method seems to be mostly ... |
This paper studies the GAN-Inversion problem. In particular, the GAN-inversion problem when the image suffers from missing or some pixels are no longer reliable. The proposed method is very simple and straightforward. A mask is introduced to the inversion optimization, and the mask has a constraint on the 0-norm. The r... | Recommendation: 6: marginally above the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
This paper studies the GAN-Inversion problem. In particular, the GAN-inversion problem when the image suffers from missing or some pixels are no longer reliable. The proposed method is very simple and straightforward. A mask is introduced to the inversion optimization, and the mask has a constraint on the 0-nor... |
This work proposes a method to bound a notion of risk that is measured in terms of quantiles, called "quantile-based risk measures (QBRM)". For a given predictor, a distribution over loss values is induced, and this paper shows that a lower bound of the CDF of this distribution serves as an upper bound of any QBRM of t... | Recommendation: 6: marginally above the acceptance threshold | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This work proposes a method to bound a notion of risk that is measured in terms of quantiles, called "quantile-based risk measures (QBRM)". For a given predictor, a distribution over loss values is induced, and this paper shows that a lower bound of the CDF of this distribution serves as an upper bound of any Q... |
This paper proposes to use Bayes Risk factors to control specific characteristics of CTC alignments. Specifically, the proposed method encourages the model to move the non-blank predictions towards the beginning of the output sequence. This shift of non-blank predictions enables speed-ups both in offline and online inf... | Recommendation: 8: accept, good paper | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposes to use Bayes Risk factors to control specific characteristics of CTC alignments. Specifically, the proposed method encourages the model to move the non-blank predictions towards the beginning of the output sequence. This shift of non-blank predictions enables speed-ups both in offline and on... |
The paper deals with the problem of learning heuristic function for A*, a popular heuristic search algorithm that can guarantee optimality of solutions and expands the minimal number of states. The paper proposes L*, a loss function tailored for A* which minimizes an upper bound on the number of expanded states. The pa... | Recommendation: 5: marginally below the acceptance threshold | Area: General Machine Learning | Review:
The paper deals with the problem of learning heuristic function for A*, a popular heuristic search algorithm that can guarantee optimality of solutions and expands the minimal number of states. The paper proposes L*, a loss function tailored for A* which minimizes an upper bound on the number of expanded states... |
The author(s) formulated the objective of the federated learning problem as a bi-level optimization problem. The author(s) proposed an algorithm that solve the bi-level optimization problems with stochastic gradient oracle. Convergence analysis of the proposed algorithm is given and experiments on toy and real-world da... | Recommendation: 3: reject, not good enough | Area: Optimization (eg, convex and non-convex optimization) | Review:
The author(s) formulated the objective of the federated learning problem as a bi-level optimization problem. The author(s) proposed an algorithm that solve the bi-level optimization problems with stochastic gradient oracle. Convergence analysis of the proposed algorithm is given and experiments on toy and real-... |
The paper looks at the topic of semi-supervised learning for classification, through a probabilistic lens. The starting point is the observation that many common SSL datasets (e.g. CIFAR) are assembled via multi-annotator agreement protocol (images are only included if many humans agree on their class label). This lead... | Recommendation: 8: accept, good paper | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
The paper looks at the topic of semi-supervised learning for classification, through a probabilistic lens. The starting point is the observation that many common SSL datasets (e.g. CIFAR) are assembled via multi-annotator agreement protocol (images are only included if many humans agree on their class label). T... |
In this paper, the authors compare the dynamical characteristics of recurrent neural networks before and after training. Specifically, the results presented in the paper suggest that training shifts RNNs toward subcriticality. The authors suggest that this subcriticality is a signature of specialization that can potent... | Recommendation: 5: marginally below the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
In this paper, the authors compare the dynamical characteristics of recurrent neural networks before and after training. Specifically, the results presented in the paper suggest that training shifts RNNs toward subcriticality. The authors suggest that this subcriticality is a signature of specialization that ca... |
This paper proposed a personalization federated learning method (i.e., pFedFBE) by using forward-backward envelope as clients’ loss functions. It provided the convergence analysis of the proposed method, which shows the same convergence complexity results as FedAvg for FL with unconstrained smooth objectives. Numerica... | Recommendation: 3: reject, not good enough | Area: Optimization (eg, convex and non-convex optimization) | Review:
This paper proposed a personalization federated learning method (i.e., pFedFBE) by using forward-backward envelope as clients’ loss functions. It provided the convergence analysis of the proposed method, which shows the same convergence complexity results as FedAvg for FL with unconstrained smooth objectives. ... |
This paper studies the problem of sampling wrt to a distribution p* proportional to exp(-V) given access to the gradient of V. The authors consider the mean field limit of Stein Variational Gradient Descent (SVGD). More precisely, SVGD algorithm is an algorithm that relies on updating sequentially the location of a fin... | Recommendation: 3: reject, not good enough | Area: Optimization (eg, convex and non-convex optimization) | Review:
This paper studies the problem of sampling wrt to a distribution p* proportional to exp(-V) given access to the gradient of V. The authors consider the mean field limit of Stein Variational Gradient Descent (SVGD). More precisely, SVGD algorithm is an algorithm that relies on updating sequentially the location ... |
This paper tackles the problem of cross-domain few-shot learning, where the base dataset and the target domain are far away from each other. It builds upon past distillation-based frameworks, where unlabeled data from the target domain is used to distill a source teacher, pretrained on the base dataset. It introduces m... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper tackles the problem of cross-domain few-shot learning, where the base dataset and the target domain are far away from each other. It builds upon past distillation-based frameworks, where unlabeled data from the target domain is used to distill a source teacher, pretrained on the base dataset. It intr... |
The paper proposes a new Transformer based architecture to certain inverse problems in which attempt is to reconstruct the structure of inner domain from boundary measurements. The problems are important as several practical applications fall into this class (e.g. EIT, optical tomography, seismic tomography). The study... | Recommendation: 8: accept, good paper | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
The paper proposes a new Transformer based architecture to certain inverse problems in which attempt is to reconstruct the structure of inner domain from boundary measurements. The problems are important as several practical applications fall into this class (e.g. EIT, optical tomography, seismic tomography). T... |
This paper studies safe reinforcement learning (RL) where safety violation must be bounded during training. They propose a new approach that balances the trade-off between efficient progress in exploration and safety guarantee. Specifically, the proposed approach updates Dirichlet-Categorical models of the state transi... | Recommendation: 3: reject, not good enough | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper studies safe reinforcement learning (RL) where safety violation must be bounded during training. They propose a new approach that balances the trade-off between efficient progress in exploration and safety guarantee. Specifically, the proposed approach updates Dirichlet-Categorical models of the stat... |
This paper proposes and investigates the problem of meta-learning in games. In particular, it builds the framework that uses meta-learning techniques to learn Nash equilibrium sequentially for a set of games by exploiting similarities between these games. Theoretical guarantees under this framework are derived for many... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This paper proposes and investigates the problem of meta-learning in games. In particular, it builds the framework that uses meta-learning techniques to learn Nash equilibrium sequentially for a set of games by exploiting similarities between these games. Theoretical guarantees under this framework are derived ... |
In the paper, the authors introduce a method to train a continuous normalizing flow connecting two empirical distributions. They call their flow models rectified flows. These flows are trained by minimizing a simple least square objective given pairs of samples. Thereby, the flow is forced to approximately linearly int... | Recommendation: 8: accept, good paper | Area: Generative models | Review:
In the paper, the authors introduce a method to train a continuous normalizing flow connecting two empirical distributions. They call their flow models rectified flows. These flows are trained by minimizing a simple least square objective given pairs of samples. Thereby, the flow is forced to approximately line... |
This paper introduces “Sparsity May Cry” Benchmark (SMC-Bench), a collection of carefully curated 4 diverse tasks with 12 datasets, for a more general evaluation and unveiling the true potential of sparse algorithms. Evaluation reveals several important and unusual findings.
Overall, I enjoy this work a lot and think ... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
This paper introduces “Sparsity May Cry” Benchmark (SMC-Bench), a collection of carefully curated 4 diverse tasks with 12 datasets, for a more general evaluation and unveiling the true potential of sparse algorithms. Evaluation reveals several important and unusual findings.
Overall, I enjoy this work a lot an... |
This paper proposes a data-augmentation strategy to learn from demonstrations in an embodied agent setting. Two types of augmentation strategies are proposed - relabeling language instructions with a language model and changing together different tasks/trajectories to obtain a new task/trajectory. The proposed method c... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper proposes a data-augmentation strategy to learn from demonstrations in an embodied agent setting. Two types of augmentation strategies are proposed - relabeling language instructions with a language model and changing together different tasks/trajectories to obtain a new task/trajectory. The proposed ... |
The paper proposes FaiREE, a post-processing algorithm for fair classification with theoretical guarantees in a finite-sample and distribution-free manner. FaiREE can be applied to a wide range of group fairness notions, and is shown to achieve small mis-classification error while the fairness constraints. Numerical st... | 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 FaiREE, a post-processing algorithm for fair classification with theoretical guarantees in a finite-sample and distribution-free manner. FaiREE can be applied to a wide range of group fairness notions, and is shown to achieve small mis-classification error while the fairness constraints. Nume... |
This paper proposed a novel scheduled sampling algorithm to guide the training of diffusion models for markup-to-image generation. Unlike the traditional diffusion models, which sample the training data from the Markov chain quantified Gaussian distribution Q(yt|y0), the paper take the m earlier predictions into consid... | Recommendation: 3: reject, not good enough | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
This paper proposed a novel scheduled sampling algorithm to guide the training of diffusion models for markup-to-image generation. Unlike the traditional diffusion models, which sample the training data from the Markov chain quantified Gaussian distribution Q(yt|y0), the paper take the m earlier predictions int... |
This paper presents a new SOTA method SENet++ for the reduction of ReLUs for Private Inference (PI). The method is based on a novel measure of ReLU sensitivity (of a layer), a learnable mask applied at each layer, a distillation technique, and ordered channel dropout, to remove the least important ReLU operations while... | Recommendation: 8: accept, good paper | Area: Social Aspects of Machine Learning (eg, AI safety, fairness, privacy, interpretability, human-AI interaction, ethics) | Review:
This paper presents a new SOTA method SENet++ for the reduction of ReLUs for Private Inference (PI). The method is based on a novel measure of ReLU sensitivity (of a layer), a learnable mask applied at each layer, a distillation technique, and ordered channel dropout, to remove the least important ReLU operatio... |
The authors study general variational algorithms, which generalize Stein variational gradient descent (SVGD) in functional space. They generalize the functional space in minimizing the KL divergence step. They apply the algorithms in Bayesian neural networks and ensemble gradient boosting. The numerical experiments dem... | Recommendation: 5: marginally below the acceptance threshold | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
The authors study general variational algorithms, which generalize Stein variational gradient descent (SVGD) in functional space. They generalize the functional space in minimizing the KL divergence step. They apply the algorithms in Bayesian neural networks and ensemble gradient boosting. The numerical experim... |
For self-supervised learning with contrastive loss, they proposed Synchronized Contrastive Pruning (SyncCP) that have two encoders (online and offline/momentum) with different sparsity, but the difference in sparsity is maintained at $\Delta_s$. They also propose Contrastive Sparsification Index (CSI) that determines ... | Recommendation: 5: marginally below the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
For self-supervised learning with contrastive loss, they proposed Synchronized Contrastive Pruning (SyncCP) that have two encoders (online and offline/momentum) with different sparsity, but the difference in sparsity is maintained at $\Delta_s$. They also propose Contrastive Sparsification Index (CSI) that det... |
This paper proposes a large language models (LLM) to automatically generate formal proofs of mathematical statements. The idea is to use Codex or Minerva model to generate an informal proof (a proof in a natural language) and then use it as a sketch to generate a formal proof. Each claim in the sketch is a some kind of... | Recommendation: 6: marginally above the acceptance threshold | Area: Machine Learning for Sciences (eg biology, physics, health sciences, social sciences, climate/sustainability ) | Review:
This paper proposes a large language models (LLM) to automatically generate formal proofs of mathematical statements. The idea is to use Codex or Minerva model to generate an informal proof (a proof in a natural language) and then use it as a sketch to generate a formal proof. Each claim in the sketch is a some... |
This work studies the effect of using adversarially robust on generalization
error. In particular they show that the generalization error achieved by
SGDmax contains a constant term that does not tend to 0 as the sample size
increases. They show that they can remove this constant term in the error by
using a smooth v... | Recommendation: 5: marginally below the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
This work studies the effect of using adversarially robust on generalization
error. In particular they show that the generalization error achieved by
SGDmax contains a constant term that does not tend to 0 as the sample size
increases. They show that they can remove this constant term in the error by
using a ... |
This paper proposes a method to learn fair representations, where the main focus of fairness is the classic demographic parity condition. Compared with existing methods to achieve this goal, algorithmically, the main difference is that, instead of using rich neural networks as the feature encoders, the authors proposed... | 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 a method to learn fair representations, where the main focus of fairness is the classic demographic parity condition. Compared with existing methods to achieve this goal, algorithmically, the main difference is that, instead of using rich neural networks as the feature encoders, the authors ... |
The paper proposes robot taxonomy, for hierarchical classifications of the human hand postures and body poses, through Gaussian process hyperbolic latent variable models (GPHLVM) built on top of existing GPLVM and using its graph-based distance-preserving priors and back constraints. The learned hyperbolic embeddings c... | Recommendation: 6: marginally above the acceptance threshold | Area: Probabilistic Methods (eg, variational inference, causal inference, Gaussian processes) | Review:
The paper proposes robot taxonomy, for hierarchical classifications of the human hand postures and body poses, through Gaussian process hyperbolic latent variable models (GPHLVM) built on top of existing GPLVM and using its graph-based distance-preserving priors and back constraints. The learned hyperbolic embe... |
This paper combines techniques from Neural ODEs together with with prior work on polynomial projections for signal reconstruction (HiPPO). It defines a new method PolyODE that can address various problems with time series analysis such as reconstruction and forecasting, particularly for settings such as irregularly-sam... | Recommendation: 6: marginally above the acceptance threshold | Area: General Machine Learning | Review:
This paper combines techniques from Neural ODEs together with with prior work on polynomial projections for signal reconstruction (HiPPO). It defines a new method PolyODE that can address various problems with time series analysis such as reconstruction and forecasting, particularly for settings such as irregul... |
The paper proposed an efficient automated model design algorithm called FALCON. FALCON views the overall design space as a design graph. Each node in the design graph represents an individual modeling choice, which includes the model architecture and the optimization hyper-parameters such as learning rate and weight de... | Recommendation: 5: marginally below the acceptance threshold | Area: Deep Learning and representational learning | Review:
The paper proposed an efficient automated model design algorithm called FALCON. FALCON views the overall design space as a design graph. Each node in the design graph represents an individual modeling choice, which includes the model architecture and the optimization hyper-parameters such as learning rate and w... |
The paper introduces a new task called Open-vocabulary VidVRD, where the aim is to detect not only unseen relationships but also unseen objects and predicates. They propose a novel pipeline (i.e. RePro) to detect tracklets and classify the relations between tracklets. In particular, the proposed approach is a compositi... | Recommendation: 6: marginally above the acceptance threshold | Area: Applications (eg, speech processing, computer vision, NLP) | Review:
The paper introduces a new task called Open-vocabulary VidVRD, where the aim is to detect not only unseen relationships but also unseen objects and predicates. They propose a novel pipeline (i.e. RePro) to detect tracklets and classify the relations between tracklets. In particular, the proposed approach is a c... |
This paper introduces self-supervised representation learning, which combines two well-known existing methods (i.e., contrast learning and mask autoencoder learning) in a way that appropriately obtains their respective advantages. Contrastive learning with Simese networks is faster in optimization compared to mask auto... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper introduces self-supervised representation learning, which combines two well-known existing methods (i.e., contrast learning and mask autoencoder learning) in a way that appropriately obtains their respective advantages. Contrastive learning with Simese networks is faster in optimization compared to m... |
This paper studies the calibration of state-of-the-art classifiers trained using differentially private stochastic gradient descent (DP-SGD). It shows that there are miscalibration issues in these DP classifiers even when their accuracy matches that of their non-private counterparts. The likely cause of that is conject... | 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 calibration of state-of-the-art classifiers trained using differentially private stochastic gradient descent (DP-SGD). It shows that there are miscalibration issues in these DP classifiers even when their accuracy matches that of their non-private counterparts. The likely cause of that is... |
This paper aims to improve the adversarial robustness of deep models.
I. The authors observe that during traditional adversarial training, margins to the decision boundary for some examples are enlarged while margins to the decision boundary for other examples even become smaller.
II. Based on this phenomeno... | Recommendation: 6: marginally above the acceptance threshold | Area: Deep Learning and representational learning | Review:
This paper aims to improve the adversarial robustness of deep models.
I. The authors observe that during traditional adversarial training, margins to the decision boundary for some examples are enlarged while margins to the decision boundary for other examples even become smaller.
II. Based on this p... |
This paper proposes the complexity gap (CG) score, which quantifies the change in data complexity when each training instance is removed from the training set. The primary differentiator between CG score and other data valuation measures (e.g., Shapley value, C-score, etc.) is that CG score can be calculated without a... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
This paper proposes the complexity gap (CG) score, which quantifies the change in data complexity when each training instance is removed from the training set. The primary differentiator between CG score and other data valuation measures (e.g., Shapley value, C-score, etc.) is that CG score can be calculated w... |
This paper proposes a novel self-supervised learning framework called ReLIC v2. This framework builds upon ReLIC's loss and combines multicrops and background mask. The method achieves the state-of-the-art and better linear probe accuracy than supervised ResNet50.
Extensive transfer experiments and ablation study verif... | Recommendation: 6: marginally above the acceptance threshold | Area: Unsupervised and Self-supervised learning | Review:
This paper proposes a novel self-supervised learning framework called ReLIC v2. This framework builds upon ReLIC's loss and combines multicrops and background mask. The method achieves the state-of-the-art and better linear probe accuracy than supervised ResNet50.
Extensive transfer experiments and ablation stu... |
The paper proposed a Concordance-induced triplet(CIT) loss for Deep Metric Learning tasks. The major hypothesis is that the ordering concordance should be invariant to any monotone transformation of the decision boundary of triplet loss. Therefore, CIT loss should with concordance can help avoid the plague of turning t... | Recommendation: 3: reject, not good enough | Area: Optimization (eg, convex and non-convex optimization) | Review:
The paper proposed a Concordance-induced triplet(CIT) loss for Deep Metric Learning tasks. The major hypothesis is that the ordering concordance should be invariant to any monotone transformation of the decision boundary of triplet loss. Therefore, CIT loss should with concordance can help avoid the plague of t... |
This work defines correct equivariance, incorrect equivariance, and extrinsic equivariance. Correct symmetry means that the model symmetry correctly reflects a symmetry present in the ground truth function, for which it is correct to enforce equivariance constraints. Extrinsic equivariance is when the equivariant const... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This work defines correct equivariance, incorrect equivariance, and extrinsic equivariance. Correct symmetry means that the model symmetry correctly reflects a symmetry present in the ground truth function, for which it is correct to enforce equivariance constraints. Extrinsic equivariance is when the equivaria... |
The paper proposes an end-to-end architecture from transfer learning that learns a feature compensation for the input data. For this purpose, a clustering of the data is performed on a pre-processing step and the similarities between an input example and each of the clusters are used as inputs to two MLPs that essentia... | Recommendation: 3: reject, not good enough | Area: Deep Learning and representational learning | Review:
The paper proposes an end-to-end architecture from transfer learning that learns a feature compensation for the input data. For this purpose, a clustering of the data is performed on a pre-processing step and the similarities between an input example and each of the clusters are used as inputs to two MLPs that ... |
In this paper, authors revisited the depth separation theory of deep neural networks. While most of the previous paper focused on feedforward networks, this paper studied feedforward networks with intra-layer links. The authors showed that such ReLU networks with intra-layer links can increase its representation power ... | Recommendation: 6: marginally above the acceptance threshold | Area: Theory (eg, control theory, learning theory, algorithmic game theory) | Review:
In this paper, authors revisited the depth separation theory of deep neural networks. While most of the previous paper focused on feedforward networks, this paper studied feedforward networks with intra-layer links. The authors showed that such ReLU networks with intra-layer links can increase its representatio... |
This paper propose a framework for deformable object manipulation with a dexterous multi-finger hand. It consider six tasks in simulation. The proposed framework solves these tasks by first collecting a few demonstrations by teleoperation, then it trains a skill dynamics predictor and action decoder for planning toward... | Recommendation: 8: accept, good paper | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper propose a framework for deformable object manipulation with a dexterous multi-finger hand. It consider six tasks in simulation. The proposed framework solves these tasks by first collecting a few demonstrations by teleoperation, then it trains a skill dynamics predictor and action decoder for plannin... |
The paper demonstrates that one can achieve state-of-the-art certified $l_2$-robustness using the existing method of denoised smoothing, by simply replacing the custom denoiser by an off-the-shelf diffusion model.
The method is technically very simple, and yet highly effective, which I view as a major strength. The re... | Recommendation: 8: accept, good paper | Area: Deep Learning and representational learning | Review:
The paper demonstrates that one can achieve state-of-the-art certified $l_2$-robustness using the existing method of denoised smoothing, by simply replacing the custom denoiser by an off-the-shelf diffusion model.
The method is technically very simple, and yet highly effective, which I view as a major strength... |
This paper tackles the model learning problem in sequential decision making. Traditional methods may learn a model that fails under counterfactual samples (unseen in offline training dataset). To imporve the model's generalizability, the authors introduce adversarial weighted empirical risk minimization (AWRM) which le... | Recommendation: 6: marginally above the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper tackles the model learning problem in sequential decision making. Traditional methods may learn a model that fails under counterfactual samples (unseen in offline training dataset). To imporve the model's generalizability, the authors introduce adversarial weighted empirical risk minimization (AWRM) ... |
This paper introduces the LPMARL framework to address the sparse reward challenge in MARL. Specifically, LPMARL consists of two hierarchical decision-making parts: 1) the high-level part solves the agent-task assignment as the LP problem, and 2) the low-level part solves local games among agents with the same task. To ... | Recommendation: 5: marginally below the acceptance threshold | Area: Reinforcement Learning (eg, decision and control, planning, hierarchical RL, robotics) | Review:
This paper introduces the LPMARL framework to address the sparse reward challenge in MARL. Specifically, LPMARL consists of two hierarchical decision-making parts: 1) the high-level part solves the agent-task assignment as the LP problem, and 2) the low-level part solves local games among agents with the same t... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.