1,359,812 research outputs found
Franci Rudolph Oral History Interview
No full textFranci Rudolph, an arts activist in the Tampa Bay area, discusses her involvement in the local community. She describes Florida\u27s state of the arts when she first came to the area in 1979 and how the arts have grown since then. She focuses on the visual and performing arts in the Tampa Bay area, including an in-depth look at the Florida Orchestra. Issues in education are also examined, with a focus on Berkeley Preparatory School
A distributed forward-backward algorithm for stochastic generalized Nash equilibrium seeking
No full textWe consider the stochastic generalized Nash equilibrium problem (SGNEP) with expected-value cost functions. Inspired by Yi and Pavel (2019), we propose a distributed generalized Nash equilibrium seeking algorithm based on the preconditioned forward-backward operator splitting for SGNEPs, where, at each iteration, the expected value of the pseudogradient is approximated via a number of random samples. Our main contribution is to show almost sure convergence of the proposed algorithm if the pseudogradient mapping is restricted (monotone and) cocoercive.Accepted Author ManuscriptTeam Bart De Schutte
Blassberg, Franci J.
No full textFrom the video archives of the Cornell Law School Heritage Project. The interviewer is Peter W. Martin; the videographer, Jae-Hyon Ahn. This video contains an interview with Franci J. Blassberg, Cornell Law School class of 1977, covering the path that led her to law school, her experience while a student, and her subsequent career, with Debevoise & Plimpton. (Duration 26:52) The initial phase of this project was sponsored by a generous grant from the law firm of Sutherland Asbill and Brennan LLP.1_2awtrps
Stochastic Generalized Nash Equilibrium-Seeking in Merely Monotone Games
No full textWe solve the stochastic generalized Nash equilibrium (SGNE) problem in merely monotone games with expected value cost functions. Specifically, we present the first distributed SGNE-seeking algorithm for monotone games that require one proximal computation (e.g., one projection step) and one pseudogradient evaluation per iteration. Our main contribution is to extend the relaxed forward–backward operator splitting by the Malitsky (Mathematical Programming, 2019) to the stochastic case and in turn to show almost sure convergence to an SGNE when the expected value of the pseudogradient is approximated by the average over a number of random samples.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Team Sergio GrammaticoTeam Bart De Schutte
Franci Alpinolo. Prefetto
No full textBrevissima scheda biografica, data la ridotta influenza del Franci sulla storia del capoluogo. Dottore e ragioniere nato a Sovicille, Siena, fu prefetto di Arezzo dal 10 agosto 1948 al 5 ottobre 1953. Viceprefetto a Lucc
Training Generative Adversarial Networks via Stochastic Nash Games
No full textGenerative adversarial networks (GANs) are a class of generative models with two antagonistic neural networks: a generator and a discriminator. These two neural networks compete against each other through an adversarial process that can be modeled as a stochastic Nash equilibrium problem. Since the associated training process is challenging, it is fundamental to design reliable algorithms to compute an equilibrium. In this article, we propose a stochastic relaxed forward-backward (SRFB) algorithm for GANs, and we show convergence to an exact solution when an increasing number of data is available. We also show convergence of an averaged variant of the SRFB algorithm to a neighborhood of the solution when only a few samples are available. In both cases, convergence is guaranteed when the pseudogradient mapping of the game is monotone. This assumption is among the weakest known in the literature. Moreover, we apply our algorithm to the image generation problem.</p
Stochastic generalized Nash equilibrium seeking under partial-decision information
No full textWe consider for the first time a stochastic generalized Nash equilibrium problem, i.e., with expected-value cost functions and joint feasibility constraints, under partial-decision information, meaning that the agents communicate only with some trusted neighbors. We propose several distributed algorithms for network games and aggregative games that we show being special instances of a preconditioned forward–backward splitting method. We prove that the algorithms converge to a generalized Nash equilibrium when the forward operator is restricted cocoercive by using the stochastic approximation scheme with variance reduction to estimate the expected value of the pseudogradient.Team Sergio GrammaticoTeam Bart De Schutte
Postfazione a Laura Novati. "Le strenne per gli amici di Paolo e Paola Franci edite da Vanni Scheiwiller"
No full textLa serie speciale delle strenne curate per gli amici Franci mostra in vanni Scheiwiller non solo l’elegante editore ma un intellettuale di prim’ordine e nel suo mecenate un uomo di respiro internazionale
Franci, Filippo
No full textFilippo Franci, oratoriano toscano del XVII secolo, noto per le sue iniziative assistenziali a favore di ragazzi discoli e donne cadute nel peccato
- …
