Concept

Forward Rate Agreement

Publications associées (24)

Discount models

Discount is the difference between the face value of a bond and its present value. We propose an arbitrage-free dynamic framework for discount models, which provides an alternative to the Heath-Jarrow-Morton framework for forward rates. We derive general c ...

Heidelberg2023

Closed form approximation methods for portfolio valuation and risk management

Lotfi Boudabsa

In this thesis we present three closed form approximation methods for portfolio valuation and risk management.The first chapter is titled ``Kernel methods for portfolio valuation and risk management'', and is a joint work with Damir Filipovi'c (SFI and EP ...

EPFL2023

Rational Agreement in the Presence of Crash Faults

Vincent Gramoli, Alejandro Ranchal Pedrosa

Blockchain systems need to solve consensus despite the presence of rational users and failures. The notion of (k, t)-robustness is key to derive impossibility results with k rational players and t faulty players. However, these t faulty players are always ...

IEEE2021

A first-order primal-dual method with adaptivity to local smoothness

Volkan Cevher, Maria-Luiza Vladarean

We consider the problem of finding a saddle point for the convex-concave objective

\min_x \max_y f(x) + \langle Ax, y\rangle - g^*(y)

, where

f

is a convex function with locally Lipschitz gradient and

g

is convex and possibly non-smooth. We propose an ...

2021

Distributed Learning in Non-Convex Environments-Part I: Agreement at a Linear Rate

Ali H. Sayed, Stefan Vlaski

Driven by the need to solve increasingly complex optimization problems in signal processing and machine learning, there has been increasing interest in understanding the behavior of gradient-descent algorithms in non-convex environments. Most available wor ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

A term structure model for dividends and interest rates

Damir Filipovic, Sander Félix M Willems

Over the last decade, dividends have become a standalone asset class instead of a mere side product of an equity investment. We introduce a framework based on polynomial jump-diffusions to jointly price the term structures of dividends and interest rates. ...

WILEY2020

Global Convergence and Variance Reduction for a Class of Nonconvex-Nonconcave Minimax Problems

Negar Kiyavash

Nonconvex minimax problems appear frequently in emerging machine learning applications, such as generative adversarial networks and adversarial learning. Simple algorithms such as the gradient descent ascent (GDA) are the common practice for solving these ...

2020

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Ali H. Sayed, Kun Yuan

This paper introduces a new algorithm for consensus optimization in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. All decentralized algorithms rely on communications between adjacent nodes. ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Distributed Coupled Multiagent Stochastic Optimization

Ali H. Sayed, Sulaiman A S A E Alghunaim

This paper develops an effective distributed strategy for the solution of constrained multiagent stochastic optimization problems with coupled parameters across the agents. In this formulation, each agent is influenced by only a subset of the entries of a ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Thermomechanical Nanostraining of Two-Dimensional Materials

Jürgen Brugger, Giovanni Boero, Xia Liu, Ana Conde Rubio, Samuel Tobias Howell

Local bandgap tuning in two-dimensional (2D) materials is of significant importance for electronic and optoelectronic devices but achieving controllable and reproducible strain engineering at the nanoscale remains a challenge. Here, we report on thermomech ...

2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search