pith. sign in

arxiv: 2605.23145 · v1 · pith:JBF6T2KTnew · submitted 2026-05-22 · 📊 stat.ML · cs.LG· math.ST· stat.ME· stat.TH

Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models

Conlan Olson , Linjun Zhang , Zhun Deng , Pragya Sur This is my paper

Pith reviewed 2026-05-25 03:52 UTC · model grok-4.3

classification 📊 stat.ML cs.LGmath.STstat.MEstat.TH
keywords individual fairnessMahalanobis metricBradley-Terry modeltriplet queriesgradient descentmetric learningsimilarity metricfairness transfer
0
0 comments X

The pith

An algorithm learns a Mahalanobis similarity metric from triplet queries in the Bradley-Terry model to make individual fairness operational.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper presents an algorithm that learns a Mahalanobis similarity metric from triplet comparisons of the form 'is individual i more similar to j or k?'. It combines spectral initialization with gradient descent on the Bradley-Terry loss and proves that the procedure converges to the ground-truth metric even though the loss is non-convex. The work also shows that enforcing individual fairness with respect to the learned metric produces fairness guarantees that carry over to the true underlying metric. This addresses a key practical barrier: without a usable similarity metric, the individual-fairness requirement cannot be checked or enforced on real data.

Core claim

We present an algorithm for learning a Mahalanobis similarity metric from triplet queries of the form 'is individual i more similar to individual j or k?' under the standard Bradley-Terry model for pairwise comparisons. The algorithm consists of a spectral initialization step followed by gradient descent. We provide extensive theoretical guarantees showing that it converges quickly to the ground truth metric despite the non-convexity of the loss. Because our focus is on fairness, we also show that individual fairness with respect to an estimated metric is sufficient to achieve similar fairness with respect to the true metric.

What carries the argument

Spectral initialization followed by gradient descent on the Bradley-Terry likelihood loss for a Mahalanobis matrix parameterizing pairwise similarity probabilities.

If this is right

  • The algorithm converges quickly to the ground truth metric despite non-convexity of the loss.
  • Individual fairness enforced on the estimated metric transfers to similar fairness on the true metric.
  • The learned metric can be used for downstream fair predictors that achieve the desired fairness performance.
  • The method has direct application to tuning AI models where similarity judgments are available as triplets.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same initialization-plus-descent template might be adapted to other probabilistic comparison models that admit a likelihood.
  • When triplet data contain systematic biases not captured by the Bradley-Terry assumption, the fairness transfer guarantee may degrade.
  • The spectral step could be replaced by other cheap initializers, opening a route to faster practical implementations on large datasets.

Load-bearing premise

The triplet queries are generated exactly according to the Bradley-Terry model from an underlying true Mahalanobis metric.

What would settle it

Generate synthetic triplets from a known Mahalanobis metric under the Bradley-Terry model and check whether the algorithm recovers a matrix whose induced fairness violation differs from the true metric by more than the paper's stated error bound.

Figures

Figures reproduced from arXiv: 2605.23145 by Conlan Olson, Linjun Zhang, Pragya Sur, Zhun Deng.

Figure 1
Figure 1. Figure 1: Left: distance between our estimate and the true metric as gradient descent continues. Right: fairness performance of a downstream classifier, measured with respect to the true and the estimated fairness metric. Now, we study the performance of downsteam fair classifiers. We show that classifiers trained to be fair with respect to the estimated fairness metric are also fair with respect to the true metric.… view at source ↗
Figure 2
Figure 2. Figure 2: Gradient descent performance on synthetic and real data. [PITH_FULL_IMAGE:figures/full_fig_p059_2.png] view at source ↗
read the original abstract

Individual fairness, the notion that "similar individuals should be treated similarly," provides a strong and flexible fairness guarantee for algorithmic decision makers. However, a barrier to implementing individual fairness in practice is the difficulty of learning the similarity metric over individuals. In this work, we present an algorithm for learning a Mahalanobis similarity metric from triplet queries of the form "is individual $i$ more similar to individual $j$ or $k$?" We work in the standard Bradley-Terry model for pairwise comparisons. Our algorithm consists of a spectral initialization step followed by gradient descent. We provide extensive theoretical guarantees on our algorithm, showing that it converges quickly to the ground truth metric despite the non-convexity of the loss in our model. Because our focus is on fairness, we also show that individual fairness with respect to an estimated metric is sufficient to achieve similar fairness with respect to the true metric. We also discuss potential applications of our work to AI model tuning. Finally, we present experimental results that demonstrate the convergence of our algorithm and the fairness performance of downstream fair predictors trained on our estimated metric.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 3 minor

