Related papers: Group Averaging and Refined Algebraic Quantization
A new, configuration-space picture of a formalism of group quantization, the GAQ formalism, is presented in the context of a previous, algebraic generalization. This presentation serves to make a comprehensive discussion in which other…
Correspondence between BRST-BFV, Dirac and refined algebraic (group averaging, projection operator) approaches to quantize constrained systems is analyzed. For the closed-algebra case, it is shown that the component of the BFV wave function…
We present a procedure for averaging one-parameter random unitary groups and random self-adjoint groups. Central to this is a generalization of the notion of weak convergence of a sequence of measures and the corresponding generalization of…
We investigate refined algebraic quantisation with group averaging in a finite-dimensional constrained Hamiltonian system that provides a simplified model of general relativity. The classical theory has gauge group SL(2,R) and a…
Machine learning algorithms use error function minimization to fit a large set of parameters in a preexisting model. However, error minimization eventually leads to a memorization of the training dataset, losing the ability to generalize to…
The rapid development of artificial intelligence (AI) systems has created an urgent need for their scientific quantification. While their fluency across a variety of domains is impressive, AI systems fall short on tests requiring…
Group imbalance has been a known problem in empirical risk minimization (ERM), where the achieved high average accuracy is accompanied by low accuracy in a minority group. Despite algorithmic efforts to improve the minority group accuracy,…
Partition refinement is a method for minimizing automata and transition systems of various types. Recently, a new partition refinement algorithm and associated tool CoPaR were developed that are generic in the transition type of the input…
We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unquantized) information is available, and on the degradation of…
An algebraic framework in which to study infinite sums is proposed, complementing and augmenting the usual topological tools. The framework subsumes numerous examples in the literature. It is developed using many varied examples, with a…
An original regular approach to constructing special type symmetries for boundary value problems, namely renormgroup symmetries, is presented. Different methods of calculating these symmetries, based on modern group analysis are described.…
Batch normalization has been widely used to improve optimization in deep neural networks. While the uncertainty in batch statistics can act as a regularizer, using these dataset statistics specific to the training set impairs generalization…
Application of the so-called refined algebraic quantization scheme for constrained systems to the relativistic particle provides an inner product that defines a unique Fock representation for a scalar field in curved space-time. The…
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical…
Characterization of experimental systems is an essential step in developing and improving quantum hardware. A collection of protocols known as Randomized Benchmarking (RB) was developed in the past decade, which provides an efficient way to…
On the basis of the classical theory of envelopes, we formulate the renormalization group (RG) method for global analysis, recently proposed by Goldenfeld et al. It is clarified why the RG equation improves things.
Probabilistic predictions can be evaluated through comparisons with observed label frequencies, that is, through the lens of calibration. Recent scholarship on algorithmic fairness has started to look at a growing variety of…
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP
The present article is primarily a review of the projection-operator approach to quantize systems with constraints. We study the quantization of systems with general first- and second-class constraints from the point of view of…
We present a new method for the quantization of totally constrained systems including general relativity. The method consists in constructing discretized theories that have a well defined and controlled continuum limit. The discrete…