ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1703.02721
  4. Cited By
On Approximation Guarantees for Greedy Low Rank Optimization

On Approximation Guarantees for Greedy Low Rank Optimization

8 March 2017
Rajiv Khanna
Ethan R. Elenberg
A. Dimakis
S. Negahban
ArXiv (abs)PDFHTML

Papers citing "On Approximation Guarantees for Greedy Low Rank Optimization"

9 / 9 papers shown
Towards Resolving the Implicit Bias of Gradient Descent for Matrix
  Factorization: Greedy Low-Rank Learning
Towards Resolving the Implicit Bias of Gradient Descent for Matrix Factorization: Greedy Low-Rank LearningInternational Conference on Learning Representations (ICLR), 2020
Zhiyuan Li
Yuping Luo
Kaifeng Lyu
290
149
0
17 Dec 2020
Coresets for Robust Training of Neural Networks against Noisy Labels
Coresets for Robust Training of Neural Networks against Noisy Labels
Baharan Mirzasoleiman
Kaidi Cao
J. Leskovec
NoLa
192
34
0
15 Nov 2020
Multi-objective Evolutionary Algorithms are Still Good: Maximizing
  Monotone Approximately Submodular Minus Modular Functions
Multi-objective Evolutionary Algorithms are Still Good: Maximizing Monotone Approximately Submodular Minus Modular FunctionsEvolutionary Computation (Evol. Comput.), 2019
Chao Qian
211
25
0
12 Oct 2019
Targeted sampling from massive block model graphs with personalized
  PageRank
Targeted sampling from massive block model graphs with personalized PageRank
Fan Chen
Yini Zhang
Karl Rohe
154
12
0
04 Oct 2019
Geometric Rates of Convergence for Kernel-based Sampling Algorithms
Geometric Rates of Convergence for Kernel-based Sampling AlgorithmsConference on Uncertainty in Artificial Intelligence (UAI), 2019
Rajiv Khanna
Liam Hodgkinson
Michael W. Mahoney
260
2
0
19 Jul 2019
Fast greedy algorithms for dictionary selection with generalized
  sparsity constraints
Fast greedy algorithms for dictionary selection with generalized sparsity constraints
K. Fujii
Tasuku Soma
241
6
0
07 Sep 2018
Maximizing Submodular or Monotone Approximately Submodular Functions by
  Multi-objective Evolutionary Algorithms
Maximizing Submodular or Monotone Approximately Submodular Functions by Multi-objective Evolutionary Algorithms
Chao Qian
Yang Yu
Shengcai Liu
Xin Yao
Zhi Zhou
206
58
0
20 Nov 2017
Streaming Weak Submodularity: Interpreting Neural Networks on the Fly
Streaming Weak Submodularity: Interpreting Neural Networks on the Fly
Ethan R. Elenberg
A. Dimakis
Moran Feldman
Amin Karbasi
238
92
0
08 Mar 2017
Restricted Strong Convexity Implies Weak Submodularity
Restricted Strong Convexity Implies Weak Submodularity
Ethan R. Elenberg
Rajiv Khanna
A. Dimakis
S. Negahban
296
163
0
02 Dec 2016
1
Page 1 of 1