Publications associées à Hinge loss

On the Generalization of Stochastic Gradient Descent with Momentum

While momentum-based accelerated variants of stochastic gradient descent (SGD) are widely used when training machine learning models, there is little theoretical understanding on the generalization error of such methods. In this work, we first show that th ...

Microtome Publishing2024

Dynamic Modeling of an Origami Prismatic Joint

Jamie Paik, Mustafa Mete, Jian-Lin Huang

Dynamic modeling of folding joints is critical for predicting dynamic behavior, optimizing design parameters, and developing control strategies for origami robots and machines. Although kinematics of the folded joints exists, little research describes thei ...

IEEE2023

Learning Disentangled Behaviour Patterns for Wearable-based Human Activity Recognition

Tao Lin

In wearable-based human activity recognition (HAR) research, one of the major challenges is the large intra-class variability problem. The collected activity signal is often, if not always, coupled with noises or bias caused by personal, environmental, or ...

ASSOC COMPUTING MACHINERY2022

STORM+: Fully Adaptive SGD with Momentum for Nonconvex Optimization

Volkan Cevher, Ali Kavis

In this work we investigate stochastic non-convex optimization problems wherethe objective is an expectation over smooth loss functions, and the goal is to find an approximate stationary point. The most popular approach to handling such problems is varianc ...

2021

Parametrized classifiers for optimal EFT sensitivity

Andrea Wulzer, Alfredo Glioti, Siyu Chen

We study unbinned multivariate analysis techniques, based on Statistical Learning, for indirect new physics searches at the LHC in the Effective Field Theory framework. We focus in particular on high-energy ZW production with fully leptonic decays, modeled ...

Springer Nature2021

Generalization error in high-dimensional perceptrons: Approaching Bayes error with convex optimization

Florent Gérard Krzakala, Lenka Zdeborová

We consider a commonly studied supervised classification of a synthetic dataset whose labels are generated by feeding a one-layer non-linear neural network with random iid inputs. We study the generalization performances of standard classifiers in the high ...

Curran Associates, Inc.2020

Second-Order Guarantees In Federated Learning

Ali H. Sayed, Stefan Vlaski, Elsa Rizk

Federated learning is a useful framework for centralized learning from distributed data under practical considerations of heterogeneity, asynchrony, and privacy. Federated architectures are frequently deployed in deep learning settings, which generally giv ...

IEEE2020

Chemical machine learning with kernels: The impact of loss functions

Volkan Cevher, Quoc Tran Dinh, Sandip De, Junhong Lin, Van Quang Nguyen

Machine learning promises to accelerate materials discovery by allowing computational efficient property predictions from a small number of reference calculations. As a result, the literature has spent a considerable effort in designing representations tha ...

2019

Learning without Smoothness and Strong Convexity

Yen-Huan Li

Recent advances in statistical learning and convex optimization have inspired many successful practices. Standard theories assume smoothness---bounded gradient, Hessian, etc.--- and strong convexity of the loss function. Unfortunately, such conditions may ...

EPFL2018

The Hidden Vulnerability of Distributed Learning in Byzantium

Rachid Guerraoui, El Mahdi El Mhamdi, Sébastien Louis Alexandre Rouault

While machine learning is going through an era of celebrated success, concerns have been raised about the vulnerability of its backbone: stochastic gradient descent (SGD). Recent approaches have been proposed to ensure the robustness of distributed SGD aga ...

2018

Chemical machine learning with kernels: The key impact of loss functions

Volkan Cevher, Sandip De, Junhong Lin, Van Quang Nguyen

Machine learning promises to accelerate materials discovery by allowing computational efficient property predictions from a small number of reference calculations. As a result, the literature spent a considerable effort in designing representations that ca ...

2018

Faster Coordinate Descent via Adaptive Importance Sampling

Volkan Cevher, Martin Jaggi, Dmytro Perekrestenko

Coordinate descent methods employ random partial updates of decision variables in order to solve huge-scale convex optimization problems. In this work, we introduce new adaptive rules for the random selection of their updates. By adaptive, we mean that our ...

PMLR2017

Fast rates by transferring from auxiliary hypotheses

Ilja Kuzborskij

In this work we consider the learning setting where, in addition to the training set, the learner receives a collection of auxiliary hypotheses originating from other tasks. We focus on a broad class of ERM-based linear algorithms that can be instantiated ...

2016

Learning Structured Models for Segmentation of 2D and 3D Imagery

Pascal Fua, Graham Knott, Kevin Smith, Aurélien Lucchi, Yunpeng Li, Carlos Joaquin Becker, Pablo Marquez Neila

Efficient and accurate segmentation of cellular structures in microscopic data is an essential task in medical imaging. Many state-of-the-art approaches to image segmentation use structured models whose parameters must be carefully chosen for optimal perfo ...

Institute of Electrical and Electronics Engineers2015

Integration of scientific and social networks

Ehsaneddin Asgari

In this paper, we address the problem of scientific-social network integration to find a matching relationship between members of these networks (i.e. The DBLP publication network and the Twitter social network). This task is a crucial step toward building ...

Springer2014

Learning for Structured Prediction Using Approximate Subgradient Descent with Working Sets

Pascal Fua, Aurélien Lucchi, Yunpeng Li

We propose a working set based approximate subgradient descent algorithm to minimize the margin-sensitive hinge loss arising from the soft constraints in max-margin learning frameworks, such as the structured SVM. We focus on the setting of general graphic ...

2013

Semi-Supervised and Unsupervised Novelty Detection using Nested Support Vector Machines

Jean-Philippe Thiran, Volker Gass, Frank Grégoire Jean de Morsier, Maurice Borgeaud

Very often in change detection only few labels or even none are available. In order to perform change detection in these extreme scenarios, they can be considered as novelty detection problems, semi-supervised (SSND) if some labels are available otherwise ...

Ieee2012

Structured Image Segmentation using Kernelized Features

Pascal Fua, Kevin Smith, Aurélien Lucchi, Yunpeng Li

Most state-of-the-art approaches to image segmentation formulate the problem using Conditional Random Fields. These models typically include a unary term and a pairwise term, whose parameters must be carefully chosen for optimal performance. Recently, stru ...

2012

Augmented-SVM: Automatic space partitioning for combining multiple non-linear dynamics

Ashwini Shukla

Non-linear dynamical systems (DS) have been used extensively for building generative models of human behavior. Their applications range from modeling brain dynamics to encoding motor commands. Many schemes have been proposed for encoding robot motions usin ...

Curran Associates, Inc.2012

Effects of hardware heterogeneity on the performance of SVM Alzheimer's disease classifier

Bénédicte Marie Maréchal, Ahmed Abdulkadir, Gunnar Krüger

Fully automated machine learning methods based on structural magnetic resonance imaging data can assist radiologists in the diagnosis of Alzheimer's disease (AD). These algorithms require large data sets to learn the separation of subjects with and without ...

Elsevier2011