Cognitive philology is the science that studies written and oral texts as the product of human mental processes. Studies in cognitive philology compare documentary evidence emerging from textual investigations with results of experimental research, especially in the fields of cognitive and ecological psychology, neurosciences and artificial intelligence. "The point is not the text, but the mind that made it". Cognitive Philology aims to foster communication between literary, textual, philological disciplines on the one hand and researches across the whole range of the cognitive, evolutionary, ecological and human sciences on the other. Cognitive philology: investigates transmission of oral and written text, and categorization processes which lead to classification of knowledge, mostly relying on the information theory; studies how narratives emerge in so called natural conversation and selective process which lead to the rise of literary standards for storytelling, mostly relying on embodied semantics; explores the evolutive and evolutionary role played by rhythm and metre in human ontogenetic and phylogenetic development and the pertinence of the semantic association during processing of cognitive maps; Provides the scientific ground for multimedia critical editions of literary texts. Among the founding thinkers and noteworthy scholars devoted to such investigations are: Alan Richardson: Studies Theory of Mind in early-modern and contemporary literature. Anatole Pierre Fuksas Benoît de Cornulier David Herman: Professor of English at North Carolina State University and an adjunct professor of linguistics at Duke University. He is the author of "Universal Grammar and Narrative Form" and the editor of "Narratologies: New Perspectives on Narrative Analysis". Domenico Fiormonte François Recanati Gilles Fauconnier, a professor in Cognitive science at the University of California, San Diego. He was one of the founders of cognitive linguistics in the 1970s through his work on pragmatic scales and mental spaces. His research explores the areas of conceptual integration and compressions of conceptual mappings in terms of the emergent structure in language. Julián Santano Moreno Luca Nobile Manfred Jahn in Germany Mark Turner Paolo Canettieri
Shearlet
In applied mathematical analysis, shearlets are a multiscale framework which allows efficient encoding of anisotropic features in multivariate problem classes. Originally, shearlets were introduced in 2006 for the analysis and sparse approximation of functions f ∈ L 2 ( R 2 ) {\displaystyle f\in L^{2}(\mathbb {R} ^{2})} . They are a natural extension of wavelets, to accommodate the fact that multivariate functions are typically governed by anisotropic features such as edges in images, since wavelets, as isotropic objects, are not capable of capturing such phenomena. Shearlets are constructed by parabolic scaling, shearing, and translation applied to a few generating functions. At fine scales, they are essentially supported within skinny and directional ridges following the parabolic scaling law, which reads length² ≈ width. Similar to wavelets, shearlets arise from the affine group and allow a unified treatment of the continuum and digital situation leading to faithful implementations. Although they do not constitute an orthonormal basis for L 2 ( R 2 ) {\displaystyle L^{2}(\mathbb {R} ^{2})} , they still form a frame allowing stable expansions of arbitrary functions f ∈ L 2 ( R 2 ) {\displaystyle f\in L^{2}(\mathbb {R} ^{2})} . One of the most important properties of shearlets is their ability to provide optimally sparse approximations (in the sense of optimality in ) for cartoon-like functions f {\displaystyle f} . In imaging sciences, cartoon-like functions serve as a model for anisotropic features and are compactly supported in [ 0 , 1 ] 2 {\displaystyle [0,1]^{2}} while being C 2 {\displaystyle C^{2}} apart from a closed piecewise C 2 {\displaystyle C^{2}} singularity curve with bounded curvature. The decay rate of the L 2 {\displaystyle L^{2}} -error of the N {\displaystyle N} -term shearlet approximation obtained by taking the N {\displaystyle N} largest coefficients from the shearlet expansion is in fact optimal up to a log-factor: ‖ f − f N ‖ L 2 2 ≤ C N − 2 ( log N ) 3 , N → ∞ , {\displaystyle \|f-f_{N}\|_{L^{2}}^{2}\leq CN^{-2}(\log N)^{3},\quad N\to \infty ,} where the constant C {\displaystyle C} depends only on the maximum curvature of the singularity curve and the maximum magnitudes of f {\displaystyle f} , f ′ {\displaystyle f'} and f ″ . {\displaystyle f''.} This approximation rate significantly improves the best N {\displaystyle N} -term approximation rate of wavelets providing only O ( N − 1 ) {\displaystyle O(N^{-1})} for such class of functions. Shearlets are to date the only directional representation system that provides sparse approximation of anisotropic features while providing a unified treatment of the continuum and digital realm that allows faithful implementation. Extensions of shearlet systems to L 2 ( R d ) , d ≥ 2 {\displaystyle L^{2}(\mathbb {R} ^{d}),d\geq 2} are also available. A comprehensive presentation of the theory and applications of shearlets can be found in. == Definition == === Continuous shearlet systems === The construction of continuous shearlet systems is based on parabolic scaling matrices A a = [ a 0 0 a 1 / 2 ] , a > 0 {\displaystyle A_{a}={\begin{bmatrix}a&0\\0&a^{1/2}\end{bmatrix}},\quad a>0} as a means to change the resolution, on shear matrices S s = [ 1 s 0 1 ] , s ∈ R {\displaystyle S_{s}={\begin{bmatrix}1&s\\0&1\end{bmatrix}},\quad s\in \mathbb {R} } as a means to change the orientation, and finally on translations to change the positioning. In comparison to curvelets, shearlets use shearings instead of rotations, the advantage being that the shear operator S s {\displaystyle S_{s}} leaves the integer lattice invariant in case s ∈ Z {\displaystyle s\in \mathbb {Z} } , i.e., S s Z 2 ⊆ Z 2 . {\displaystyle S_{s}\mathbb {Z} ^{2}\subseteq \mathbb {Z} ^{2}.} This indeed allows a unified treatment of the continuum and digital realm, thereby guaranteeing a faithful digital implementation. For ψ ∈ L 2 ( R 2 ) {\displaystyle \psi \in L^{2}(\mathbb {R} ^{2})} the continuous shearlet system generated by ψ {\displaystyle \psi } is then defined as SH c o n t ( ψ ) = { ψ a , s , t = a 3 / 4 ψ ( S s A a ( ⋅ − t ) ) ∣ a > 0 , s ∈ R , t ∈ R 2 } , {\displaystyle \operatorname {SH} _{\mathrm {cont} }(\psi )=\{\psi _{a,s,t}=a^{3/4}\psi (S_{s}A_{a}(\cdot -t))\mid a>0,s\in \mathbb {R} ,t\in \mathbb {R} ^{2}\},} and the corresponding continuous shearlet transform is given by the map f ↦ S H ψ f ( a , s , t ) = ⟨ f , ψ a , s , t ⟩ , f ∈ L 2 ( R 2 ) , ( a , s , t ) ∈ R > 0 × R × R 2 . {\displaystyle f\mapsto {\mathcal {SH}}_{\psi }f(a,s,t)=\langle f,\psi _{a,s,t}\rangle ,\quad f\in L^{2}(\mathbb {R} ^{2}),\quad (a,s,t)\in \mathbb {R} _{>0}\times \mathbb {R} \times \mathbb {R} ^{2}.} === Discrete shearlet systems === A discrete version of shearlet systems can be directly obtained from SH c o n t ( ψ ) {\displaystyle \operatorname {SH} _{\mathrm {cont} }(\psi )} by discretizing the parameter set R > 0 × R × R 2 . {\displaystyle \mathbb {R} _{>0}\times \mathbb {R} \times \mathbb {R} ^{2}.} There are numerous approaches for this but the most popular one is given by { ( 2 j , k , A 2 j − 1 S k − 1 m ) ∣ j ∈ Z , k ∈ Z , m ∈ Z 2 } ⊆ R > 0 × R × R 2 . {\displaystyle \{(2^{j},k,A_{2^{j}}^{-1}S_{k}^{-1}m)\mid j\in \mathbb {Z} ,k\in \mathbb {Z} ,m\in \mathbb {Z} ^{2}\}\subseteq \mathbb {R} _{>0}\times \mathbb {R} \times \mathbb {R} ^{2}.} From this, the discrete shearlet system associated with the shearlet generator ψ {\displaystyle \psi } is defined by SH ( ψ ) = { ψ j , k , m = 2 3 j / 4 ψ ( S k A 2 j ⋅ − m ) ∣ j ∈ Z , k ∈ Z , m ∈ Z 2 } , {\displaystyle \operatorname {SH} (\psi )=\{\psi _{j,k,m}=2^{3j/4}\psi (S_{k}A_{2^{j}}\cdot {}-m)\mid j\in \mathbb {Z} ,k\in \mathbb {Z} ,m\in \mathbb {Z} ^{2}\},} and the associated discrete shearlet transform is defined by f ↦ S H ψ f ( j , k , m ) = ⟨ f , ψ j , k , m ⟩ , f ∈ L 2 ( R 2 ) , ( j , k , m ) ∈ Z × Z × Z 2 . {\displaystyle f\mapsto {\mathcal {SH}}_{\psi }f(j,k,m)=\langle f,\psi _{j,k,m}\rangle ,\quad f\in L^{2}(\mathbb {R} ^{2}),\quad (j,k,m)\in \mathbb {Z} \times \mathbb {Z} \times \mathbb {Z} ^{2}.} == Examples == Let ψ 1 ∈ L 2 ( R ) {\displaystyle \psi _{1}\in L^{2}(\mathbb {R} )} be a function satisfying the discrete Calderón condition, i.e., ∑ j ∈ Z | ψ ^ 1 ( 2 − j ξ ) | 2 = 1 , for a.e. ξ ∈ R , {\displaystyle \sum _{j\in \mathbb {Z} }|{\hat {\psi }}_{1}(2^{-j}\xi )|^{2}=1,{\text{for a.e. }}\xi \in \mathbb {R} ,} with ψ ^ 1 ∈ C ∞ ( R ) {\displaystyle {\hat {\psi }}_{1}\in C^{\infty }(\mathbb {R} )} and supp ψ ^ 1 ⊆ [ − 1 2 , − 1 16 ] ∪ [ 1 16 , 1 2 ] , {\displaystyle \operatorname {supp} {\hat {\psi }}_{1}\subseteq [-{\tfrac {1}{2}},-{\tfrac {1}{16}}]\cup [{\tfrac {1}{16}},{\tfrac {1}{2}}],} where ψ ^ 1 {\displaystyle {\hat {\psi }}_{1}} denotes the Fourier transform of ψ 1 . {\displaystyle \psi _{1}.} For instance, one can choose ψ 1 {\displaystyle \psi _{1}} to be a Meyer wavelet. Furthermore, let ψ 2 ∈ L 2 ( R ) {\displaystyle \psi _{2}\in L^{2}(\mathbb {R} )} be such that ψ ^ 2 ∈ C ∞ ( R ) , {\displaystyle {\hat {\psi }}_{2}\in C^{\infty }(\mathbb {R} ),} supp ψ ^ 2 ⊆ [ − 1 , 1 ] {\displaystyle \operatorname {supp} {\hat {\psi }}_{2}\subseteq [-1,1]} and ∑ k = − 1 1 | ψ ^ 2 ( ξ + k ) | 2 = 1 , for a.e. ξ ∈ [ − 1 , 1 ] . {\displaystyle \sum _{k=-1}^{1}|{\hat {\psi }}_{2}(\xi +k)|^{2}=1,{\text{for a.e. }}\xi \in \left[-1,1\right].} One typically chooses ψ ^ 2 {\displaystyle {\hat {\psi }}_{2}} to be a smooth bump function. Then ψ ∈ L 2 ( R 2 ) {\displaystyle \psi \in L^{2}(\mathbb {R} ^{2})} given by ψ ^ ( ξ ) = ψ ^ 1 ( ξ 1 ) ψ ^ 2 ( ξ 2 ξ 1 ) , ξ = ( ξ 1 , ξ 2 ) ∈ R 2 , {\displaystyle {\hat {\psi }}(\xi )={\hat {\psi }}_{1}(\xi _{1}){\hat {\psi }}_{2}\left({\tfrac {\xi _{2}}{\xi _{1}}}\right),\quad \xi =(\xi _{1},\xi _{2})\in \mathbb {R} ^{2},} is called a classical shearlet. It can be shown that the corresponding discrete shearlet system SH ( ψ ) {\displaystyle \operatorname {SH} (\psi )} constitutes a Parseval frame for L 2 ( R 2 ) {\displaystyle L^{2}(\mathbb {R} ^{2})} consisting of bandlimited functions. Another example are compactly supported shearlet systems, where a compactly supported function ψ ∈ L 2 ( R 2 ) {\displaystyle \psi \in L^{2}(\mathbb {R} ^{2})} can be chosen so that SH ( ψ ) {\displaystyle \operatorname {SH} (\psi )} forms a frame for L 2 ( R 2 ) {\displaystyle L^{2}(\mathbb {R} ^{2})} . In this case, all shearlet elements in SH ( ψ ) {\displaystyle \operatorname {SH} (\psi )} are compactly supported providing superior spatial localization compared to the classical shearlets, which are bandlimited. Although a compactly supported shearlet system does not generally form a Parseval frame, any function f ∈ L 2 ( R 2 ) {\displaystyle f\in L^{2}(\mathbb {R} ^{2})} can be represented by the shearlet expansion due to its frame property. == Cone-adapted shearlets == One drawback of shearlets defined as above is the directional bias of shearlet elements associated with large shearing parameters. This effect is already r
Samer Hassan
Samer Hassan is a computer scientist, social scientist, activist and researcher, focused on the study of the collaborative economy, online communities and decentralized technologies. He is an associate professor at Universidad Complutense de Madrid (Spain) and Faculty Associate at the Berkman Klein Center for Internet & Society at Harvard University. He is the recipient of an ERC Grant of 1.5M€ with the P2P Models project, to research blockchain-based decentralized autonomous organizations for the collaborative economy. == Education and career == Hassan is a Spanish/Lebanese scholar with an interdisciplinary background, which combines computer sciences with social sciences and activism. He received a degree in Computer Science and MSc in Artificial Intelligence from the Universidad Complutense de Madrid (UCM) in Spain. He also studied three years of Political Science at the distance learning university UNED. He then pursued a PhD in Social Simulation at the department of Software Engineering and Artificial Intelligence of UCM, supervised by the computer scientist Juan Pavón and the sociologist Millán Arroyo-Menéndez. He has been researching in several institutions, funded by several scholarships and awards, most notably Harvard's Real Colegio Complutense, and the Spanish postdoctoral grants Juan de la Cierva and José Castillejo. Thus, he was a visiting researcher at the Centre for Research in Social Simulation, in the Department of Sociology at the University of Surrey in the UK, working under the supervision of Nigel Gilbert (2007-2008), and a lecturer at the American University of Science and Technology in Lebanon (2010–11). He was selected as Fellow at the Berkman Klein Center for Internet & Society at Harvard University (2015-2017) and is presently a Faculty Associate at the same structure. Starting in 2024, he joined, as affiliate faculty, the Institute for Digital Cooperative Economy (The New School), part of the Platform Cooperativism Consortium. == Activism and social engagement == As an activist, Hassan has been engaged in both offline (La Tabacalera de Lavapiés, Medialab-Prado) and online (Ourproject.org, Barrapunto, Wikipedia) initiatives. He was accredited as a grassroots facilitator by the Altekio Cooperative. He co-founded the Comunes Nonprofit in 2009 and the Move Commons webtool project in 2010. He has co-organized practitioner-oriented workshops on platform co-ops and free/open source decentralized tools for communities, and has presented his work in non-academic conferences of Mozilla, the Internet Archive, and others. As a privacy advocate, he co-created a course on cyber-ethics which has been teaching since 2013 (as of 2021). He was co-founder of the Sci-Fdi Spanish science-fiction magazine. His gender is non-binary and uses he/they pronouns. == Work == Hassan's interdisciplinary research spans multiple fields, including online communities, online governance, online collaboration, decentralized technologies, blockchain-based decentralized autonomous organizations, free/libre/open source software, Commons-based peer production, agent-based social simulation, social movements and cyberethics. He has published more than 60 works in these fields. Hassan's PhD thesis focused on the methodological challenges for building data-driven social simulation models. The main model built simulated the transition from modern values to postmodern values in Spain. His methodological work also explored the combination of different artificial intelligence technologies, i.e. software agents with fuzzy logic, data mining, natural language processing, and microsimulation. In his postdoctoral period, he focused on experimenting with multiple software systems to facilitate the collaborative economy, e.g. semantic-web labelling for commons-based initiatives, distribution of value in peer production communities, agent-supported online assemblies, decentralized real-time collaborative software, decentralized blockchain based reputation, or blockchain-enabled commons governance. Hassan was Principal Investigator of the UCM partner in the EU-funded P2Pvalue project on building decentralized web-tools for collaborative communities. As such, he led the team that created SwellRT, a federated backend-as-a-service focused to ease development of apps featuring real-time collaboration. Intellectual Property of this project was transferred to the Apache Software Foundation in 2017. As part of this research line, Hassan's team also develop two SwellRT-based apps, "Teem" for management of social collectives and Jetpad, a federated real time editor. He presented the innovations concerning these software at Harvard's Berkman Klein Center and Harvard's Center for Research on Computation and Society. Other research lines offered outcomes beyond publications. "Wikichron", coled by Javier Arroyo, is a web tool to visualize MediaWiki community metrics, currently in production and available for third-parties. "Decentralized Science", led by Hassan's PhD student Ámbar Tenorio-Fornés, is a framework to facilitate decentralized infrastructure and open peer review in the scientific publication process, which has been selected by the European Commission to receive funding as a spin-off social enterprise. His research on blockchain and crowdfunding models awarded him with a commission from Triple Canopy. His team pushed forward a mapping of the ecosystem of blockchain for social good, led by the Joint Research Centre and published by the European Commission. As part of his ERC project P2P Models, Hassan and his team –including Silvia Semenzin– are investigating whether blockchain technology and Decentralized Autonomous Organizations could contribute to improving the governance of commons-oriented communities, both online and offline. Their work has been showcased for tackling the impact of blockchain on governance, proposing alternatives to the current sharing economy, emerging forms of techno-social systems like NFTs or prediction markets, or giving relevance to gender issues in the field. Hassan was invited to present the project achievements in Harvard Kennedy School, MIT Media Lab, Harvard's Data Privacy Lab, Harvard's Center for Research on Computation and Society, and Harvard's SEAS EconCS. British MP and Opposition Leader Ed Miliband showcased his research and its potential impact on policy. The project made public its way of organizing and its core values. In particular, it has shown a commitment to diversity as a core value in hiring, or choosing case studies. == Selected works == Arroyo, Javier; Davó, David; Martínez-Vicente, Elena; Faqir-Rhazoui, Youssef; Hassan, Samer (8 November 2022). "DAO-Analyzer: Exploring Activity and Participation in Blockchain Organizations" (PDF). Companion Publication of the 2022 Conference on Computer Supported Cooperative Work and Social Computing. CSCW'22 Companion. New York, NY, USA: Association for Computing Machinery. pp. 193–196. doi:10.1145/3500868.3559707. ISBN 978-1-4503-9190-0. Rozas, David; Tenorio-Fornés, Antonio; Díaz-Molina, Silvia; Hassan, Samer (2021). "When Ostrom Meets Blockchain: Exploring the Potentials of Blockchain for Commons Governance". SAGE Open. 11 (1): 215824402110025. doi:10.1177/21582440211002526. ISSN 2158-2440. Faqir-Rhazoui, Youssef; Ariza-Garzón, Miller-Janny; Arroyo, Javier; Hassan, Samer (8 May 2021). "Effect of the Gas Price Surges on User Activity in the DAOs of the Ethereum Blockchain" (PDF). Extended Abstracts of the 2021 CHI Conference on Human Factors in Computing Systems. CHI EA '21. New York, NY, USA: Association for Computing Machinery. pp. 1–7. doi:10.1145/3411763.3451755. ISBN 978-1-4503-8095-9. Hassan, Samer; Filippi, Primavera De (20 April 2021). "Decentralized Autonomous Organization". Internet Policy Review. 10 (2). doi:10.14763/2021.2.1556. hdl:10419/235960. ISSN 2197-6775. Joint Research Centre (European Commission); Hassan, Samer; Hakami, Anna; Brekke, Jaya Klara; De Filippi, Primavera; Lopéz Morales, Genoveva; Pólvora, Alexandre; Orgaz Alonso, Christian; Bodó, Balázs (2020). Scanning the European ecosystem of distributed ledger technologies for social and public good: what, why, where, how, and ways to move forward. LU: Publications Office of the European Union. doi:10.2760/300796. ISBN 978-92-76-21578-3. Filippi, Primavera De; Hassan, Samer (14 November 2016). "Blockchain technology as a regulatory technology: From code is law to law is code". First Monday. arXiv:1801.02507. doi:10.5210/fm.v21i12.7113. ISSN 1396-0466.
The Best Free AI Virtual Assistant for Beginners
Comparing the best AI virtual assistant? An AI virtual assistant is software that uses machine learning to help you get more done — it lowers the barrier so anyone can produce professional output. Privacy matters too: check whether your data trains the model and whether a no-log or enterprise tier is available. Whether you are a beginner or a pro, the right AI virtual assistant slots into your workflow and pays for itself fast. We tested the leading options and ranked them by quality, value, and ease of use.
AI Customer-support Bots Reviews: What Actually Works in 2026
Looking for the best AI customer-support bot? An AI customer-support bot is software that uses machine learning to help you get more done — it can save you hours every week by automating repetitive work. Most options offer a generous free tier, with paid plans unlocking higher limits, faster processing, and team features. Whether you are a beginner or a pro, the right AI customer-support bot slots into your workflow and pays for itself fast. Read on for hands-on impressions, pricing tiers, and the standout features that matter.
Right to explanation
In the regulation of algorithms, particularly artificial intelligence and its subfield of machine learning, a right to [an] explanation is a right to be given an explanation for an output of the algorithm. Such rights primarily refer to individual rights to be given an explanation for decisions that significantly affect an individual, particularly legally or financially. For example, a person who applies for a loan and is denied may ask for an explanation, which could be "Credit bureau X reports that you declared bankruptcy last year; this is the main factor in considering you too likely to default, and thus we will not give you the loan you applied for." Some such legal rights already exist, while the scope of a general "right to explanation" is a matter of ongoing debate. There have been arguments made that a "social right to explanation" is a crucial foundation for an information society, particularly as the institutions of that society will need to use digital technologies, artificial intelligence, machine learning. In other words, that the related automated decision making systems that use explainability would be more trustworthy and transparent. Without this right, which could be constituted both legally and through professional standards, the public will be left without much recourse to challenge the decisions of automated systems. == Examples == === Credit scoring in the United States === Under the Equal Credit Opportunity Act (Regulation B of the Code of Federal Regulations), Title 12, Chapter X, Part 1002, §1002.9, creditors are required to notify applicants who are denied credit with specific reasons for the detail. As detailed in §1002.9(b)(2): (2) Statement of specific reasons. The statement of reasons for adverse action required by paragraph (a)(2)(i) of this section must be specific and indicate the principal reason(s) for the adverse action. Statements that the adverse action was based on the creditor's internal standards or policies or that the applicant, joint applicant, or similar party failed to achieve a qualifying score on the creditor's credit scoring system are insufficient. The official interpretation of this section details what types of statements are acceptable. Creditors comply with this regulation by providing a list of reasons (generally at most 4, per interpretation of regulations), consisting of a numeric reason code (as identifier) and an associated explanation, identifying the main factors affecting a credit score. An example might be: 32: Balances on bankcard or revolving accounts too high compared to credit limits === European Union === The European Union General Data Protection Regulation (GDPR, enacted 2016, taking effect 2018) extends the automated decision-making rights in the 1995 Data Protection Directive to provide a legally disputed form of a right to an explanation, stated as such in Recital 71: "[the data subject should have] the right ... to obtain an explanation of the decision reached". In full: The data subject should have the right not to be subject to a decision, which may include a measure, evaluating personal aspects relating to him or her which is based solely on automated processing and which produces legal effects concerning him or her or similarly significantly affects him or her, such as automatic refusal of an online credit application or e-recruiting practices without any human intervention. ... In any case, such processing should be subject to suitable safeguards, which should include specific information to the data subject and the right to obtain human intervention, to express his or her point of view, to obtain an explanation of the decision reached after such assessment and to challenge the decision. However, the extent to which the regulations themselves provide a "right to explanation" is heavily debated. There are two main strands of criticism. There are significant legal issues with the right as found in Article 22 — as recitals are not binding, and the right to an explanation is not mentioned in the binding articles of the text, having been removed during the legislative process. In addition, there are significant restrictions on the types of automated decisions that are covered — which must be both "solely" based on automated processing, and have legal or similarly significant effects — which significantly limits the range of automated systems and decisions to which the right would apply. In particular, the right is unlikely to apply in many of the cases of algorithmic controversy that have been picked up in the media. The UK has also recently amended its implementation of Article 22. A second potential source of such a right has been pointed to in Article 15, the "right of access by the data subject". This restates a similar provision from the 1995 Data Protection Directive, allowing the data subject access to "meaningful information about the logic involved" in the same significant, solely automated decision-making, found in Article 22. Yet this too suffers from alleged challenges that relate to the timing of when this right can be drawn upon, as well as practical challenges that mean it may not be binding in many cases of public concern. Other EU legislative instruments contain explanation rights. The European Union's Artificial Intelligence Act provides in Article 86 a "[r]ight to explanation of individual decision-making" of certain high risk systems which produce significant, adverse effects to an individual's health, safety or fundamental rights. The right provides for "clear and meaningful explanations of the role of the AI system in the decision-making procedure and the main elements of the decision taken", although only applies to the extent other law does not provide such a right. The Digital Services Act in Article 27, and the Platform to Business Regulation in Article 5, both contain rights to have the main parameters of certain recommender systems to be made clear, although these provisions have been criticised as not matching the way that such systems work. The Platform Work Directive, which provides for regulation of automation in gig economy work as an extension of data protection law, further contains explanation provisions in Article 11, using the specific language of "explanation" in a binding article rather than a recital as is the case in the GDPR. Scholars note that remains uncertainty as to whether these provisions imply sufficiently tailored explanation in practice which will need to be resolved by courts. === France === In France the 2016 Loi pour une République numérique (Digital Republic Act or loi numérique) amends the country's administrative code to introduce a new provision for the explanation of decisions made by public sector bodies about individuals. It notes that where there is "a decision taken on the basis of an algorithmic treatment", the rules that define that treatment and its "principal characteristics" must be communicated to the citizen upon request, where there is not an exclusion (e.g. for national security or defence). These should include the following: the degree and the mode of contribution of the algorithmic processing to the decision- making; the data processed and its source; the treatment parameters, and where appropriate, their weighting, applied to the situation of the person concerned; the operations carried out by the treatment. Scholars have noted that this right, while limited to administrative decisions, goes beyond the GDPR right to explicitly apply to decision support rather than decisions "solely" based on automated processing, as well as provides a framework for explaining specific decisions. Indeed, the GDPR automated decision-making rights in the European Union, one of the places a "right to an explanation" has been sought within, find their origins in French law in the late 1970s. == Criticism == Some argue that a "right to explanation" is at best unnecessary, at worst harmful, and threatens to stifle innovation. Specific criticisms include: favoring human decisions over machine decisions, being redundant with existing laws, and focusing on process over outcome. Authors of study "Slave to the Algorithm? Why a 'Right to an Explanation' Is Probably Not the Remedy You Are Looking For" Lilian Edwards and Michael Veale argue that a right to explanation is not the solution to harms caused to stakeholders by algorithmic decisions. They also state that the right of explanation in the GDPR is narrowly defined, and is not compatible with how modern machine learning technologies are being developed. With these limitations, defining transparency within the context of algorithmic accountability remains a problem. For example, providing the source code of algorithms may not be sufficient and may create other problems in terms of privacy disclosures and the gaming of technical systems. To mitigate this issue, Edwards and Veale argue that an auditing system could be more effective, to allow auditors to loo
Christopher K. I. Williams
Christopher Kenneth Ingle Williams (born 1960) is a professor at the School of Informatics, University of Edinburgh, working in Artificial intelligence, and particularly the areas of Machine learning and Computer vision. == Education == Williams received a BA in Physics and Theoretical Physics from the University of Cambridge in 1982, followed by Part III Mathematics (1983). He did a MSc in Water Resources at the University of Newcastle-Upon-Tyne, then worked in Lesotho on low-cost sanitation. In 1988, he studied at the Department of Computer Science of the University of Toronto under the supervision of Geoffrey Hinton. He obtained his MSc and PhD both in computer science, in 1990 and 1994, respectively. == Career and research == In 1994, Williams moved to Aston University as a Research Fellow. He became a Lecturer in August 1995. He moved to the University of Edinburgh in July 1998 and became Reader in 2000. He obtained a Personal Chair in Machine Learning in 2005 in the School of Informatics. Williams has been a Fellow of the European Laboratory for Learning and Intelligent Systems (ELLIS) since 2019. Williams' research interests are in machine learning and computer vision. He has worked on new models for understanding time-series and images, and for finding structure in data. He is best known for his work on Gaussian processes and for the book Gaussian Processes for Machine Learning, co-authored with Carl Rasmussen. The book received the 2009 DeGroot Prize of the International Society for Bayesian Analysis. Williams was an organizer of the PASCAL Visual Object Classes (VOC) project (2005–2012) along with Mark Everingham, Luc van Gool, John Winn, and Andrew Zisserman. == Awards and honours == In 2021 Williams was elected a Fellow of the Royal Society of Edinburgh (FRSE).