Concept

Logarithme

Publications associées (125)

On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants

Randomized trace estimation is a popular and well-studied technique that approximates the trace of a large-scale matrix B by computing the average of x(T) Bx for many samples of a random vector X. Often, B is symmetric positive definite (SPD) but a number ...

2021

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Arjen Lenstra, Robert Granger, Thorsten Kleinjung, Benjamin Pierre Charles Wesolowski

This paper reports on the computation of a discrete logarithm in the finite field F-230750, breaking by a large margin the previous record, which was set in January 2014 by a computation in F-29234. The present computation made essential use of the elimina ...

AMER MATHEMATICAL SOC2021

Dating Death: An Empirical Comparison of Medical Underwriters in the U.S. Life Settlements Market

Jiahua Xu

The value of a life settlement investment, manifested through a traded life insurance policy, is highly dependent on the insured's life expectancy (LE). LE estimation in life settlements relies heavily on medical underwriting. Employing different evaluatio ...

2020

Imaginary Multiplicative Chaos: Moments, Regularity And Connections To The Ising Model

Janne Matias Junnila

In this article we study imaginary Gaussian multiplicative chaos-namely a family of random generalized functions which can formally be written as e(iX(x)), where X is a log-correlated real-valued Gaussian field on R-d, that is, it has a logarithmic singula ...

INST MATHEMATICAL STATISTICS2020

Frequency-scalable fabrication process flow for lithium niobate based Lamb wave resonators

Luis Guillermo Villanueva Torrijo, Muhammad Faizan

In this paper, we demonstrate the fabrication and characterization of lithium niobate (LN) based Lamb wave mode (S0 and SH0) resonators that address the stringent requirements of RF filtering for modern communication systems. The devices consist of a 400 n ...

IOP PUBLISHING LTD2020

Convergences of Regularized Algorithms and Stochastic Gradient Methods with Random Projections

Volkan Cevher, Junhong Lin

We study the least-squares regression problem over a Hilbert space, covering nonparametric regression over a reproducing kernel Hilbert space as a special case. We rst investigate regularized algorithms adapted to a projection operator on a closed subspace ...

2020

Optimal Convergence for Distributed Learning with Stochastic Gradient Methods and Spectral Algorithms

Volkan Cevher, Junhong Lin

We study generalization properties of distributed algorithms in the setting of nonparametric regression over a reproducing kernel Hilbert space (RKHS). We first investigate distributed stochastic gradient methods (SGM), with mini-batches and multi-passes o ...

2020

Multilevel weighted least squares polynomial approximation

Fabio Nobile

Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required to achieve quasi ...

2020

Operational route choice methodologies for practical applications

Michel Bierlaire, Matthieu Marie Cochon de Lapparent, Evanthia Kazagli

This paper focuses on the application of tractable route choice models and presents a set of methods for deriving relevant disaggregate and aggregate route choice indicators, namely link and route flows. Tractability is achieved at the disaggregate level b ...

2020

On the Size of K-Cross-Free Families

János Pach, Andrei Kupavskii, Istvan Tomon

Two subsets A,B of an n-element ground set X are said to be crossing, if none of the four sets AB, A\B, B\A and X(AB) are empty. It was conjectured by Karzanov and Lomonosov forty years ago that if a family F of subsets of X does not contain k pairwise cr ...

SPRINGER HEIDELBERG2019

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