An introduction to quantum symmetries
These notes are an introduction to the theory of quantum symmetries of finite and infinite sets, graphs, and locally compact spaces.
math.QA↗
arXiv subjects
Christian Voigt
Publications and source records attributed to Christian Voigt.
Equivariant periodic cyclic homology for ample groupoids
We define and study bivariant equivariant periodic cyclic homology for actions of ample groupoids. In analogy to the group case, we show that the theory satisfies homotopy invariance, stability, and excision in both variables. We also prove an analogue of the Green-Julg theorem for actions of proper groupoids.
math.KT↗
Beurling-Fourier algebras of $ q $-deformations of compact semisimple Lie groups and complexification
We study Beurling-Fourier algebras of $ q $-deformations of compact semisimple Lie groups. In particular, we show that the space of irreducible representations of the function algebras of their Drinfeld doubles is exhausted by the irreducible representations of weighted Fourier algebras associated to a certain family of central weights.
math.OA↗
Averaging multipliers on locally compact quantum groups
We study an averaging procedure for completely bounded multipliers on a locally compact quantum group with respect to a compact quantum subgroup. As a consequence we show that central approximation properties of discrete quantum groups are equivalent to the corresponding approximation properties of their Drinfeld doubles. This is complemented by a discussion of the averaging of Fourier algebra elements. We compare the biinvariant Fourier algebra of the Drinfeld double of a discrete quantum group with the central Fourier algebra. In the unimodular case these are naturally identified, but we show by exhibiting a family of counter-examples that they differ in general.
math.OA↗
The approximation property for locally compact quantum groups
We study the Haagerup--Kraus approximation property for locally compact quantum groups, generalising and unifying previous work by Kraus--Ruan and Crann. Along the way we discuss how multipliers of quantum groups interact with the $\mathrm{C}^*$-algebraic theory of locally compact quantum groups. Several inheritance properties of the approximation property are established in this setting, including passage to quantum subgroups, free products of discrete quantum groups, and duals of double crossed products. We also discuss a relation to the weak$^*$ operator approximation property. For discrete quantum groups, we introduce a central variant of the approximation property, and relate this to a version of the approximation property for rigid $\mathrm{C}^*$-tensor categories, building on work of Arano--De Laat--Wahl.
math.OA↗
Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language models
Language models demonstrate both quantitative improvement and new qualitative capabilities with increasing scale. Despite their potentially transformative impact, these new capabilities are as yet poorly characterized. In order to inform future research, prepare for disruptive new model capabilities, and ameliorate socially harmful effects, it is vital that we understand the present and near-future capabilities and limitations of language models. To address this challenge, we introduce the Beyond the Imitation Game benchmark (BIG-bench). BIG-bench currently consists of 204 tasks, contributed by 450 authors across 132 institutions. Task topics are diverse, drawing problems from linguistics, childhood development, math, common-sense reasoning, biology, physics, social bias, software development, and beyond. BIG-bench focuses on tasks that are believed to be beyond the capabilities of current language models. We evaluate the behavior of OpenAI's GPT models, Google-internal dense transformer architectures, and Switch-style sparse transformers on BIG-bench, across model sizes spanning millions to hundreds of billions of parameters. In addition, a team of human expert raters performed all tasks in order to provide a strong baseline. Findings include: model performance and calibration both improve with scale, but are poor in absolute terms (and when compared with rater performance); performance is remarkably similar across model classes, though with benefits from sparsity; tasks that improve gradually and predictably commonly involve a large knowledge or memorization component, whereas tasks that exhibit "breakthrough" behavior at a critical scale often involve multiple steps or components, or brittle metrics; social bias typically increases with scale in settings with ambiguous context, but this can be improved with prompting.
cs.CL↗
Hecke algebras and the Schlichting completion for discrete quantum groups
We introduce Hecke algebras associated to discrete quantum groups with commensurated quantum subgroups. We study their modular properties and the associated Hecke operators. In order to investigate their analytic properties we adapt the construction of the Schlichting completion to the quantum setting, thus obtaining locally compact quantum groups with compact open quantum subgroups. We study in detail a class of examples arising from quantum HNN extensions.
math.QA↗
Infinite quantum permutations
We define and study quantum permutations of infinite sets. This leads to discrete quantum groups which can be viewed as infinite variants of the quantum permutation groups introduced by Wang. More precisely, the resulting quantum groups encode universal quantum symmetries of the underlying sets among all discrete quantum groups. We also discuss quantum automorphisms of infinite graphs, including some examples and open problems regarding both the existence and non-existence of quantum symmetries in this setting.
math.QA↗
Dark Patterns in Online Shopping: Of Sneaky Tricks, Perceived Annoyance and Respective Brand Trust
Dark patterns utilize interface elements to trick users into performing unwanted actions. Online shopping websites often employ these manipulative mechanisms so as to increase their potential customer base, to boost their sales, or to optimize their advertising efforts. Although dark patterns are often successful, they clearly inhibit positive user experiences. Particularly, with respect to customers' perceived annoyance and trust put into a given brand, they may have negative effects. To investigate respective connections between the use of dark patterns, users' perceived level of annoyance and their expressed brand trust, we conducted an experiment-based survey. We implemented two versions of a fictitious online shop; i.e. one which used five different types of dark patterns and a similar one without such manipulative user interface elements. A total of $n=204$ participants were then forwarded to one of the two shops (approx. $2/3$ to the shop which used the dark patterns) and asked to buy a specific product. Subsequently, we measured participants' perceived annoyance level, their expressed brand trust and their affinity for technology. Results show a higher level of perceived annoyance with those who used the dark pattern version of the online shop. Also, we found a significant connection between perceived annoyance and participants' expressed brand trust. A connection between participants' affinity for technology and their ability to recognize and consequently counter dark patterns, however, is not supported by our data.
cs.HC↗
The Plancherel formula for complex semisimple quantum groups
We calculate the Plancherel formula for complex semisimple quantum groups, that is, Drinfeld doubles of $ q $-deformations of compact semisimple Lie groups. As a consequence we obtain a concrete description of their associated reduced group $ C^* $-algebras. The main ingredients in our proof are the Bernstein-Gelfand-Gelfand complex and the Hopf trace formula.
math.RT↗
Thinking Aloud: Dynamic Context Generation Improves Zero-Shot Reasoning Performance of GPT-2
Thinking aloud is an effective meta-cognitive strategy human reasoners apply to solve difficult problems. We suggest to improve the reasoning ability of pre-trained neural language models in a similar way, namely by expanding a task's context with problem elaborations that are dynamically generated by the language model itself. Our main result is that dynamic problem elaboration significantly improves the zero-shot performance of GPT-2 in a deductive reasoning and natural language inference task: While the model uses a syntactic heuristic for predicting an answer, it is capable (to some degree) of generating reasoned additional context which facilitates the successful application of its heuristic. We explore different ways of generating elaborations, including fewshot learning, and find that their relative performance varies with the specific problem characteristics (such as problem difficulty). Moreover, the effectiveness of an elaboration can be explained in terms of the degree to which the elaboration semantically coheres with the corresponding problem. In particular, elaborations that are most faithful to the original problem description may boost accuracy by up to 24%.
cs.CL↗
On the assembly map for complex semisimple quantum groups
We show that complex semisimple quantum groups, that is, Drinfeld doubles of $ q $-deformations of compact semisimple Lie groups, satisfy a categorical version of the Baum-Connes conjecture with trivial coefficients. This approach, based on homological algebra in triangulated categories, is compatible with the previously studied deformation picture of the assembly map, and allows us to define an assembly map with arbitrary coefficients for these quantum groups.
math.KT↗
Critical Thinking for Language Models
This paper takes a first step towards a critical thinking curriculum for neural auto-regressive language models. We introduce a synthetic corpus of deductively valid arguments, and generate artificial argumentative texts to train and evaluate GPT-2. Significant transfer learning effects can be observed: Training a model on three simple core schemes allows it to accurately complete conclusions of different, and more complex types of arguments, too. The language models generalize the core argument schemes in a correct way. Moreover, we obtain consistent and promising results for NLU benchmarks. In particular, pre-training on the argument schemes raises zero-shot accuracy on the GLUE diagnostics by up to 15 percentage points. The findings suggest that intermediary pre-training on texts that exemplify basic reasoning abilities (such as typically covered in critical thinking textbooks) might help language models to acquire a broad range of reasoning skills. The synthetic argumentative texts presented in this paper are a promising starting point for building such a "critical thinking curriculum for language models."
cs.CL↗
Complex semisimple quantum groups and representation theory
These notes contain an introduction to the theory of complex semisimple quantum groups. Our main aim is to discuss the classification of irreducible Harish-Chandra modules for these quantum groups, following Joseph and Letzter. Along the way we cover extensive background material on quantized universal enveloping algebras and explain connections to the analytical theory in the setting of locally compact quantum groups.
math.QA↗
Quantum Cuntz-Krieger algebras
Motivated by the theory of Cuntz-Krieger algebras we define and study $ C^\ast $-algebras associated to directed quantum graphs. For classical graphs the $ C^\ast $-algebras obtained this way can be viewed as free analogues of Cuntz-Krieger algebras, and need not be nuclear. We study two particular classes of quantum graphs in detail, namely the trivial and the complete quantum graphs. For the trivial quantum graph on a single matrix block, we show that the associated quantum Cuntz-Krieger algebra is neither unital, nuclear nor simple, and does not depend on the size of the matrix block up to $ KK $-equivalence. In the case of the complete quantum graphs we use quantum symmetries to show that, in certain cases, the corresponding quantum Cuntz-Krieger algebras are isomorphic to Cuntz algebras. These isomorphisms, which seem far from obvious from the definitions, imply in particular that these $ C^\ast $-algebras are all pairwise non-isomorphic for complete quantum graphs of different dimensions, even on the level of $ KK $-theory. We explain how the notion of unitary error basis from quantum information theory can help to elucidate the situation. We also discuss quantum symmetries of quantum Cuntz-Krieger algebras in general.
math.OA↗
On bicolimits of $ C^* $-categories
We discuss a number of general constructions concerning additive $ C^* $-categories, focussing in particular on establishing the existence of bicolimits. As an illustration of our results we show that balanced tensor products of module categories over $ C^* $-tensor categories exist without any finiteness assumptions.
math.OA↗
A network of precision gravimeters as a detector of matter with feeble nongravitational coupling
Hidden matter that interacts only gravitationally would oscillate at characteristic frequencies when trapped inside of Earth. For small oscillations near the center of the Earth, these frequencies are around 300 $μ$Hz. Additionally, signatures at higher harmonics would appear because of the non-uniformity of Earth's density. In this work, we use data from a global network of gravimeters of the International Geodynamics and Earth Tide Service (IGETS) to look for these hypothetical trapped objects. We find no evidence for such objects with masses on the order of 10$^{14}$ kg or greater with an oscillation amplitude of 0.1 $r_e$. It may be possible to improve the sensitivity of the search by several orders of magnitude via better understanding of the terrestrial noise sources and more advanced data analysis.
astro-ph.IM↗
Complex quantum groups and a deformation of the Baum-Connes assembly map
We define and study an analogue of the Baum-Connes assembly map for complex semisimple quantum groups, that is, Drinfeld doubles of $ q $-deformations of compact semisimple Lie groups. Our starting point is the deformation picture of the Baum-Connes assembly map for a complex semisimple Lie group $ G $, which allows one to express the $ K $-theory of the reduced group $ C^* $-algebra of $ G $ in terms of the $ K $-theory of its associated Cartan motion group. The latter can be identified with the semidirect product of the maximal compact subgroup $ K $ acting on $ \mathfrak{k}^* $ via the coadjoint action. In the quantum case the role of the Cartan motion group is played by the Drinfeld double of the classical group $ K $, whose associated group $ C^* $-algebra is the crossed product of $ C(K) $ with respect to the adjoint action of $ K $. Our quantum assembly map is obtained by varying the deformation parameter in the Drinfeld double construction applied to the standard deformation $ K_q $ of $ K $. We prove that the quantum assembly map is an isomorphism, thus providing a description of the $ K $-theory of complex quantum groups in terms of classical topology. Moreover, we show that there is a continuous field of $ C^* $-algebras which encodes both the quantum and classical assembly maps as well as a natural deformation between them. It follows in particular that the quantum assembly map contains the classical Baum-Connes assembly map as a direct summand.
math.OA↗