Search
Search Funnelback University
- Refined by:
- Date: Past 3 months
21 -
30 of
50
search results for KaKaoTalk:PC53 24 / |u:mlg.eng.cam.ac.uk
where 0
match all words and 50
match some words.
Results that match 1 of 2 words
-
Conditions Beyond Treewidth for Tightness of Higher-order LP…
https://mlg.eng.cam.ac.uk/adrian/conditions.pdf19 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 -
Unifying Orthogonal Monte Carlo Methods
https://mlg.eng.cam.ac.uk/adrian/ICML2019-unified.pdf19 Jun 2024: E[x̃λỹλx̃λvỹλv x̃. 2λỹ. 2λv. ] (24)We next show the following. Lemma A.7. -
Clamping Variables and Approximate Inference Adrian WellerColumbia…
https://mlg.eng.cam.ac.uk/adrian/NeurIPS14-clamp.pdf19 Jun 2024: Journal of Automated Reasoning, 24(1-2):225–275, 2000. N. Ruozzi. The Bethe partition function of log-supermodular graphical models. -
One-network Adversarial Fairness
https://mlg.eng.cam.ac.uk/adrian/AAAI2019_OneNetworkAdversarialFairness.pdf19 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. -
Structured Evolution with Compact Architectures for Scalable Policy…
https://mlg.eng.cam.ac.uk/adrian/structured_icml_full.pdf19 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 -
Leader Stochastic Gradient Descent for DistributedTraining of Deep…
https://mlg.eng.cam.ac.uk/adrian/NeurIPS2019_LSGD_preprint.pdf19 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. -
Geometrically Coupled Monte Carlo Sampling Mark Rowland∗University of …
https://mlg.eng.cam.ac.uk/adrian/NeurIPS18-gcmc.pdf19 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 -
A Unified Approach to Quantifying Algorithmic Unfairness: Measuring…
https://mlg.eng.cam.ac.uk/adrian/KDD2018_inequality_indices.pdf19 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, -
Uprooting and Rerooting Higher-Order GraphicalModels Mark…
https://mlg.eng.cam.ac.uk/adrian/uprooting-higher-order.pdf19 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. -
Working Draft 1 Accountability of AI Under the Law: ...
https://mlg.eng.cam.ac.uk/adrian/SSRN-id3064761-Dec19.pdf19 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
Refine your results
clear all
Date
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.