Search Results for author:
Found 2 papers, 1 papers with code
On the Sample Complexity of Rank Regression from Pairwise Comparisons
We consider a rank regression setting, in which a dataset of $N$ samples with features in $\mathbb{R}^d$ is ranked by an oracle via $M$ pairwise comparisons.
An empirical study of Conv-TasNet
Furthermore, we offer insights into the generalization capabilities of Conv-TasNet and the potential value of improvements to the encoder/decoder.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
