Search

Search Funnelback University

Search powered by Funnelback
21 - 39 of 39 search results for KaKaoTalk:PC53 24 / |u:mlg.eng.cam.ac.uk where 0 match all words and 39 match some words.
  1. Results that match 1 of 2 words

  2. Blind Justice: Fairness with Encrypted Sensitive Attributes

    https://mlg.eng.cam.ac.uk/adrian/ICML18-BlindJustice.pdf
    19 Jun 2024: d features 51 62 7 24 23p sensitive attr. 1 1 7 1 1certification 802 ms 827 ms 288 ms 250 ms 765 mstraining 43 min 51 min 7 min 1 ... Bennett Capers, I. Blind justice. Yale Journal of Law &Humanities, 24:179, 2012.
  3. One-network Adversarial Fairness

    https://mlg.eng.cam.ac.uk/adrian/AAAI2019_OneNetworkAdversarialFairness.pdf
    19 Jun 2024: log(1/δ). n(24). The term[4nI(x D0). 4nI(x D1). ]is what is estimated. ... From the latter note and (24), the two classifiers of theadversarial formulation proposed in (9) in the main docu-ment can be interpreted w.r.t.
  4. C:/Users/Adrian/Documents/GitHub/betheClean/docs/nb-UAI.dvi

    https://mlg.eng.cam.ac.uk/adrian/nb-UAI.pdf
    19 Jun 2024: Approximating the Bethe Partition Function. Adrian WellerDepartment of Computer Science. Columbia UniversityNew York NY 10027. adrian@cs.columbia.edu. Tony JebaraDepartment of Computer Science. Columbia UniversityNew York NY 10027. jebara@cs.columbia
  5. You Shouldn’t Trust Me: Learning Models WhichConceal Unfairness From…

    https://mlg.eng.cam.ac.uk/adrian/ECAI20-You_Shouldn%E2%80%99t_Trust_Me.pdf
    19 Jun 2024: mostimportant feature) in 2D reduced input space (scikit-learn [24]’s PCA imple-mentation). ... 4765–4774, (2017). [24] F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B.
  6. The Geometry of Random Features Krzysztof Choromanski∗1 Mark…

    https://mlg.eng.cam.ac.uk/adrian/geometry.pdf
    19 Jun 2024: The Geometry of Random Features. Krzysztof Choromanski1 Mark Rowland2 Tamas Sarlos1 Vikas Sindhwani1 Richard E. Turner2 Adrian Weller231Google Brain, NY 2University of Cambridge, UK 3The Alan Turing Institute, UK. Abstract. We present an in-depth
  7. Leader Stochastic Gradient Descent for DistributedTraining of Deep…

    https://mlg.eng.cam.ac.uk/adrian/NeurIPS2019_LSGD_preprint.pdf
    19 Jun 2024: Landscape symmetries are commonin a plethora of non-convex problems [18, 19, 20, 21, 22], including deep learning [23, 24, 25, 26]. ... Understanding symmetries in deep networks. CoRR,abs/1511.01029, 2015. [24] A. Choromanska, M.
  8. Structured Evolution with Compact Architectures for Scalable Policy…

    https://mlg.eng.cam.ac.uk/adrian/structured_icml_full.pdf
    19 Jun 2024: Structured Evolution with Compact Architecturesfor Scalable Policy Optimization. Krzysztof Choromanski 1 Mark Rowland 2 Vikas Sindhwani 1 Richard E. Turner 2 Adrian Weller 2 3. AbstractWe present a new method of blackbox optimiza-tion via gradient
  9. 19 Jun 2024: Tightness of LP Relaxations for Almost Balanced Models. Adrian Weller Mark Rowland David SontagUniversity of Cambridge University of Cambridge New York University. Abstract. Linear programming (LP) relaxations are widelyused to attempt to identify a
  10. Clamping Variables and Approximate Inference Adrian WellerColumbia…

    https://mlg.eng.cam.ac.uk/adrian/NeurIPS14-clamp.pdf
    19 Jun 2024: Journal of Automated Reasoning, 24(1-2):225–275, 2000. N. Ruozzi. The Bethe partition function of log-supermodular graphical models.
  11. From Parity to Preference-based Notionsof Fairness in Classification…

    https://mlg.eng.cam.ac.uk/adrian/NeurIPS17-from-parity-to-preference.pdf
    19 Jun 2024: decisionoutcomes. A number of learning mechanisms have been proposed to achieve parity in treatment [24],. ... Angwin. https://github.com/propublica/compas-analysis, 2016. [24] B. T. Luong, S. Ruggieri, and F.
  12. A Unified Approach to Quantifying Algorithmic Unfairness: Measuring…

    https://mlg.eng.cam.ac.uk/adrian/KDD2018_inequality_indices.pdf
    19 Jun 2024: 2.3 Axioms for Measuring InequalityBorrowing insights from the rich body of work on the axiomaticcharacterization of inequality indices in economics and social sci-ence [3, 10, 19, 24, 25, 28,
  13. Uprooting and Rerooting Higher-Order GraphicalModels Mark…

    https://mlg.eng.cam.ac.uk/adrian/uprooting-higher-order.pdf
    19 Jun 2024: 4], which relates to generalized belief propagation,24) and MAP inference (using loopy belief propagation, LBP [9]). ... InArtificial Intelligence and Statistics (AISTATS), 2016. [24] J. Yedidia, W. Freeman, and Y.
  14. Unifying Orthogonal Monte Carlo Methods

    https://mlg.eng.cam.ac.uk/adrian/ICML2019-unified.pdf
    19 Jun 2024: E[x̃λỹλx̃λvỹλv x̃. 2λỹ. 2λv. ] (24)We next show the following. Lemma A.7.
  15. Conditions Beyond Treewidth for Tightness of Higher-order LP…

    https://mlg.eng.cam.ac.uk/adrian/conditions.pdf
    19 Jun 2024: Conditions Beyond Treewidth for Tightness of Higher-order LP Relaxations. Mark Rowland Aldo Pacchiano Adrian WellerUniversity of Cambridge UC Berkeley University of Cambridge. Abstract. Linear programming (LP) relaxations are a pop-ular method to
  16. Working Draft 1 Accountability of AI Under the Law: ...

    https://mlg.eng.cam.ac.uk/adrian/SSRN-id3064761-Dec19.pdf
    19 Jun 2024: 24. Furthermore, an explanation must also provide the correct type of information in order for it to be useful. ... 24 Wachter, Right to Explanation, supra note 18. For a discussion about legibility of algorithmic systems more broadly, see Gianclaudio
  17. Geometrically Coupled Monte Carlo Sampling Mark Rowland∗University of …

    https://mlg.eng.cam.ac.uk/adrian/NeurIPS18-gcmc.pdf
    19 Jun 2024: Geometrically Coupled Monte Carlo Sampling. Mark RowlandUniversity of Cambridgemr504@cam.ac.uk. Krzysztof ChoromanskiGoogle Brain Roboticskchoro@google.com. François ChalusUniversity of Cambridgechalusf3@gmail.com. Aldo PacchianoUniversity of
  18. Clamping Improves TRW and Mean Field Approximations Adrian Weller∗ ...

    https://mlg.eng.cam.ac.uk/adrian/clamp_aistats_final.pdf
    19 Jun 2024: Journal of Automated Reasoning, 24(1-2):225–275, 2000. N. Ruozzi. The Bethe partition function of log-supermodular graphical models.
  19. The Unreasonable Effectiveness of StructuredRandom Orthogonal…

    https://mlg.eng.cam.ac.uk/adrian/NeurIPS17-unreasonable-effectiveness.pdf
    19 Jun 2024: sin2(φ) cos2(ϕ1) cos2(ϕ2) sin2(ϕ1)cos2(ϕ2) sin. 2(ϕ1) sin2(φ) cos2(ϕ1). (24). This observation greatly simplifies the integral from Equation (22) involving the term
  20. Methods for Inference in Graphical Models

    https://mlg.eng.cam.ac.uk/adrian/phd_FINAL.pdf
    19 Jun 2024: 3 Additional Background 24. 3.1 MAP Inference and Tractable Cases. 24.

Refine your results

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.