Summary. The paper proposes an algorithm consisting of spectral initialization followed by gradient descent to recover a Mahalanobis similarity metric from triplet queries under the Bradley-Terry model. It claims theoretical guarantees that the procedure converges quickly to the ground-truth metric despite non-convexity of the loss, that individual fairness with respect to the estimated metric is sufficient to guarantee similar fairness with respect to the true metric, discusses applications to AI model tuning, and reports experimental results on convergence and downstream fairness performance.

Significance. If the stated guarantees hold under the model assumptions, the work provides a concrete, query-based method for operationalizing individual fairness, removing a key practical barrier. The fairness-transfer result is a useful sufficiency statement, and the spectral-plus-GD approach for the non-convex BT likelihood is technically interesting. Experimental validation of both convergence and fairness transfer adds practical weight. No machine-checked proofs or fully parameter-free derivations are described, but the combination of theory and experiments is a strength.

major comments (2)
  1. [abstract and theoretical guarantees section] The convergence and fairness-transfer claims are derived under the exact generative assumption that every triplet is produced according to the Bradley-Terry likelihood with an underlying true Mahalanobis metric (abstract and model section). The manuscript should explicitly state whether any robustness or approximate-model results are provided; if not, the load-bearing nature of this assumption for both central claims should be highlighted in the introduction and conclusion.
  2. [theoretical analysis] The statement that the algorithm 'converges quickly' despite non-convexity requires concrete rates, sample-complexity bounds, or high-probability error bounds on the recovered metric (e.g., in terms of number of triplets or dimension). Without these, it is difficult to assess whether the spectral initialization step actually yields global convergence or only local improvement.
minor comments (3)
  1. [abstract] The abstract would be strengthened by including a brief mention of the convergence rate or sample complexity achieved.
  2. [model section] Notation for the Mahalanobis matrix and the BT likelihood should be introduced once and used consistently; currently the transition from the abstract to the model paragraph is abrupt.
  3. [experiments] Experimental figures should report the number of independent trials and error bars; the current description only states that results 'demonstrate convergence.'

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the positive assessment and constructive comments. We address each major point below and will incorporate clarifications as described.

read point-by-point responses

  1. Referee: [abstract and theoretical guarantees section] The convergence and fairness-transfer claims are derived under the exact generative assumption that every triplet is produced according to the Bradley-Terry likelihood with an underlying true Mahalanobis metric (abstract and model section). The manuscript should explicitly state whether any robustness or approximate-model results are provided; if not, the load-bearing nature of this assumption for both central claims should be highlighted in the introduction and conclusion.

    Authors: We agree that all stated convergence and fairness-transfer results assume the exact Bradley-Terry generative model with no model misspecification. The manuscript provides no robustness or approximate-model results. We will revise the introduction and conclusion to explicitly note this modeling assumption and its central role in both claims. revision: yes

  2. Referee: [theoretical analysis] The statement that the algorithm 'converges quickly' despite non-convexity requires concrete rates, sample-complexity bounds, or high-probability error bounds on the recovered metric (e.g., in terms of number of triplets or dimension). Without these, it is difficult to assess whether the spectral initialization step actually yields global convergence or only local improvement.

    Authors: The theoretical analysis shows that spectral initialization followed by gradient descent recovers the ground-truth metric (i.e., global convergence) despite non-convexity of the Bradley-Terry loss, under the model assumptions. However, the manuscript does not supply explicit convergence rates, sample-complexity bounds, or high-probability error bounds in terms of the number of triplets or dimension. We will revise the theoretical section and abstract to describe the guarantees more precisely, remove the unquantified term 'quickly,' and clarify that the result establishes global recovery rather than merely local improvement. revision: partial

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper derives convergence of spectral init + GD to the ground-truth Mahalanobis metric and the fairness-transfer result under the explicit generative assumption that triplets follow the Bradley-Terry likelihood exactly from a true underlying metric. These are standard parametric assumptions for theoretical analysis; the derivations do not reduce any claimed prediction or fairness guarantee to a quantity defined by the same fitted parameters, nor do they rely on self-citations or ansatzes smuggled from prior author work. No load-bearing step matches any of the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Abstract supplies only high-level modeling choices; full paper would be needed to enumerate all fitted quantities and background assumptions.

