Filters








6,902 Hits in 4.1 sec

Desiderata for generalization-to-N algorithms [chapter]

William W. Cohen
1992 Lecture Notes in Computer Science  
The framework consists of two desiderata, or desired properties, for generalization-to-N algorithms.  ...  Finally, we describe a generalization-to-N technique that provably meets these desiderata.  ...  Acknowledgments The author is grateful to Haym Hirsh for many stimulating discussions.  ... 
doi:10.1007/3-540-56004-1_10 fatcat:7nwgesdne5dote5icvjqk2flva

Efficient decoding of random errors for quantum expander codes

Omar Fawzi, Antoine Grospellier, Anthony Leverrier
2018 Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018  
n) optimal for adversarial errors (quasi)-linear time decoding algorithm (new result: can be parallelized to O(log n) time) what about random errors of linear weight?  ...  weight O( √ n) optimal for adversarial errors (quasi)-linear time decoding algorithm (new result: can be parallelized to O(log n) time) what about random errors of linear weight?  ... 
doi:10.1145/3188745.3188886 dblp:conf/stoc/FawziGL18 fatcat:2ob7dlgdxfbnvpaejr3eeuyiy4

Issues in Building Practical Provenance Systems

Adriane Chapman, H. V. Jagadish
2007 IEEE Data Engineering Bulletin  
In this paper, we describe several desiderata for a practical provenance system, based on our experience from this system.  ...  The importance of maintaining provenance has been widely recognized, particularly with respect to highly-manipulated data.  ...  Figure 3 shows the ability of these algorithms to compress the provenance space needed for MiMI. Details of the algorithms and experiments can be found in [9] .  ... 
dblp:journals/debu/ChapmanJ07 fatcat:ukz7scsg4fe33mpdxfdwvz576y

Desiderata for computable representations of electronic health records-driven phenotype algorithms

Huan Mo, William K Thompson, Luke V Rasmussen, Jennifer A Pacheco, Guoqian Jiang, Richard Kiefer, Qian Zhu, Jie Xu, Enid Montague, David S Carrell, Todd Lingren, Frank D Mentch (+17 others)
2015 JAMIA Journal of the American Medical Informatics Association  
These desiderata are a guide to inform the establishment and evolution of EHR phenotype algorithm authoring platforms and languages.  ...  We present desiderata for developing a computable phenotype representation model (PheRM).  ...  For example, in the T2DM algorithm 19 (Figure 1 ), every step generates a Boolean value for each patient to follow a decision tree to determine if the patient is a case or control.  ... 
doi:10.1093/jamia/ocv112 pmid:26342218 pmcid:PMC4639716 fatcat:iqlgrm5vqjdqzgwgrp3mzcb5qm

Optimising SD and LSD in Presence of Non-uniform Probabilities of Revocation [chapter]

Paolo D'Arco, Alfredo De Santis
2009 Lecture Notes in Computer Science  
Ber91, FN94] [Ber91, FN94] revoked non-revoked C msg • A center C broadcast a msg to a set N of receivers • A subset R of them are revoked and should not be able to decrypt the msg • R changes from time  ...  Desiderata • Low bandwidth: Small message expansion -E(content) not much longer than original message.  ...  . , S i m N N \ R R = ∪ S i j L i,j = G_M (LABEL i,j ) … … G_R(G_L(G_L (S))) G_R (S) Vi Vj Providing Keys to Devices Providing Keys to Devices A device corresponds to a leaf u in the tree For every V  ... 
doi:10.1007/978-3-642-10230-1_4 fatcat:w75c3n2q5rax3iblyzpuguexcu

Perspectives on multiagent learning

Tuomas Sandholm
2007 Artificial Intelligence  
This has a positive side too: it can be used to verify the learning models. In the prescriptive agendas, the desiderata need to be made clear and should guide the design of MAL algorithms.  ...  The algorithms need not mimic humans' or animals' learning. I discuss some worthy desiderata; some from the literature do not seem well motivated.  ...  Acknowledgements I thank Rakesh Vohra and Michael Wellman for organizing this important special issue. I thank them and an anonymous reviewer for helpful suggestions.  ... 
doi:10.1016/j.artint.2007.02.004 fatcat:vhde7owrgveobpbqiskzgdjaea

Liquidity-Sensitive Automated Market Makers via Homogeneous Risk Measures [chapter]

Abraham Othman, Tuomas Sandholm
2011 Lecture Notes in Computer Science  
Automated market makers are algorithmic agents that provide liquidity in electronic markets.  ...  A recent stream of research in automated market making is the design of liquidity-sensitive automated market makers, which are able to adjust their price response to the level of active interest in the  ...  Solving for k we get k = n −1/p , and so the maximum sum of prices is nk = n n −1/p = n 1−1/p . For prices that are at most 1 + v, we can set 1 + v = n 1−1/p .  ... 
doi:10.1007/978-3-642-25510-6_27 fatcat:lj5qrmuh65fm5lqqbz6ia5gnmu

Desiderata for Explainable AI in statistical production systems of the European Central Bank [article]

Carlos Mougan, Georgios Kanellos, Thomas Gottron
2022 arXiv   pre-print
In this work, we aim to state clear user-centric desiderata for explainable AI reflecting common explainability needs experienced in statistical production systems of the European Central Bank.  ...  We link the desiderata to archetypical user roles and give examples of techniques and methods which can be used to address the user's needs.  ...  The European Union General Data Protection Regulation (GDPR) [14] states that individuals have the right to receive an explanation for the output of an automated algorithm [13] .  ... 
arXiv:2107.08045v2 fatcat:kz5ux27ngbfwrhx7bblblrul44

