Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Home

Concept

Vector calculus

About
Privacy
Disclaimer

Graph Chatbot

Related publications (27)

Page 2 of 2

Observation of tau(-) -> pi(-)nu(tau)e(+)e(-) and search for tau(-) -> pi(-)nu(tau)mu(+)mu(-)

Mingkui Wang, Olivier Schneider, Chao Wang, Yiming Li, Sun Hee Kim, Ke Huang

We present the first measurements of branching fractions of rare tau-lepton decays, tau(-) -> pi(-)nu(tau)l(+)l(-) (l = e or mu), using a data sample corresponding to 562 fb(-1) collected at a center-of-mass energy of 10.58 GeV with the Belle detector at t ...

American Physical Society2019

Neural Tanget Kernel: Convergence and Generalization in Neural Networks

Clément Hongler, Franck Raymond Gabriel, Arthur Ulysse Jacot-Guillarmod

At initialization, artificial neural networks (ANNs) are equivalent to Gaussian processes in the infinite-width limit [12, 9], thus connecting them to kernel methods. We prove that the evolution of an ANN during training can also be described by a kernel: ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2018

Convergence of the Exponentiated Gradient Method with Armijo Line Search

Volkan Cevher, Yen-Huan Li

Consider the problem of minimizing a convex differentiable function on the probability simplex, spectrahedron, or set of quantum density matrices. We prove that the expo-nentiated gradient method with Armijo line search always converges to the optimum, if ...

2019

Sur quelques équations aux dérivées partielles en lien avec le lemme de Poincaré

David Valentin Strütt

In this thesis, we study two distinct problems. The first problem consists of studying the linear system of partial differential equations which consists of taking a k-form, and applying the exterior derivative 'd' to it and add the wedge product with a 1- ...

EPFL2018

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2018

Method, system, and device for learned invariant feature transform for computer images

Pascal Fua, Vincent Lepetit, Kwang Moo Yi, Eduard Trulls Fortuny

A method for training a feature detector of an image processing device, including the steps of detecting features in the image to generate a score map, computing a center of mass on the score map to generate a location, extracting a patch from the image at ...

2018

Accelerated Sensorimotor Learning of Compliant Movement Primitives

Auke Ijspeert, Tadej Petric, Luca Colasanto

Autonomous trajectory generation through generalization requires a database of motion, which can be difficult and time consuming to obtain. In this paper, we propose a method for autonomous expansion of a database for the generation of compliant and accura ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018