Mathematics

Random Graph Matching with Improved Noise Robustness COLT 2021 Randomized Algorithms for Submodular Function Maximization with a k-System Constraint ICML 2021 Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering ICML 2021 Ranking and synchronization from pairwise measurements via SVD JMLR 2021 Ranking Extensions in Abstract Argumentation IJCAI 2021 Rank-one matrix estimation: analytic time evolution of gradient descent dynamics COLT 2021 Rate-Distortion Analysis of Minimum Excess Risk in Bayesian Learning ICML 2021 Rate-Optimal Subspace Estimation on Random Graphs NeurIPS 2021 Recognizing Reduplicated Forms: Finite-State Buffered Machines ACL 2021 Recursive Bayesian Networks: Generalising and Unifying Probabilistic Context-Free Grammars and Dynamic Bayesian Networks NeurIPS 2021 Reduced-Rank Regression with Operator Norm Error COLT 2021 Refined Learning Bounds for Kernel and Approximate k-Means NeurIPS 2021 Reformulating DOVER-Lap Label Mapping as a Graph Partitioning Problem Interspeech 2021 Regret Minimization in Heavy-Tailed Bandits COLT 2021 Regularized spectral methods for clustering signed networks JMLR 2021 Relationships Between Perceptual Distinctiveness, Articulatory Complexity and Functional Load in Speech Communication Interspeech 2021 Reliable Intensity Vector Selection for Multi-Source Direction-of-Arrival Estimation Using a Single Acoustic Vector Sensor Interspeech 2021 RepGraph: Visualising and Analysing Meaning Representation Graphs EMNLP 2021 Replicating and Extending “Because Their Treebanks Leak”: Graph Isomorphism, Covariants, and Parser Performance ACL 2021 Representation Learning on Spatial Networks NeurIPS 2021 Representative Proxy Voting AAAI 2021 Representing Hyperbolic Space Accurately using Multi-Component Floats NeurIPS 2021 Reproducing kernel Hilbert C*-module and kernel mean embeddings JMLR 2021 Restricted Domains of Dichotomous Preferences with Possibly Incomplete Information AAAI 2021 Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices AAAI 2021