axioms (2)
  • domain assumption Similarity metric belongs to the Mahalanobis family
    Explicitly stated as the target of learning.
  • domain assumption Triplet responses obey the Bradley-Terry model with the true metric
    The algorithm and guarantees are derived under this generative model.

pith-pipeline@v0.9.0 · 5736 in / 1300 out tokens · 25277 ms · 2026-05-25T03:52:37.397245+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

127 extracted references · 127 canonical work pages · 4 internal anchors

  1. [1]

    and Reingold, Omer and Rothblum, Guy N

    Kim, Michael P. and Reingold, Omer and Rothblum, Guy N. , title =. 2018 , booktitle =

    work page 2018

  2. [2]

    Proceedings of the 1st Symposium on Foundations of Responsible Computing (FORC 2020) , pages =

    Christina Ilvento , title =. Proceedings of the 1st Symposium on Foundations of Responsible Computing (FORC 2020) , pages =. 2020 , volume =

    work page 2020

  3. [3]

    Proceedings of the 3rd Innovations in Theoretical Computer Science Conference , pages =

    Dwork, Cynthia and Hardt, Moritz and Pitassi, Toniann and Reingold, Omer and Zemel, Richard , title =. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference , pages =. 2012 , nisbn =

    work page 2012

  4. [4]

    Computing a high-dimensional euclidean embedding from an arbitrary smooth riemannian metric , journal =

    Zichun Zhong and Wenping Wang and Bruno L. Computing a high-dimensional euclidean embedding from an arbitrary smooth riemannian metric , journal =. 2018 , month =

    work page 2018

  5. [5]

    2016 , url =

    Julia Angwin and Jeff Larson and Surya Mattu and Lauren Kirchner , title =. 2016 , url =

    work page 2016

  6. [6]

    2017 , howpublished =

    Danielle Kehl and Priscilla Guo and Samuel Kessler , title =. 2017 , howpublished =

    work page 2017

  7. [7]

    2016 , journal =

    William Dieterich and Christina Mendoza and Tim Brennan , title =. 2016 , journal =

    work page 2016

  8. [8]

    2016 , eprint=

    Inherent Trade-Offs in the Fair Determination of Risk Scores , author=. 2016 , eprint=

    work page 2016

  9. [9]

    Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , pages =

    Pedreshi, Dino and Ruggieri, Salvatore and Turini, Franco , title =. Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , pages =. 2008 , nisbn =

    work page 2008

  10. [10]

    Advances in Neural Information Processing Systems , volume=

    Equality of opportunity in supervised learning , author=. Advances in Neural Information Processing Systems , volume=

    work page

  11. [11]

    Kleinberg and Sendhil Mullainathan and Manish Raghavan , title =

    Jon M. Kleinberg and Sendhil Mullainathan and Manish Raghavan , title =. CoRR , volume =. 2016 , nurl =

    work page 2016

  12. [12]

    Proceedings of the 35th International Conference on Machine Learning , pages =

    Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairness , author =. Proceedings of the 35th International Conference on Machine Learning , pages =. 2018 , volume =

    work page 2018

  13. [13]

    2018 , booktitle =

    Gillen, Stephen and Jung, Christopher and Kearns, Michael and Roth, Aaron , title =. 2018 , booktitle =

    work page 2018

  14. [14]

    Stewart, Neil and Brown, Gordon D. A. and Chater, Nick , nissn =. Absolute Identification by Relative Judgment. , Volume =. Psychological Review , Number =

    work page

  15. [15]

    Proceedings of the 31st Conference on Neural Information Processing Systems , year =

    Kernel functions based on triplet comparisons , author =. Proceedings of the 31st Conference on Neural Information Processing Systems , year =

    work page

  16. [16]

    Proceedings of the 28th International Conference on International Conference on Machine Learning , pages =

    Tamuz, Omer and Liu, Ce and Belongie, Serge and Shamir, Ohad and Kalai, Adam Tauman , title =. Proceedings of the 28th International Conference on International Conference on Machine Learning , pages =. 2011 , nisbn =

    work page 2011

  17. [17]

    and Nowak, Robert D

    Jamieson, Kevin G. and Nowak, Robert D. , booktitle=. Low-dimensional embedding using adaptively selected ordinal data , year=

    work page

  18. [18]

    Learning Low-Dimensional Metrics , nurl =

    Mason, Blake and Jain, Lalit and Nowak, Robert , pages =. Learning Low-Dimensional Metrics , nurl =. 2017 , booktitle =

    work page 2017

  19. [19]

    Proceedings of the 30th Conference on Neural Information Processing Systems , year=

    Finite Sample Prediction and Recovery Bounds for Ordinal Embedding , author=. Proceedings of the 30th Conference on Neural Information Processing Systems , year=

    work page

  20. [20]

    A Survey on Metric Learning for Feature Vectors and Structured Data , journal =

    Aur. A Survey on Metric Learning for Feature Vectors and Structured Data , journal =. 2013 , nurl =

    work page 2013

  21. [21]

    Terry , journal =

    Ralph Allan Bradley and Milton E. Terry , journal =. Rank Analysis of Incomplete Block Designs: I. The Method of Paired Comparisons , volume =

    work page

  22. [22]

    Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution , volume=

    Ma, Cong and Wang, Kaizheng and Chi, Yuejie and Chen, Yuxin , year=. Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution , volume=. Foundations of Computational Mathematics , publisher=

    work page

  23. [23]

    and Chen, Yuxin , year=

    Chi, Yuejie and Lu, Yue M. and Chen, Yuxin , year=. Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview , volume=. IEEE Transactions on Signal Processing , publisher=

    work page

  24. [24]

    2019 , school=

    A modern maximum likelihood theory for high-dimensional logistic regression , author=. 2019 , school=

    work page 2019

  25. [25]

    High-Dimensional Probability: An Introduction with Applications in Data Science , ndoi=

    Vershynin, Roman , year=. High-Dimensional Probability: An Introduction with Applications in Data Science , ndoi=

    work page

  26. [26]

    High-Dimensional Probability: An Introduction with Applications in Data Science , edition=

    Vershynin, Roman , year=. High-Dimensional Probability: An Introduction with Applications in Data Science , edition=

    work page

  27. [27]

    Proceedings of the 35th International Conference on Machine Learning , pages =

    Multicalibration: Calibration for the (Computationally-Identifiable) Masses , author =. Proceedings of the 35th International Conference on Machine Learning , pages =. 2018 , volume =

    work page 2018

  28. [28]

    Pai and Aaron Roth and Rakesh Vohra , title =

    Christopher Jung and Changhwa Lee and Mallesh M. Pai and Aaron Roth and Rakesh Vohra , title =. CoRR , volume =. 2020 , nurl =

    work page 2020

  29. [29]

    Fairness and Machine Learning , author =

    work page

  30. [30]

    and Saul, Lawrence K

    Weinberger, Kilian Q. and Saul, Lawrence K. , title =. The Journal of Machine Learning Research , month = jun, pages =. 2009 , issue_date =

    work page 2009

  31. [31]

    Neighbourhood Components Analysis , nurl =

    Goldberger, Jacob and Hinton, Geoffrey E and Roweis, Sam and Salakhutdinov, Russ R , booktitle =. Neighbourhood Components Analysis , nurl =

    work page

  32. [32]

    A Survey on Metric Learning for Feature Vectors and Structured Data

    Aur. A Survey on Metric Learning for Feature Vectors and Structured Data , journal =. 2013 , archivePrefix =. 1306.6709 , timestamp =

    work page internal anchor Pith review Pith/arXiv arXiv 2013

  33. [33]

    2002 , month = nov, publisher =

    Sanjoy Dasgupta and Anupam Gupta , title =. 2002 , month = nov, publisher =

    work page 2002

  34. [34]

    2009 , howpublished=

    Sham Kakade and Greg Shaknarovich , title =. 2009 , howpublished=

    work page 2009

  35. [35]

    Journal of Combinatorial Theory, Series B , volume=

    Monotone maps, sphericity and bounded second eigenvalue , author=. Journal of Combinatorial Theory, Series B , volume=. 2005 , publisher=

    work page 2005

  36. [36]

    Wahba and M

    Luwan Zhang and G. Wahba and M. Yuan , journal=. Distance shrinkage and. 2014 , volume=

    work page 2014

  37. [37]

    The Chronicle of Higher Education , year=

    Can Algorithms Save College Admissions? , author=. The Chronicle of Higher Education , year=

    work page

  38. [38]

    AEA Papers and Proceedings , Volume =

    Kleinberg, Jon and Ludwig, Jens and Mullainathan, Sendhil and Rambachan, Ashesh , Title =. AEA Papers and Proceedings , Volume =. 2018 , Month =

    work page 2018

  39. [39]

    Ali, Muhammad and Sapiezynski, Piotr and Bogen, Miranda and Korolova, Aleksandra and Mislove, Alan and Rieke, Aaron , title =. Proc. ACM Hum.-Comput. Interact. , month =. 2019 , issue_date =

    work page 2019

  40. [40]

    Khang Manh Huynh , month=. The. 2018 , note=

    work page 2018

  41. [41]

    Notes on the

    Terence Tao , month=. Notes on the. 2016 , note=

    work page 2016

  42. [42]

    Journal of Machine Learning Research , year =

    Nakul Verma , title =. Journal of Machine Learning Research , year =

    work page

  43. [43]

    REMARKS TO

    Schoenberg, IJ , journal=. REMARKS TO

    work page

  44. [44]

    , booktitle=

    Indyk, P. , booktitle=. Algorithmic applications of low-distortion geometric embeddings , year=

    work page

  45. [45]

    Psychometrika , pages=

    Orthogonal procrustes rotation for two or more matrices , author=. Psychometrika , pages=. 1977 , volume=

    work page 1977

  46. [46]

    and Ghorbani, Amirata and Zou, James , title =

    Kim, Michael P. and Ghorbani, Amirata and Zou, James , title =. Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society , pages =. 2019 , nisbn =

    work page 2019

  47. [47]

    J. R. Foulds and R. Islam and K. Keya and S. Pan , booktitle =. An Intersectional Definition of Fairness , year =

    work page

  48. [48]

    Proceedings of the 3rd Conference on Theory of Cryptography , pages =

    Dwork, Cynthia and McSherry, Frank and Nissim, Kobbi and Smith, Adam , title =. Proceedings of the 3rd Conference on Theory of Cryptography , pages =. 2006 , nisbn =

    work page 2006

  49. [49]

    2013 , nissn =

    Discrete Mathematics , volume =. 2013 , nissn =

    work page 2013

  50. [50]

    2005 , publisher =

    Modern Multidimensional Scaling , author =. 2005 , publisher =

    work page 2005

  51. [51]

    Handbook of Discrete and Computational Geometry , year =

    Piotr Indyk and Jiri Matousek , title =. Handbook of Discrete and Computational Geometry , year =

    work page

  52. [52]

    ACM Transactions on Algorithms (TALG) , volume=

    Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics , author=. ACM Transactions on Algorithms (TALG) , volume=. 2008 , publisher=

    work page 2008

  53. [53]

    Bernoulli , volume=

    Some theory for ordinal embedding , author=. Bernoulli , volume=. 2017 , publisher=

    work page 2017

  54. [54]

    P. J. Bickel and E. A. Hammel and J. W. O'Connell , title =. Science , volume =. 1975 , ndoi =

    work page 1975

  55. [55]

    Selbst, Andrew D. and. Fairness and Abstraction in Sociotechnical Systems , year =

    work page

  56. [56]

    Avoiding Discrimination through Causal Reasoning , year =

    Kilbertus, Niki and Rojas-Carulla, Mateo and Parascandolo, Giambattista and Hardt, Moritz and Janzing, Dominik and Sch\". Avoiding Discrimination through Causal Reasoning , year =. Proceedings of the 31st International Conference on Neural Information Processing Systems , pages =

    work page

  57. [57]

    Causal Reasoning for Algorithmic Fairness

    Joshua R. Loftus and Chris Russell and Matt J. Kusner and Ricardo Silva , title =. CoRR , volume =. 2018 , nurl =. 1805.05859 , timestamp =

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  58. [58]

    and Reingold, Omer and Rothblum, Guy N

    Dwork, Cynthia and Kim, Michael P. and Reingold, Omer and Rothblum, Guy N. and Yona, Gal , booktitle=. Learning from Outcomes: Evidence-Based Rankings , year=

    work page

  59. [59]

    2001 , publisher=

    Rank aggregation revisited , author=. 2001 , publisher=

    work page 2001

  60. [60]

    and Larochelle, Hugo and Zemel, Richard S

    Volkovs, Maksims N. and Larochelle, Hugo and Zemel, Richard S. , title =. Proceedings of the 21st ACM International Conference on Information and Knowledge Management , pages =. 2012 , nisbn =

    work page 2012

  61. [61]

    , year =

    Fagin, Ronald and Kumar, Ravi and Sivakumar, D. , year =. Comparing Top k Lists , volume =. SIAM Journal on Discrete Mathematics , ndoi =

    work page

  62. [62]

    Kearns and Seth Neel and Aaron Roth and Logan Stapleton and Zhiwei Steven Wu , title =

    Christopher Jung and Michael J. Kearns and Seth Neel and Aaron Roth and Logan Stapleton and Zhiwei Steven Wu , title =. CoRR , volume =. 2019 , nurl =. 1905.10660 , timestamp =

    work page arXiv 2019

  63. [63]

    Proceedings of the 30th International Conference on Machine Learning , pages =

    Learning Fair Representations , author =. Proceedings of the 30th International Conference on Machine Learning , pages =. 2013 , volume =

    work page 2013

  64. [64]

    Provably Fair Representations

    Daniel McNamara and Cheng Soon Ong and Robert C. Williamson , title =. CoRR , volume =. 2017 , nurl =. 1710.04394 , timestamp =

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  65. [65]

    Advances in Neural Information Processing Systems 33 , year =

    Learning Certified Individually Fair Representations , author =. Advances in Neural Information Processing Systems 33 , year =

    work page

  66. [66]

    Emmanuel J. Cand. IEEE Transactions on Information Theory , title=. 2010 , volume=

    work page 2010

  67. [67]

    IEEE Transactions on Signal Processing , year=

    A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints , author=. IEEE Transactions on Signal Processing , year=

    work page

  68. [68]

    2020 , month =

    Si-Tong Lu and Miao Zhang and Qing-Na Li , title =. 2020 , month =

    work page 2020

  69. [69]

    2013 , publisher =

    Brian Kulis , title =. 2013 , publisher =

    work page 2013

  70. [70]

    and Kulis, Brian and Jain, Prateek and Sra, Suvrit and Dhillon, Inderjit S

    Davis, Jason V. and Kulis, Brian and Jain, Prateek and Sra, Suvrit and Dhillon, Inderjit S. , title =. Proceedings of the 24th International Conference on Machine Learning , pages =. 2007 , nisbn =

    work page 2007

  71. [71]

    Robustness and Generalization for Metric Learning

    Aur. Robustness and Generalization for Metric Learning , journal =. 2012 , eprinttype =. 1209.1086 , timestamp =

    work page internal anchor Pith review Pith/arXiv arXiv 2012

  72. [72]

    Counterfactual Fairness , nurl =

    Kusner, Matt J and Loftus, Joshua and Russell, Chris and Silva, Ricardo , booktitle =. Counterfactual Fairness , nurl =

    work page

  73. [73]

    The Geometry of Graphs and Some of Its Algorithmic Applications , volume =

    Linial, Nathan and London, E and Rabinovich, Yuri , year =. The Geometry of Graphs and Some of Its Algorithmic Applications , volume =. Combinatorica , ndoi =

    work page

  74. [74]

    Nearly Isometric Embedding by Relaxation , nurl =

    McQueen, James and Meila, Marina and Joncas, Dominique , booktitle =. Nearly Isometric Embedding by Relaxation , nurl =

    work page

  75. [75]

    Tenenbaum and Vin de Silva and John C

    Joshua B. Tenenbaum and Vin de Silva and John C. Langford , title =. Science , volume =. 2000 , ndoi =

    work page 2000

  76. [76]

    2013 , eprint=

    Non-linear dimensionality reduction: Riemannian metric estimation and the problem of geometric discovery , author=. 2013 , eprint=

    work page 2013

  77. [77]

    AAAI Fall Symposium: Manifold Learning and Its Applications , year =

    Behrouz Behmardi and Raviv Raich , title =. AAAI Fall Symposium: Manifold Learning and Its Applications , year =

    work page

  78. [78]

    2006 , publisher =

    Tony Lin and Hongbin Zha and Sang Uk Lee , title =. 2006 , publisher =

    work page 2006

  79. [79]

    Psychometrika , volume=

    Nonmetric multidimensional scaling: a numerical method , author=. Psychometrika , volume=. 1964 , publisher=

    work page 1964

  80. [80]

    Proceedings of the 11th International Conference on Artificial Intelligence and Statistics , pages =

    Generalized Non-metric Multidimensional Scaling , author =. Proceedings of the 11th International Conference on Artificial Intelligence and Statistics , pages =. 2007 , volume =

    work page 2007

Showing first 80 references.