ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1703.02723
  4. Cited By
Scalable Greedy Feature Selection via Weak Submodularity

Scalable Greedy Feature Selection via Weak Submodularity

8 March 2017
Rajiv Khanna
Ethan R. Elenberg
A. Dimakis
S. Negahban
Joydeep Ghosh
ArXivPDFHTML

Papers citing "Scalable Greedy Feature Selection via Weak Submodularity"

13 / 13 papers shown
Title
Graph Optimality-Aware Stochastic LiDAR Bundle Adjustment with Progressive Spatial Smoothing
Graph Optimality-Aware Stochastic LiDAR Bundle Adjustment with Progressive Spatial Smoothing
Jianping Li
T. Nguyen
Muqing Cao
Shenghai Yuan
Tzu-Yi Hung
Lihua Xie
35
3
0
18 Oct 2024
Active Few-Shot Fine-Tuning
Active Few-Shot Fine-Tuning
Jonas Hübotter
Bhavya Sukhija
Lenart Treven
Yarden As
Andreas Krause
45
1
0
13 Feb 2024
End-to-end Feature Selection Approach for Learning Skinny Trees
End-to-end Feature Selection Approach for Learning Skinny Trees
Shibal Ibrahim
Kayhan Behdin
Rahul Mazumder
30
0
0
28 Oct 2023
Greedy Modality Selection via Approximate Submodular Maximization
Greedy Modality Selection via Approximate Submodular Maximization
Runxiang Cheng
Gargi Balasubramaniam
Yifei He
Yao-Hung Hubert Tsai
Han Zhao
21
1
0
22 Oct 2022
Neural Estimation of Submodular Functions with Applications to
  Differentiable Subset Selection
Neural Estimation of Submodular Functions with Applications to Differentiable Subset Selection
A. De
Soumen Chakrabarti
24
4
0
20 Oct 2022
Online Subset Selection using $α$-Core with no Augmented Regret
Online Subset Selection using ααα-Core with no Augmented Regret
Sourav Sahoo
Siddhant Chaudhary
S. Mukhopadhyay
Abhishek Sinha
OffRL
47
0
0
28 Sep 2022
Network Generalization Prediction for Safety Critical Tasks in Novel
  Operating Domains
Network Generalization Prediction for Safety Critical Tasks in Novel Operating Domains
Molly O'Brien
Michael Medoff
Julia V. Bukowski
Gregory Hager
OOD
21
3
0
17 Aug 2021
RETRIEVE: Coreset Selection for Efficient and Robust Semi-Supervised
  Learning
RETRIEVE: Coreset Selection for Efficient and Robust Semi-Supervised Learning
Krishnateja Killamsetty
Xujiang Zhao
F. Chen
Rishabh K. Iyer
24
78
0
14 Jun 2021
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack
  Constraint
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Georgios Amanatidis
Federico Fusco
Philip Lazos
S. Leonardi
Rebecca Reiffenhauser
13
46
0
09 Jul 2020
Parallel Algorithm for Non-Monotone DR-Submodular Maximization
Parallel Algorithm for Non-Monotone DR-Submodular Maximization
Alina Ene
Huy Le Nguyen
13
16
0
30 May 2019
Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy
  with Adaptive Submodularity Ratio
Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio
K. Fujii
Shinsaku Sakaue
27
24
0
24 Apr 2019
Weakly Submodular Maximization Beyond Cardinality Constraints: Does
  Randomization Help Greedy?
Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?
Lin Chen
Moran Feldman
Amin Karbasi
21
47
0
13 Jul 2017
Efficient Data Representation by Selecting Prototypes with Importance
  Weights
Efficient Data Representation by Selecting Prototypes with Importance Weights
Karthik S. Gurumoorthy
Amit Dhurandhar
Guillermo Cecchi
Charu Aggarwal
21
22
0
05 Jul 2017
1