TAUM (Traduction Automatique à l'Université de Montréal) is the name of a research group which was set up at the Université de Montréal in 1965. Most of its research was done between 1968 and 1980. It gave birth to the TAUM-73 and TAUM-METEO machine translation prototypes, using the Q-Systems programming language created by Alain Colmerauer, which were among the first attempts to perform automatic translation through linguistic analysis. The prototypes were never used in actual production. The TAUM-METEO name has been erroneously used for many years to designate the METEO System subsequently developed by John Chandioux.
Adobe GoLive
Adobe GoLive was a WYSIWYG HTML editor and web site management application from Adobe Systems. It replaced Adobe PageMill as Adobe's primary HTML editor and was itself discontinued in favor of Dreamweaver. The last version of GoLive that Adobe released was GoLive 9. == History == GoLive originated as the flagship product of a company named GoNet Communication, Inc. then based in Menlo Park, California, and the development company GoNet Communications GmbH in Hamburg, Germany, in 1996. Later GoNet changed its name to GoLive Systems, Inc, and the name of its product to GoLive CyberStudio. Adobe acquired GoLive in 1999 and re-branded the GoLive CyberStudio product to what became Adobe GoLive. Adobe took over the Hamburg office as an Adobe development site to continue to develop the product. At the time of the acquisition, CyberStudio was a Macintosh-only application. In the spring of 1999 Adobe released Adobe GoLive for both Macintosh and Microsoft Windows. The first versions of Dreamweaver and CyberStudio were released in a similar timeframe. However, Dreamweaver eventually became the dominant WYSIWYG HTML editor in market share. After the Adobe acquisition of Macromedia (the company that had owned Dreamweaver), GoLive was progressively re-targeted toward Adobe's traditional design market, and the product became better integrated with Adobe's existing suite of design-oriented software products and less focused on the professional web development market. The Adobe CS2 Premium suite contained GoLive CS2. With the release of Creative Suite 3, Adobe integrated Dreamweaver as a replacement for GoLive and released GoLive 9 as a standalone product. In April 2008, Adobe announced that sales and development of GoLive would cease in favor of Dreamweaver. == General description and distinctive aspects == GoLive incorporated a largely modeless workflow that relied heavily on drag-and-drop. Most user interaction was done via a contextual inspector rather than the modal workflow found in Dreamweaver. Among its features were a separate editor for tables that supported nesting, and a two-dimensional panel for applying CSS styles to elements. GoLive supported drag-and-drop of native Adobe Photoshop and Adobe Illustrator files via what the company called "Smart Objects", which then automatically guided the user through saving those files in web-supported formats. Updates to the original Photoshop or Illustrator assets were automatically tracked by GoLive. It also implemented a tool called "Components" which allowed updates to interface elements throughout a site to be updated globally by changing one single file. As a website management tool, GoLive allowed users to transfer and publish content directly from within the application, and allowed individual files to be excluded from uploading. == Features == One of the new features of GoLive version 5 was Dynamic Link, which was a method of creating dynamic, database-driven web content without the need to know a server-side language and with full WYSIWYG support in the GoLive user interface. GoLive had a powerful set of extensibility API which could be used to add additional functionality to the product. The GoLive SDK provided interfaces which allowed developers to use a combination of XML, JavaScript and C/C++ to create plugins for the product. The extensibility API allowed developers access to custom drawing and event handling using JavaScript, as well as a full JavaScript debugger and command line interpreter. This allowed intermediate-level developers using interpreted JavaScript to create sophisticated user interfaces. == Language and framework structure == Adobe GoLive is coded in the C++ programming language. It uses a custom C++ framework called SCL (Simple Class Library) which was initially built from scratch by the engineers at GoLive Systems Inc. The SCL framework was also used in the short-lived Adobe Atmosphere 3D software. == Release history == As the final version, GoLive 9 was discontinued in April 2008.
Stephanie Dinkins
Stephanie Dinkins (born 1964) is a transdisciplinary American artist based in Brooklyn, New York. She creates art about artificial intelligence (AI) as it intersects race, gender, and history. Her aim is to "create a unique culturally attuned AI entity in collaboration with coders, engineers and in close consultation with local communities of color that reflects and is empowered to work toward the goals of its community." Dinkins projects include Conversations with Bina48, a series of conversations between Dinkins and the first social, artificially intelligent humanoid robot BINA48 who looks like a black woman and Not the Only One, a multigenerational artificially intelligent memoir trained off of three generations of Dinkins's family. == Early life and education == Dinkins was born in Perth Amboy, New Jersey to Black American parents who raised her in Staten Island, New York. She credits her grandmother with teaching her how to think about art as a social practice, saying "my grandmother . . . was a gardener and the garden was her art . . . that was a community practice." Dinkins attended the International Center of Photography School in New York City in 1995, where she completed the general studies in photography certificate program. Dinkins received a MFA in photography from the Maryland Institute College of Art in 1997 She completed the Independent Study Program at the Whitney Museum of American Art in 1998. == Career == Dinkins is the Yayoi Kusama Professor of Art at Stony Brook University in New York. == Activism == Dinkins advocates for co-creation within a social practice art framework, so that vulnerable communities understand how to use technology to their advantage, instead of being subjected to their use. This is exemplified in her works such as Project al-Khwarzmi, a series of workshops entitled PAK POP-UP at the nonprofit community center Recess in Brooklyn, NY. The workshops involved collaborating with youth in the criminal justice system and uplifting the voices of vulnerable communities in determining how technologies are created and utilized. Dinkins warns of the dangers to members of minority groups that are absent from the creation of the computer algorithms that now affect their lives. == Art == Dinkins's practice employs technologies including, but not limited to, new media such as artificial intelligence and machine learning. Dinkins uses oral history techniques of interviewing to craft community-authored narratives and databases which inform the subjects of her work and serve as acts of social intervention or protest. === Conversations with Bina48 (2014–present) === Dinkins began working on Conversations with Bina48 in 2014. For the series, Dinkins recorded her conversations with BINA48, a social robot that resembles a middle-aged black woman. Dinkins mirrors Bina48 while they discuss identity and technological singularity. In 2010, Hanson Robotics, an engineering and robotics company known for its development of humanoid robots, developed and released BINA48. Bina48 is a robot modeled after the memories, beliefs, attitudes, commentary and mannerisms of Bina Aspen Rothblatt, the spousal partner of Martine Rothblatt. Both Bina and Martine Rothblatt own Bina48 under their organization, the Terasem Movement Foundation. Five years after Bina48 was released, Dinkins came across a YouTube video of Bina48. She asked, "how did a black woman become the most advanced of the technologies at the time?" Her questioning led her to travel to Lincoln, Vermont (the site of the Terasem Movement Foundation) where she conducted a series of interviews with Bina48 and engaged the robot in conversations pertaining to race, intimacy and the nature of being. The conversations suggest opportunities for complementing human existence with artificially intelligent agents that have an identity and history, but also show artificial intelligence's current limitations. Although it is based on a black woman, Dinkins found that Bina48 was shaped by the biases of its white, male creators. === Project al Kwarizmi (PAK) (2017–present) === Project al Kwarizmi (PAK) was a series of pop up workshops in Brooklyn, NY at Eyebeam and Recess; Manhattan, New York at Google; and Durham, North Carolina at Duke University. The workshops were centered for "communities of color that use art as a vehicle to help citizens understand how algorithms, the artificially intelligent systems they underpin, and big data impact their lives and empowers them to do something about it. Project al-Khwarizmi uses art and aesthetics as the common language to help citizens understand what algorithms and artificial intelligent systems are, and where these systems already impact our daily lives." === Not the Only One (N'TOO) (2018–present) === Not the only one (N’TOO) is a voice-interactive chatbot that was trained with data from members of her family to tell a multi-generational story. Dinkins described Not The Only One (NTOO or N'TOO) as an "experimental" multigenerational memoir of one Black American family told from the "mind" of an artificial intelligence of evolving intellect. N'TOO uses a recursive neural network, a deep learning algorithm. It is a voice-interactive AI robot designed, trained, and aligned with the needs and ideals of black and brown people who are drastically underrepresented in the tech sector. NTOO can also be described as a "physically embodied artificially intelligent agent that senses and acts on its world." == Exhibitions == Dinkins's work is exhibited internationally at various public, private, community, and institutional venues, including the Whitney Museum of American Art, the de Young Museum, the Philadelphia Museum of Art, the Studio Museum in Harlem;, Museum of Contemporary Photography, the Long Island Museum of American Art, History, and Carriages, the International Center of Photography in New York, Herning Kunstmuseum in Herning, Denmark, The Barbican in London, UK, Islip Art Museum, Wave Hill, Taller Boricua, the Queens Museum, and the corner of Putnam and Malcolm X Blvd in Bedford Stuyvesant, Brooklyn, New York. She has presented her work in symposia at the Museum of Modern Art, amongst other venues. == Future Histories Studio == Dinkins is the founder and director of Future Histories Studio, a research laboratory for arts-centered inquiry and production based at Stony Brook University. The studio was established with support from the Mellon Foundation as part of the Digital Inquiry, Speculation, Collaboration, and Optimism (DISCO) network. Future Histories Studio operates as an interdisciplinary hub exploring the intersections of art, technology, race, and storytelling through collaborative and practice-based research. Its activities include exhibitions, workshops, and public programs that examine the social and cultural implications of emerging technologies, particularly artificial intelligence and data systems. == Awards and recognition == Dinkins is the recipient of many awards, including: the 2023 LG Guggenheim Award, an international art prize established as part of a long-term global partnership between LG Group and the Solomon R. Guggenheim Museum to recognize groundbreaking artists in technology-based art; a Berggruen Institute artist fellowship; a Sundance New Frontiers Story Lab fellowship; a Soros Equality Fellowship; a Lucas Artists fellowship; a Creative Capital grant; a Bell Labs artist residency; a Blade of Grass fellowship; and a Data & Society fellowship. == Media coverage == Dinkins appeared in episode six of the HBO television series Random Acts of Flyness directed by Terence Nance, where she described her conversations with BINA48. == Other activities == Dinkins was part of the juries that selected Shu Lea Cheang for the LG Guggenheim Award in 2024.
Willy's Chocolate Experience
Willy's Chocolate Experience was an unlicensed event based on Charlie and the Chocolate Factory that took place in Glasgow, Scotland, in February 2024. The event was promoted as an immersive and interactive family experience, illustrated on a promotional website with "dreamlike" AI-generated images. Once it was discovered that the event was held in a sparsely decorated warehouse, many customers complained, and the police were called to the venue. The event went viral on the Internet and attracted worldwide media attention. The event drew comparisons to the 2008 Lapland New Forest controversy, the 2014 Tumblr fan convention DashCon, and Billy McFarland's 2017 Fyre Festival. == Background and advertising == The event was stated to take place over the weekend of 24–25 February 2024. Promotional material advertised "stunning and intricately designed settings inspired by Roald Dahl's timeless tale" and "an array of delectable treats scattered throughout the experience". Both the website and promotional material used poor-quality AI-generated images, which included several spelling errors such as "cartchy tuns" and "a pasadise of sweet teats" and nonsensical words such as "catgacating" and "exarserdray". Tickets cost up to £35 per person. While the event was being promoted in early February, a Reddit user who saw Facebook advertisements suspected it to be a scam and was surprised that people were apparently buying tickets based solely on AI-generated images. The event was organised by House of Illuminati, a company registered to Billy Coull which claimed to offer "unparalleled immersive experiences". An investigation by Third Force News conducted after the event described Coull's previous "murky involvement in the charity sector." Coull had previously registered several other companies and claimed to work as a "consultant" for the now-defunct brand Empowerity, formerly known as the charity Gowanbank Community Hub. In 2021, Gowanbank was forced to remove claims of a £95-per-ticket fundraising "gala" at DoubleTree Glasgow which had been falsely advertised to feature TV personalities and performers including Gok Wan and Joe Black. Coull had claimed to be a doctor with a fake degree from a false university that provided "metaphysical degrees", and had attempted to use the charity to win the 2022 Glasgow City Council election in the seat of Greater Pollok, though he never registered for the election. In the summer of 2023, he independently published 17 AI-generated books on various topics, including vaccine conspiracy theories. Rolling Stone concluded that House of Illuminati's websites and event descriptions were likely written by an AI chatbot, such as ChatGPT. Three actors were hired to portray "Willy McDuff", a character based on Willy Wonka. One of them, Paul Connell, said that the cast were given one day to learn the script. Another actor playing Willy McDuff was 18-year-old Michael Archibald; the experience was his first ever acting job, and he was given the script at 6 pm on Friday before the event began on Saturday. Kirsty Paterson, an actress who played one of the Oompa-Loompas (called "Wonkidoodles" in the script), said that the job offer had been posted on Indeed.com and offered £500 for two days of work. The day before the event, the actors attended a dress rehearsal at the sparsely decorated venue. They were told that others would be working through the night on the production. When they returned on the day of the event, the venue was in the same condition. Paterson was given her costume an hour before the event opened, saying that "We were just handed an Amazon box that probably arrived that morning." == Script == The script for the event is titled Wonkidoodles at McDuff's Chocolate Factory: A Script, and describes Willy McDuff leading an audience through the Garden of Enchantment and the Twilight Tunnel. Once there, they are confronted by a character called The Unknown, described as "an evil chocolate maker who lives in the walls" who seeks to steal the magical "Anti-Graffiti Gobstopper" from McDuff's Imagination Lab. The gobstopper is "a sweet so powerful, it can make any room sparkle without lifting a finger". McDuff defeats The Unknown by amplifying the power of the gobstopper and causing his enemy to be "gently swept up by a robotic vacuum, humorously ending the confrontation". The script was unusual in that it included stage directions for the audience, and descriptions of their reactions. Connell described it as "15 pages of AI-generated gibberish of me just monologuing these mad things", and compared the vacuum cleaner plot point to that of the Nintendo video game Luigi's Mansion. Interviewed after the event, Coull claimed to have written the script himself, using AI only to "check spelling, grammar, and continuity" as he said he had dyslexia. == Event == The event was held at the Box Hub Warehouse event space in Whiteinch, an industrial area of Glasgow. Customers described the venue as "little more than an abandoned, empty warehouse", with set dressings including a small bouncy castle, AI-generated backdrop images pinned to some of the walls, and props which were "strewn about on bare concrete floors". The venue's windows were dirty and its air conditioning systems were left exposed. Paterson has stated that by the time she saw the venue, she had already signed her contract and "didn't want to disappoint the kids", and thus chose to proceed with the work. The Unknown was played by a 16-year-old actress named Felicia Dawkins, who wore a silver mask and a black cloak. Young children were frightened by the character, who appeared from behind a large rectangular mirror. Despite the script calling for The Unknown to be defeated with a vacuum cleaner, no such prop was provided, and actors were instead asked to improvise. Connell said that he and other employees were told to give each child "two jelly beans and a quarter of a cup of lemonade", although the limited supply of jelly beans quickly ran out. Paterson and another "Wonkidoodle" actress, Jenny Fogarty, said that after the first three 45-minute performances, the cast were told to abandon the script and instead let guests walk through the venue, a process that Paterson said took "about two minutes". The character of The Unknown, previously introduced as the main antagonist, was now "scaring children for no reason". One of the actors playing McDuff improvised the idea that children should pull a "silly face" at The Unknown to scare them away, but Dawkins said that, in other cases, she "just had to awkwardly walk back to my corner". Connell was told he would be given a 15-minute break every 45 minutes, but on the day of the event, he played Willy McDuff for three and a half hours without a break. After returning from a lunch break, Connell encountered a crowd of customers demanding refunds from Coull, and the other actors were unsure what to do next. After being told that the event was now cancelled halfway through its opening day, the actors left and went to a pub. Upon returning to the venue some time later, Connell said that he felt "the threat of violence had become quite high" and that there were two police vans and two squad cars at the scene. == Customer reviews and response == Willy's Chocolate Experience was widely criticised by those who attended it, many of whom demanded refunds. One customer, who had driven with his children for two hours to reach the event, described it as an "absolute con". Other visitors who arrived after the event was closed and were not informed of its cancellation requested compensation for wasted rail fares. Following the event's cancellation, Coull offered to refund 850 people, a statement repeated by the event's Facebook page. Some Facebook users stated that they had received their money back. Paterson and Fogarty stated that they only received half of their paycheque. Box Hub, the organisation that had rented the warehouse to House of Illuminati, issued an apology on House of Illuminati's behalf, stating that they "either have no regards for the families and young children they have disappointed or are too embarrassed to comment", and offered to provide a venue free of charge for those who attended the event. House of Illuminati later stated that they would not host any future events. Coull deleted his LinkedIn profile, his YouTube channel, and his personal website in response to the controversy. A few days after the event, Connell said he felt that Coull was "probably one of the most disliked people in Glasgow right now". In an interview with The Sunday Times, Coull apologised for how the event turned out, saying he would accept responsibility. == Fundraising == In an interview with Wired magazine, Connell stated that he and the other actors were working with parents to provide a free show for the children who attended. Some items from the event were later auctioned for charity. The venue auctioned the leftover hand-written "even
BL (logic)
In mathematical logic, basic fuzzy logic (or shortly BL), the logic of the continuous t-norms, is one of the t-norm fuzzy logics. It belongs to the broader class of substructural logics, or logics of residuated lattices; it extends the logic MTL of all left-continuous t-norms. == Syntax == === Language === The language of the propositional logic BL consists of countably many propositional variables and the following primitive logical connectives: Implication → {\displaystyle \rightarrow } (binary) Strong conjunction ⊗ {\displaystyle \otimes } (binary). The sign & is a more traditional notation for strong conjunction in the literature on fuzzy logic, while the notation ⊗ {\displaystyle \otimes } follows the tradition of substructural logics. Bottom ⊥ {\displaystyle \bot } (nullary — a propositional constant); 0 {\displaystyle 0} or 0 ¯ {\displaystyle {\overline {0}}} are common alternative signs and zero a common alternative name for the propositional constant (as the constants bottom and zero of substructural logics coincide in MTL). The following are the most common defined logical connectives: Weak conjunction ∧ {\displaystyle \wedge } (binary), also called lattice conjunction (as it is always realized by the lattice operation of meet in algebraic semantics). Unlike MTL and weaker substructural logics, weak conjunction is definable in BL as A ∧ B ≡ A ⊗ ( A → B ) {\displaystyle A\wedge B\equiv A\otimes (A\rightarrow B)} Negation ¬ {\displaystyle \neg } (unary), defined as ¬ A ≡ A → ⊥ {\displaystyle \neg A\equiv A\rightarrow \bot } Equivalence ↔ {\displaystyle \leftrightarrow } (binary), defined as A ↔ B ≡ ( A → B ) ∧ ( B → A ) {\displaystyle A\leftrightarrow B\equiv (A\rightarrow B)\wedge (B\rightarrow A)} As in MTL, the definition is equivalent to ( A → B ) ⊗ ( B → A ) . {\displaystyle (A\rightarrow B)\otimes (B\rightarrow A).} (Weak) disjunction ∨ {\displaystyle \vee } (binary), also called lattice disjunction (as it is always realized by the lattice operation of join in algebraic semantics), defined as A ∨ B ≡ ( ( A → B ) → B ) ∧ ( ( B → A ) → A ) {\displaystyle A\vee B\equiv ((A\rightarrow B)\rightarrow B)\wedge ((B\rightarrow A)\rightarrow A)} Top ⊤ {\displaystyle \top } (nullary), also called one and denoted by 1 {\displaystyle 1} or 1 ¯ {\displaystyle {\overline {1}}} (as the constants top and zero of substructural logics coincide in MTL), defined as ⊤ ≡ ⊥ → ⊥ {\displaystyle \top \equiv \bot \rightarrow \bot } Well-formed formulae of BL are defined as usual in propositional logics. In order to save parentheses, it is common to use the following order of precedence: Unary connectives (bind most closely) Binary connectives other than implication and equivalence Implication and equivalence (bind most loosely) === Axioms === A Hilbert-style deduction system for BL has been introduced by Petr Hájek (1998). Its single derivation rule is modus ponens: from A {\displaystyle A} and A → B {\displaystyle A\rightarrow B} derive B . {\displaystyle B.} The following are its axiom schemata: ( B L 1 ) : ( A → B ) → ( ( B → C ) → ( A → C ) ) ( B L 2 ) : A ⊗ B → A ( B L 3 ) : A ⊗ B → B ⊗ A ( B L 4 ) : A ⊗ ( A → B ) → B ⊗ ( B → A ) ( B L 5 a ) : ( A → ( B → C ) ) → ( A ⊗ B → C ) ( B L 5 b ) : ( A ⊗ B → C ) → ( A → ( B → C ) ) ( B L 6 ) : ( ( A → B ) → C ) → ( ( ( B → A ) → C ) → C ) ( B L 7 ) : ⊥ → A {\displaystyle {\begin{array}{ll}{\rm {(BL1)}}\colon &(A\rightarrow B)\rightarrow ((B\rightarrow C)\rightarrow (A\rightarrow C))\\{\rm {(BL2)}}\colon &A\otimes B\rightarrow A\\{\rm {(BL3)}}\colon &A\otimes B\rightarrow B\otimes A\\{\rm {(BL4)}}\colon &A\otimes (A\rightarrow B)\rightarrow B\otimes (B\rightarrow A)\\{\rm {(BL5a)}}\colon &(A\rightarrow (B\rightarrow C))\rightarrow (A\otimes B\rightarrow C)\\{\rm {(BL5b)}}\colon &(A\otimes B\rightarrow C)\rightarrow (A\rightarrow (B\rightarrow C))\\{\rm {(BL6)}}\colon &((A\rightarrow B)\rightarrow C)\rightarrow (((B\rightarrow A)\rightarrow C)\rightarrow C)\\{\rm {(BL7)}}\colon &\bot \rightarrow A\end{array}}} The axioms (BL2) and (BL3) of the original axiomatic system were shown to be redundant (Chvalovský, 2012) and (Cintula, 2005). All the other axioms were shown to be independent (Chvalovský, 2012). == Semantics == Like in other propositional t-norm fuzzy logics, algebraic semantics is predominantly used for BL, with three main classes of algebras with respect to which the logic is complete: General semantics, formed of all BL-algebras — that is, all algebras for which the logic is sound Linear semantics, formed of all linear BL-algebras — that is, all BL-algebras whose lattice order is linear Standard semantics, formed of all standard BL-algebras — that is, all BL-algebras whose lattice reduct is the real unit interval [0, 1] with the usual order; they are uniquely determined by the function that interprets strong conjunction, which can be any continuous t-norm.
Rademacher complexity
In computational learning theory (machine learning and theory of computation), Rademacher complexity, named after Hans Rademacher, measures richness of a class of sets with respect to a probability distribution. The concept can also be extended to real valued functions. == Definitions == === Rademacher complexity of a set === Given a set A ⊆ R m {\displaystyle A\subseteq \mathbb {R} ^{m}} , the Rademacher complexity of A is defined as follows: Rad ( A ) := 1 m E σ [ sup a ∈ A ∑ i = 1 m σ i a i ] {\displaystyle \operatorname {Rad} (A):={\frac {1}{m}}\mathbb {E} _{\sigma }\left[\sup _{a\in A}\sum _{i=1}^{m}\sigma _{i}a_{i}\right]} where σ 1 , σ 2 , … , σ m {\displaystyle \sigma _{1},\sigma _{2},\dots ,\sigma _{m}} are independent random variables drawn from the Rademacher distribution i.e. Pr ( σ i = + 1 ) = Pr ( σ i = − 1 ) = 1 / 2 {\displaystyle \Pr(\sigma _{i}=+1)=\Pr(\sigma _{i}=-1)=1/2} for i ∈ { 1 , 2 , … , m } {\displaystyle i\in \{1,2,\dots ,m\}} , and a = ( a 1 , … , a m ) ∈ A {\displaystyle a=(a_{1},\ldots ,a_{m})\in A} . Some authors take the absolute value of the sum before taking the supremum, but if A {\displaystyle A} is symmetric this makes no difference. === Rademacher complexity of a function class === Let S = { z 1 , z 2 , … , z m } ⊆ Z {\displaystyle S=\{z_{1},z_{2},\dots ,z_{m}\}\subseteq Z} be a sample of points and consider a function class F {\displaystyle {\mathcal {F}}} of real-valued functions over Z {\displaystyle Z} . Then, the empirical Rademacher complexity of F {\displaystyle {\mathcal {F}}} given S {\displaystyle S} is defined as: Rad S ( F ) = 1 m E σ [ sup f ∈ F | ∑ i = 1 m σ i f ( z i ) | ] {\displaystyle \operatorname {Rad} _{S}({\mathcal {F}})={\frac {1}{m}}\mathbb {E} _{\sigma }\left[\sup _{f\in {\mathcal {F}}}\left|\sum _{i=1}^{m}\sigma _{i}f(z_{i})\right|\right]} This can also be written using the previous definition: Rad S ( F ) = Rad ( F ∘ S ) {\displaystyle \operatorname {Rad} _{S}({\mathcal {F}})=\operatorname {Rad} ({\mathcal {F}}\circ S)} where F ∘ S {\displaystyle {\mathcal {F}}\circ S} denotes function composition, i.e.: F ∘ S := { ( f ( z 1 ) , … , f ( z m ) ) ∣ f ∈ F } {\displaystyle {\mathcal {F}}\circ S:=\{(f(z_{1}),\ldots ,f(z_{m}))\mid f\in {\mathcal {F}}\}} The worst case empirical Rademacher complexity is Rad ¯ m ( F ) = sup S = { z 1 , … , z m } Rad S ( F ) {\displaystyle {\overline {\operatorname {Rad} }}_{m}({\mathcal {F}})=\sup _{S=\{z_{1},\dots ,z_{m}\}}\operatorname {Rad} _{S}({\mathcal {F}})} Let P {\displaystyle P} be a probability distribution over Z {\displaystyle Z} . The Rademacher complexity of the function class F {\displaystyle {\mathcal {F}}} with respect to P {\displaystyle P} for sample size m {\displaystyle m} is: Rad P , m ( F ) := E S ∼ P m [ Rad S ( F ) ] {\displaystyle \operatorname {Rad} _{P,m}({\mathcal {F}}):=\mathbb {E} _{S\sim P^{m}}\left[\operatorname {Rad} _{S}({\mathcal {F}})\right]} where the above expectation is taken over an identically independently distributed (i.i.d.) sample S = ( z 1 , z 2 , … , z m ) {\displaystyle S=(z_{1},z_{2},\dots ,z_{m})} generated according to P {\displaystyle P} . == Intuition == The Rademacher complexity is typically applied on a function class of models that are used for classification, with the goal of measuring their ability to classify points drawn from a probability space under arbitrary labellings. When the function class is rich enough, it contains functions that can appropriately adapt for each arrangement of labels, simulated by the random draw of σ i {\displaystyle \sigma _{i}} under the expectation, so that this quantity in the sum is maximized. The Rademacher complexity of a set A {\displaystyle A} can be rewritten as Rad ( A ) := 1 m E σ [ sup a ∈ A ∑ i = 1 m σ i a i ] = 1 m 2 m ∑ σ ∈ { − 1 / m , + 1 / m } m [ sup a ∈ A ⟨ σ , a ⟩ ] . {\displaystyle \operatorname {Rad} (A):={\frac {1}{m}}\mathbb {E} _{\sigma }\left[\sup _{a\in A}\sum _{i=1}^{m}\sigma _{i}a_{i}\right]={\frac {1}{{\sqrt {m}}2^{m}}}\sum _{\sigma \in \{-1/{\sqrt {m}},+1/{\sqrt {m}}\}^{m}}\left[\sup _{a\in A}\langle \sigma ,a\rangle \right].} Each term in the summation is the farthest distance of the set A {\displaystyle A} from the origin, along a unit-length direction σ {\displaystyle \sigma } . The directions are along the vertices of a hypercube. Thus, we can also write it as Rad ( A ) = 1 2 m 1 2 m − 1 ∑ σ ∈ { − 1 / m , + 1 / m } m / { − 1 , + 1 } [ sup a ∈ A ⟨ σ , a ⟩ − inf a ∈ A ⟨ σ , a ⟩ ] {\displaystyle \operatorname {Rad} (A)={\frac {1}{2{\sqrt {m}}}}{\frac {1}{2^{m-1}}}\sum _{\sigma \in \{-1/{\sqrt {m}},+1/{\sqrt {m}}\}^{m}/\{-1,+1\}}\left[\sup _{a\in A}\langle \sigma ,a\rangle -\inf _{a\in A}\langle \sigma ,a\rangle \right]} Here, the set { − 1 / m , + 1 / m } m / { − 1 , + 1 } {\displaystyle \{-1/{\sqrt {m}},+1/{\sqrt {m}}\}^{m}/\{-1,+1\}} denotes half of the vertices of a hypercube, selected so that each diagonal has exactly one vertex selected. In words, this states that 2 m Rad ( A ) {\displaystyle 2{\sqrt {m}}\operatorname {Rad} (A)} is precisely the average width of the set A {\displaystyle A} along all diagonal directions of a hypercube. == Examples == A singleton set has 0 width in any direction, so it has Rademacher complexity 0. The set A = { ( 1 , 1 ) , ( 1 , 2 ) } ⊆ R 2 {\displaystyle A=\{(1,1),(1,2)\}\subseteq \mathbb {R} ^{2}} has average width 1 / 2 {\displaystyle 1/{\sqrt {2}}} along the two diagonal directions of the square, so it has Rademacher complexity 1 / 4 {\displaystyle 1/4} . The unit cube [ 0 , 1 ] m {\displaystyle [0,1]^{m}} has constant width m {\displaystyle {\sqrt {m}}} along the diagonal directions, so it has Rademacher complexity 1 / 2 {\displaystyle 1/2} . Similarly, the unit cross-polytope { x ∈ R m : ‖ x ‖ 1 ≤ 1 } {\displaystyle \{x\in \mathbb {R} ^{m}:\|x\|_{1}\leq 1\}} has constant width 2 / m {\displaystyle 2/{\sqrt {m}}} along the diagonal directions, so it has Rademacher complexity 1 / m {\displaystyle 1/m} . == Using the Rademacher complexity == The Rademacher complexity can be used to derive data-dependent upper-bounds on the learnability of function classes. Intuitively, a function-class with smaller Rademacher complexity is easier to learn. === Bounding the representativeness === In machine learning, it is desired to have a training set that represents the true distribution of some sample data S {\displaystyle S} . This can be quantified using the notion of representativeness. Denote by P {\displaystyle P} the probability distribution from which the samples are drawn. Denote by H {\displaystyle H} the set of hypotheses (potential classifiers) and denote by F {\displaystyle {\mathcal {F}}} the corresponding set of error functions, i.e., for every hypothesis h ∈ H {\displaystyle h\in H} , there is a function f h ∈ F {\displaystyle f_{h}\in F} , that maps each training sample (features,label) to the error of the classifier h {\displaystyle h} (note in this case hypothesis and classifier are used interchangeably). For example, in the case that h {\displaystyle h} represents a binary classifier, the error function is a 0–1 loss function, i.e. the error function f h {\displaystyle f_{h}} returns 0 if h {\displaystyle h} correctly classifies a sample and 1 else. We omit the index and write f {\displaystyle f} instead of f h {\displaystyle f_{h}} when the underlying hypothesis is irrelevant. Define: L P ( f ) := E z ∼ P [ f ( z ) ] {\displaystyle L_{P}(f):=\mathbb {E} _{z\sim P}[f(z)]} – the expected error of some error function f ∈ F {\displaystyle f\in {\mathcal {F}}} on the real distribution P {\displaystyle P} ; L S ( f ) := 1 m ∑ i = 1 m f ( z i ) {\displaystyle L_{S}(f):={1 \over m}\sum _{i=1}^{m}f(z_{i})} – the estimated error of some error function f ∈ F {\displaystyle f\in {\mathcal {F}}} on the sample S {\displaystyle S} . The representativeness of the sample S {\displaystyle S} , with respect to P {\displaystyle P} and F {\displaystyle {\mathcal {F}}} , is defined as: Rep P ( F , S ) := sup f ∈ F ( L P ( f ) − L S ( f ) ) {\displaystyle \operatorname {Rep} _{P}({\mathcal {F}},S):=\sup _{f\in F}(L_{P}(f)-L_{S}(f))} Smaller representativeness is better, since it provides a way to avoid overfitting: it means that the true error of a classifier is not much higher than its estimated error, and so selecting a classifier that has low estimated error will ensure that the true error is also low. Note however that the concept of representativeness is relative and hence can not be compared across distinct samples. The expected representativeness of a sample can be bounded above by the Rademacher complexity of the function class: If F {\displaystyle {\mathcal {F}}} is a set of functions with range within [ 0 , 1 ] {\displaystyle [0,1]} , then Rad P , m ( F ) − ln 2 2 m ≤ E S ∼ P m [ Rep P ( F , S ) ] ≤ 2 Rad P , m ( F ) {\displaystyle \operatorname {Rad} _{P,m}({\mathcal {F}})-{\sqrt {\frac {\ln 2}{2m}}}\leq \mathbb {E} _{S\sim P^{m}}[\operatorname {Rep} _{P}({\
Artificial intelligence in pharmacy
Artificial intelligence in pharmacy refers to the application of artificial intelligence (AI) techniques across pharmaceutical research and practice, including drug discovery, drug delivery, safety monitoring, clinical decision support, and pharmacy operations. Machine learning, deep learning, and natural language processing have been applied to tasks ranging from molecular design to patient adherence monitoring, with the aim of reducing development costs, improving accuracy, and personalizing treatment. Adoption has been uneven. Barriers include limited AI training among pharmacists, high infrastructure costs, and the risk of harm from models trained on unrepresentative data. Regulatory frameworks for AI-based pharmaceutical tools remain in active development across most jurisdictions. == Applications == === Drug discovery and development === Drug development is resource-intensive: bringing a single drug to market typically costs around $2.6 billion and takes 12–14 years. Machine learning algorithms have been applied to analyze molecular datasets to identify potential drug candidates, predict drug–target interactions, and optimize formulations. Artificial neural networks and generative adversarial networks have been used in drug discovery tasks including virtual screening, structure-activity relationship modeling, and de novo molecule generation. Peptides designed using AI methods have shown activity against multidrug-resistant bacteria, and transcriptomic data from human cell lines has been used to train deep learning models to classify drugs by therapeutic properties. Results in drug discovery have been mixed. AI models depend on the quality and diversity of their training data; those trained on narrow chemical libraries can fail to generalize to novel molecular scaffolds. The gap between high virtual screening hit rates and success in preclinical or clinical testing remains a persistent challenge, and the translation of computationally predicted candidates into approved drugs has been slower than early projections suggested. === Drug delivery systems === AI methods including neural networks, principal component analysis, and neuro-fuzzy logic have been applied to identifying biological targets for pharmaceuticals and analyzing genetic information relevant to drug design. Computational models can predict how a formulation will behave in biological systems, helping narrow the field before laboratory synthesis begins. Systems have been proposed that monitor patient response and adjust doses in real time based on individual physiology, with potential applications in chronic disease management. Research has also explored AI applications in targeted cancer treatments and oral vaccine delivery, areas where precise control over drug release kinetics is a design priority. === Drug safety === AI has been applied to predicting and detecting adverse drug reactions using techniques including knowledge graphs, logistic regression classifiers, and neural networks. A 2023 study developed a machine learning algorithm using knowledge graph analysis to classify known causes of adverse reactions. Natural language processing and deep learning models including long short-term memory (LSTM) networks have shown better performance than conventional methods for detecting opioid misuse, drawing on both structured data from electronic health records and unstructured sources such as clinical notes. AI-based pharmacovigilance systems can scan large volumes of electronic health records and social media for drug safety signals at a scale not feasible with manual review. Limitations include difficulty distinguishing drug-related adverse events from unrelated conditions in free-text data, and the need for validated benchmarks to measure model performance against existing safety monitoring standards. === Clinical decision support and personalized medicine === Machine learning systems trained on patient datasets can predict individual risk profiles, including potential allergies and drug–drug interactions, reducing the risk of harm in complex polypharmacy cases where the number of possible interactions exceeds what a clinician can readily assess. Personalized dosing models have been developed for drugs with narrow therapeutic windows — including anticoagulants and immunosuppressants — using patient-specific variables such as weight, renal function, and relevant genetic markers. Prospective clinical validation of these systems has lagged behind their technical development. Most published evaluations report performance on retrospective datasets, and the regulatory pathway for AI-based clinical decision support tools in pharmacy varies by jurisdiction. === Pharmacy operations and automation === Robotic and AI-driven systems have been applied to dispensing accuracy and pharmacy logistics. At the UCSF Medical Center, robotic technology produced 350,000 medication doses with no dispensing errors recorded. Robots such as TUG assist with preparing and transporting medications and laboratory samples within hospital settings. AI has also been applied to inventory management, with demand-forecasting systems predicting medicine requirements to reduce shortages and minimize waste from expired stock. In community pharmacy settings, AI tools have been used to flag potential prescription errors and alert pharmacists to drug–drug interactions before dispensing. === Medication adherence === Confirming that patients take prescribed medications as directed is a persistent challenge in healthcare. AI-enabled tools including smart pillboxes, RFID tags, ingestible sensors, and video check-ins have been applied to this problem. Smart pillboxes record when they are opened, providing real-time adherence data that can be reviewed remotely by care teams. Ingestible sensors transmit a signal after dissolution, offering direct confirmation of ingestion rather than proxy measures such as pill count or self-report. == Adoption challenges == === Barriers === Several barriers limit AI adoption in pharmacy practice. Many published evaluations report model performance on retrospective datasets rather than prospective clinical outcomes, making it difficult to assess real-world benefit. Pharmacists have reported limited AI training and knowledge, and research facilities often lack the computational infrastructure required for model development and validation. Models trained on biased or unrepresentative datasets can produce misleading results with direct patient safety consequences. === Regulatory frameworks === Regulatory frameworks for AI-based pharmaceutical tools are in active development. In the United States, the Food and Drug Administration (FDA) has issued guidance on AI and machine learning-based software as a medical device, addressing requirements for pre-market review and post-market performance monitoring. The European Medicines Agency has published discussion papers on the use of AI across the medicines development lifecycle, with particular attention to transparency in model training and validation. The absence of harmonized international standards creates compliance complexity for developers operating across multiple jurisdictions. === Ethical challenges === AI adoption raises data privacy and security concerns, including the risk of exposing sensitive patient information through data breaches. Algorithmic bias presents a related hazard: a model trained on an unrepresentative patient population may generate unsuitable treatment recommendations for patients not reflected in its training data, with potential for disparate outcomes across demographic groups. The opacity of some machine learning models, particularly deep neural networks, limits clinicians' ability to interpret or contest a recommendation, raising questions of accountability when a model-assisted decision results in patient harm. === Proposed solutions === Responses proposed in the literature include AI-focused education programs for pharmacists, increased public funding for healthcare AI research, encryption and governance frameworks for patient data, and regulatory requirements to prevent the use of biased training datasets. Greater transparency about training data provenance, model architecture, and validation methodology has also been recommended, including disclosure requirements in regulatory submissions. === Future directions === Research groups have called for tighter integration between AI systems and electronic health records to reduce healthcare costs and improve continuity of care across settings. International collaboration through shared AI frameworks and federated learning approaches has been proposed to address data scarcity in underrepresented patient populations and accelerate validation across institutions.