Search

Fully gapped, spin singlet superconductors with antisymmetric spin-orbit coupling in a Zeeman magnetic field provide a promising route to realize superconducting states with non-Abelian topological order and therefore fault-tolerant quantum computation. Here we use a quantum Monte Carlo dynamical cluster approximation to study the superconducting properties of a doped two-dimensional attractive Hubbard model with Rashba spin-orbit coupling in a Zeeman magnetic field. We generally find that the Rashba coupling has a beneficial effect towards s-wave superconductivity. In the presence of a finite Zeeman field, when superconductivity is suppressed by Pauli pair-breaking, the Rashba coupling counteracts the spin imbalance created by the Zeeman field by mixing the spins, and thus restores superconductivity at finite temperatures. We show that this favorable effect of the spin-orbit coupling is traced to a spin-flip driven enhancement of the amplitude for the propagation of a pair of electrons in time-reversed states. Moreover, by inspecting the Fermi surface of the interacting model, we show that for sufficiently large Rashba coupling and Zeeman field, the superconducting state is expected to be topologically non-trivial.

When dealing with timber structures, the characteristic strength and stiffness of the material are made highly variable and uncertain by the unavoidable, yet hardly predictable, presence of knots and other defects. In this work we apply the sparse grids stochastic collocation method to perform uncertainty quantification for structural engineering in the scenario described above. Sparse grids have been developed by the mathematical community in the last decades and their theoretical background has been rigorously and extensively studied. The document proposes a brief practice-oriented introduction with minimal theoretical background, provides detailed instructions for the use of the already implemented Sparse Grid Matlab kit (freely available on-line) and discusses two numerical examples inspired from timber engineering problems that highlight how sparse grids exhibit superior performances compared to the plain Monte Carlo method. The Sparse Grid Matlab kit requires only a few lines of code to be interfaced with any numerical solver for mechanical problems (in this work we used an isogeometric collocation method) and provides outputs that can be easily interpreted and used in the engineering practice.

Strategic diversity is often essential in games: in multi-player games, for example, evaluating a player against a diverse set of strategies will yield a more accurate estimate of its performance. Furthermore, in games with non-transitivities diversity allows a player to cover several winning strategies. However, despite the significance of strategic diversity, training agents that exhibit diverse behaviour remains a challenge. In this paper we study how to construct diverse populations of agents by carefully structuring how individuals within a population interact. Our approach is based on interaction graphs, which control the flow of information between agents during training and can encourage agents to specialise on different strategies, leading to improved overall performance. We provide evidence for the importance of diversity in multi-agent training and analyse the effect of applying different interaction graphs on the training trajectories, diversity and performance of populations in a range of games. This is an extended version of the long abstract published at AAMAS.

The high-temperature superconducting cuprates are governed by intertwined striped magnetic and charge orders in addition to superconductivity. Remarkably similar behavior has also been seen in numerical calculations for the Hubbard model describing the copper-oxygen layers in these materials. Finite cluster methods typically find that spin and charge stripe order dominates, while embedded quantum cluster methods, which access the thermodynamic limit, often conclude that superconductivity does. Here, we report the observation of fluctuating spin and charge stripes in an embedded cluster calculation for the Hubbard model. This discovery demonstrates that striped states survive in the thermodynamic limit and allows us to study their influence on the model's superconducting properties, where we find evidence for pair-density-wave correlations intertwined with the stripe correlations.

We study the three-band Hubbard model for the copper oxide plane of the high-temperature superconducting cuprates using determinant quantum Monte Carlo and the dynamical cluster approximation (DCA) and provide a comprehensive view of the pairing correlations in this model using these methods. Specifically, we compute the pair-field susceptibility and study its dependence on temperature, doping, interaction strength, and charge-transfer energy. Using the DCA, we also solve the Bethe-Salpeter equation for the two-particle Green's function in the particle-particle channel to determine the transition temperature to the superconducting phase on smaller clusters. Our calculations reproduce many aspects of the cuprate phase diagram and indicate that there is an "optimal" value of the charge-transfer energy for the model where $T_c$ is largest. These results have implications for our understanding of superconductivity in both the cuprates and other doped charge-transfer insulators.

The TOP-IMPLART project consists of the design and implementation of a linear proton accelerator, its control and monitoring systems for the treatment of superficial and semi-deep tumors. The energy of 150 MeV (corresponding to a penetration in tissue of about 15 cm) is a milestone in design being useful for the proton therapy treatment of almost 50% of tumors based on their position and depth (including ocular melanoma, head-neck tumors, pediatric tumors, and more superficial tumors). The capability to vary the intensity on a pulse-to-pulse basis combined with an electronic feedback system allows to get the required dose uniformity (2.5%) reducing the number of re-paintings. In this paper the state of the art and the objectives of the TOP-IMPLART project are described within the framework of the progress of Protontherapy.

