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. 2102.09704
  4. Cited By
Fair Sparse Regression with Clustering: An Invex Relaxation for a
  Combinatorial Problem
v1v2 (latest)

Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem

Neural Information Processing Systems (NeurIPS), 2021
19 February 2021
Adarsh Barik
Jean Honorio
    FaML
ArXiv (abs)PDFHTML

Papers citing "Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem"

5 / 5 papers shown
Deep Learning Evidence for Global Optimality of Gerver's Sofa
Deep Learning Evidence for Global Optimality of Gerver's Sofa
Kuangdai Leng
Jia Bi
Jaehoon Cha
Samuel Pinilla
Jeyan Thiyagalingam
191
0
0
15 Jul 2024
Invex Programs: First Order Algorithms and Their Convergence
Invex Programs: First Order Algorithms and Their Convergence
Adarsh Barik
S. Sra
Jean Honorio
264
5
0
10 Jul 2023
Outlier-robust Estimation of a Sparse Linear Model Using Invexity
Outlier-robust Estimation of a Sparse Linear Model Using Invexity
Adarsh Barik
Jean Honorio
214
3
0
22 Jun 2023
Sparse Mixed Linear Regression with Guarantees: Taming an Intractable
  Problem with Invex Relaxation
Sparse Mixed Linear Regression with Guarantees: Taming an Intractable Problem with Invex RelaxationInternational Conference on Machine Learning (ICML), 2022
Adarsh Barik
Jean Honorio
208
8
0
02 Jun 2022
The price of unfairness in linear bandits with biased feedback
The price of unfairness in linear bandits with biased feedbackNeural Information Processing Systems (NeurIPS), 2022
Solenne Gaucher
Alexandra Carpentier
Christophe Giraud
FaML
340
3
0
18 Mar 2022
1
Page 1 of 1