Search Results for author:
Found 2 papers, 1 papers with code
Bridging Domains with Approximately Shared Features
Under our framework, we design and analyze a learning procedure consisting of learning approximately shared feature representation from source tasks and fine-tuning it on the target task.
Improved theoretical guarantee for rank aggregation via spectral method
As it is generally NP-hard to find a global ranking that minimizes the mismatch (known as the Kemeny optimization), we focus on the Erd\"os-R\'enyi outliers (ERO) model for this ranking problem.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