In multiagent systems, the complex interaction of fixed incentives can lead agents to outcomes that are poor (inefficient) not only for the group, but also for each individual. Price of anarchy is a technical, game-theoretic definition that quantifies the inefficiency arising in these scenarios -- it compares the welfare that can be achieved through perfect coordination against that achieved by self-interested agents at a Nash equilibrium. We derive a differentiable, upper bound on a price of anarchy that agents can cheaply estimate during learning. Equipped with this estimator, agents can adjust their incentives in a way that improves the efficiency incurred at a Nash equilibrium. Agents do so by learning to mix their reward (equiv. negative loss) with that of other agents by following the gradient of our derived upper bound. We refer to this approach as D3C. In the case where agent incentives are differentiable, D3C resembles the celebrated Win-Stay, Lose-Shift strategy from behavioral game theory, thereby establishing a connection between the global goal of maximum welfare and an established agent-centric learning rule. In the non-differentiable setting, as is common in multiagent reinforcement learning, we show the upper bound can be reduced via evolutionary strategies, until a compromise is reached in a distributed fashion. We demonstrate that D3C improves outcomes for each agent and the group as a whole on several social dilemmas including a traffic network exhibiting Braess's paradox, a prisoner's dilemma, and several multiagent domains., Comment: Published in AAMAS 2022

The nature of the effective interaction responsible for pairing in the high-temperature superconducting cuprates remains unsettled. This question has been studied extensively using the simplified single-band Hubbard model, which does not explicitly consider the orbital degrees of freedom of the relevant CuO$_2$ planes. Here, we use a dynamic cluster quantum Monte Carlo approximation to study the orbital structure of the pairing interaction in the three-band Hubbard model, which treats the orbital degrees of freedom explicitly. We find that the interaction predominately acts between neighboring copper orbitals, but with significant additional weight appearing on the surrounding bonding molecular oxygen orbitals. By explicitly comparing these results to those from the simpler single-band Hubbard model, our study provides strong support for the single-band framework for describing superconductivity in the cuprates.

This paper investigates the geometrical properties of real world games (e.g. Tic-Tac-Toe, Go, StarCraft II). We hypothesise that their geometrical structure resemble a spinning top, with the upright axis representing transitive strength, and the radial axis, which corresponds to the number of cycles that exist at a particular transitive strength, representing the non-transitive dimension. We prove the existence of this geometry for a wide class of real world games, exposing their temporal nature. Additionally, we show that this unique structure also has consequences for learning - it clarifies why populations of strategies are necessary for training of agents, and how population size relates to the structure of the game. Finally, we empirically validate these claims by using a selection of nine real world two-player zero-sum symmetric games, showing 1) the spinning top structure is revealed and can be easily re-constructed by using a new method of Nash clustering to measure the interaction between transitive and cyclical strategy behaviour, and 2) the effect that population size has on the convergence in these games.

Zero-sum games have long guided artificial intelligence research, since they possess both a rich strategy space of best-responses and a clear evaluation metric. What's more, competition is a vital mechanism in many real-world multi-agent systems capable of generating intelligent innovations: Darwinian evolution, the market economy and the AlphaZero algorithm, to name a few. In two-player zero-sum games, the challenge is usually viewed as finding Nash equilibrium strategies, safeguarding against exploitation regardless of the opponent. While this captures the intricacies of chess or Go, it avoids the notion of cooperation with co-players, a hallmark of the major transitions leading from unicellular organisms to human civilization. Beyond two players, alliance formation often confers an advantage; however this requires trust, namely the promise of mutual cooperation in the face of incentives to defect. Successful play therefore requires adaptation to co-players rather than the pursuit of non-exploitability. Here we argue that a systematic study of many-player zero-sum games is a crucial element of artificial intelligence research. Using symmetric zero-sum matrix games, we demonstrate formally that alliance formation may be seen as a social dilemma, and empirically that na\"ive multi-agent reinforcement learning therefore fails to form alliances. We introduce a toy model of economic competition, and show how reinforcement learning may be augmented with a peer-to-peer contract mechanism to discover and enforce alliances. Finally, we generalize our agent model to incorporate temporally-extended contracts, presenting opportunities for further work., Comment: Accepted for publication at AAMAS 2020

In this paper we investigate the Follow the Regularized Leader dynamics in sequential imperfect information games (IIG). We generalize existing results of Poincar\'e recurrence from normal-form games to zero-sum two-player imperfect information games and other sequential game settings. We then investigate how adapting the reward (by adding a regularization term) of the game can give strong convergence guarantees in monotone games. We continue by showing how this reward adaptation technique can be leveraged to build algorithms that converge exactly to the Nash equilibrium. Finally, we show how these insights can be directly used to build state-of-the-art model-free algorithms for zero-sum two-player Imperfect Information Games (IIG)., Comment: 43 pages