Continuous-time Analysis for Variational Inequalities: An Overview and Desiderata [article]

Tatjana Chavdarova, Ya-Ping Hsieh, Michael I. Jordan
2022 arXiv   pre-print
We also formulate various desiderata for algorithms that apply to general VIs and we argue that achieving these desiderata may profit from an understanding of the associated continuous-time dynamics.  ...  Algorithms that solve zero-sum games, multi-objective agent objectives, or, more generally, variational inequality (VI) problems are notoriously unstable on general problems.  ...  the update rule of the discrete algorithm; e.g., for GDA: U ≡ −F (z n ).  ... 
arXiv:2207.07105v1 fatcat:2wv6zeoijvdybiq2c5275n5xzy

Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching

A. M. Bronstein, M. M. Bronstein, R. Kimmel
2006 Proceedings of the National Academy of Sciences of the United States of America  
The generalized multidimensional scaling algorithm allows for both full and partial surface matching.  ...  For this purpose, we introduce the generalized multidimensional scaling, a computationally efficient continuous optimization algorithm for finding the least distortion embedding of one surface into another  ...  Global parameterization for objects with simple topology (e.g., homeomorphic to a disk or a sphere) is also very natural and can be computed from a general mesh by a variety of efficient algorithms (17  ... 
doi:10.1073/pnas.0508601103 pmid:16432211 pmcid:PMC1360551 fatcat:pcjekvuqxrftbez25w5v4wsh2y

Ideal algorithms in healthcare: Explainable, dynamic, precise, autonomous, fair, and reproducible

Tyler J. Loftus, Patrick J. Tighe, Tezcan Ozrazgat-Baslanti, John P. Davis, Matthew M. Ruppert, Yuanfang Ren, Benjamin Shickel, Rishikesan Kamaleswaran, William R. Hogan, J. Randall Moorman, Gilbert R. Upchurch, Parisa Rashidi (+2 others)
2022 PLOS Digital Health  
Established guidelines describe minimum requirements for reporting algorithms in healthcare; it is equally important to objectify the characteristics of ideal algorithms that confer maximum potential benefits  ...  We propose a framework for ideal algorithms, including 6 desiderata: explainable (convey the relative importance of features in determining outputs), dynamic (capture temporal changes in physiologic signals  ...  Checklist for ideal algorithms in healthcare. Desiderata Criteria Yes Location No N/A 1 Explainable Yes a Partially b No c N/A d Table 2 .  ... 
doi:10.1371/journal.pdig.0000006 fatcat:yyldnctehrbohhtyr5hqxhymua

Merging taxonomies under RCC-5 algebraic articulations

David Thau, Shawn Bowers, Bertram Ludäscher
2008 Proceeding of the 2nd international workshop on Ontologies and nformation systems for the semantic web - ONISW '08  
We present an algorithm for merging taxonomies that have been related using articulations given as RCC-5 constraints.  ...  Taxonomies are widely used to classify information, and multiple (possibly competing) taxonomies often exist for the same domain.  ...  Section 2 provides a brief overview of the CT framework, upon which our merge algorithm is based, and discusses related work, comparing our approach to those for general ontology-based alignment  ... 
doi:10.1145/1458484.1458492 dblp:conf/cikm/ThauBL08 fatcat:l5d47ojxj5epdiklgjil2rxu4a

Merging Taxonomies under RCC-5 Algebraic Articulations

David Thau, Shawn Bowers, Bertram Ludaescher
2009 Journal of Computing Science and Engineering  
We present an algorithm for merging taxonomies that have been related using articulations given as RCC-5 constraints.  ...  Taxonomies are widely used to classify information, and multiple (possibly competing) taxonomies often exist for the same domain.  ...  Section 2 provides a brief overview of the CLEANTAX framework, upon which our merge algorithm is based, and discusses related work, comparing our approach to those for general ontology-based alignment  ... 
doi:10.5626/jcse.2009.3.2.109 fatcat:vwsfdq4tpfa6jjcjwogjw2zsgm

Forgetting an Argument

Ringo Baumann, Dov Gabbay, Odinaldo Rodrigues
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
how these criteria relate to each other; and check whether the criteria can be satisfied in general.  ...  Our approach is axiomatic-driven and not limited to any specific semantics: we propose semantical and syntactical desiderata encoding different criteria for what forgetting an argument might mean; analyze  ...  These unsatisfiable sets represent general restrictions on the simultaneous satisfiablity of forgetting desiderata.  ... 
doi:10.1609/aaai.v34i03.5662 fatcat:22jrjo6g6jatljujgtkm3i6kui

Desiderata for Representation Learning: A Causal Perspective [article]

Yixin Wang, Michael I. Jordan
2022 arXiv   pre-print
This yields computable metrics that can be used to assess the degree to which representations satisfy the desiderata of interest and learn non-spurious and disentangled representations from single observational  ...  It can be challenging, however, to turn these intuitive desiderata into formal criteria that can be measured and enhanced based on observed data.  ...  We thank Shubhangi Ghosh, Luigi Gresele, Julius von Kugelgen, Michel Besserve, and Bernhard Schölkopf for useful discussions and for pointing out a counterexample to the Theorem 11 in a previous version  ... 
arXiv:2109.03795v2 fatcat:5u3tjmubwvhqnfz3rn7qqxy2hq
« Previous Showing results 1 — 15 out of 6,902 results