Adversarial training, a special case of multi-objective optimization, is an increasingly prevalent machine learning technique: some of its most notable applications include GAN-based generative modeling and self-play techniques in reinforcement learning which have been applied to complex games such as Go or Poker. In practice, a \emph{single} pair of networks is typically trained in order to find an approximate equilibrium of a highly nonconcave-nonconvex adversarial problem. However, while a classic result in game theory states such an equilibrium exists in concave-convex games, there is no analogous guarantee if the payoff is nonconcave-nonconvex. Our main contribution is to provide an approximate minimax theorem for a large class of games where the players pick neural networks including WGAN, StarCraft II, and Blotto Game. Our findings rely on the fact that despite being nonconcave-nonconvex with respect to the neural networks parameters, these games are concave-convex with respect to the actual models (e.g., functions or distributions) represented by these neural networks., Comment: Appears in: Proceedings of the 24th International Conference on Artificial Intelligence and Statistics (AISTATS 2021). 19 pages

With the success of modern machine learning, it is becoming increasingly important to understand and control how learning algorithms interact. Unfortunately, negative results from game theory show there is little hope of understanding or controlling general n-player games. We therefore introduce smooth markets (SM-games), a class of n-player games with pairwise zero sum interactions. SM-games codify a common design pattern in machine learning that includes (some) GANs, adversarial training, and other recent algorithms. We show that SM-games are amenable to analysis and optimization using first-order methods., Comment: 18 pages, 3 figures

Training generative adversarial networks requires balancing of delicate adversarial dynamics. Even with careful tuning, training may diverge or end up in a bad equilibrium with dropped modes. In this work, we improve CS-GAN with natural gradient-based latent optimisation and show that it improves adversarial dynamics by enhancing interactions between the discriminator and the generator. Our experiments demonstrate that latent optimisation can significantly improve GAN training, obtaining state-of-the-art performance for the ImageNet ($128 \times 128$) dataset. Our model achieves an Inception Score (IS) of $148$ and an Fr\'echet Inception Distance (FID) of $3.4$, an improvement of $17\%$ and $32\%$ in IS and FID respectively, compared with the baseline BigGAN-deep model with the same architecture and number of parameters., Comment: Improved writing, added new analysis and evaluation

Deep learning is built on the foundational guarantee that gradient descent on an objective function converges to local minima. Unfortunately, this guarantee fails in settings, such as generative adversarial nets, that exhibit multiple interacting losses. The behavior of gradient-based methods in games is not well understood -- and is becoming increasingly important as adversarial and multi-objective architectures proliferate. In this paper, we develop new tools to understand and control the dynamics in n-player differentiable games. The key result is to decompose the game Jacobian into two components. The first, symmetric component, is related to potential games, which reduce to gradient descent on an implicit function. The second, antisymmetric component, relates to Hamiltonian games, a new class of games that obey a conservation law akin to conservation laws in classical mechanical systems. The decomposition motivates Symplectic Gradient Adjustment (SGA), a new algorithm for finding stable fixed points in differentiable games. Basic experiments show SGA is competitive with recently proposed algorithms for finding stable fixed points in GANs -- while at the same time being applicable to, and having guarantees in, much more general cases., Comment: JMLR 2019, journal version of arXiv:1802.05642

This paper analyzes the non-trivial influence of the material anisotropy on the structural behavior of an anisotropic multilayer planar beam. Indeed, analytical results available in literature are limited to homogeneous beams and several aspects has not been addressed yet, impeding an in-depth understanding of the mechanical response of anisotropic structural elements. This paper proposes an effective recovery of stress distribution and an energetically consistent evaluation of constitutive relations to be used within a planar Timoshenko beam model. The resulting structural-analysis tool highlights the following peculiarities of anisotropic beams: (i) the axial stress explicitly depends on transversal internal force, which can weigh up to 30% on the maximal magnitude of axial stress, and (ii) the anisotropy influences the beam displacements more than standard shear deformation and even for extremely slender beams. A rigorous comparison with analytical and accurate 2D Finite Element solutions confirms the accuracy of the proposed approach that leads to errors exceptionally greater than 5%.

Zero-sum games such as chess and poker are, abstractly, functions that evaluate pairs of agents, for example labeling them `winner' and `loser'. If the game is approximately transitive, then self-play generates sequences of agents of increasing strength. However, nontransitive games, such as rock-paper-scissors, can exhibit strategic cycles, and there is no longer a clear objective -- we want agents to increase in strength, but against whom is unclear. In this paper, we introduce a geometric framework for formulating agent objectives in zero-sum games, in order to construct adaptive sequences of objectives that yield open-ended learning. The framework allows us to reason about population performance in nontransitive games, and enables the development of a new algorithm (rectified Nash response, PSRO_rN) that uses game-theoretic niching to construct diverse populations of effective agents, producing a stronger set of agents than existing algorithms. We apply PSRO_rN to two highly nontransitive resource allocation games and find that PSRO_rN consistently outperforms the existing alternatives., Comment: ICML 2019, final version