← Search

Anna Choromanska

19 accepted papers

2024

AutoDrop: Training Deep Learning Models with Automatic Learning Rate Drop

UAI 2024poster

Modern deep learning (DL) architectures are trained using variants of the SGD algorithm and typically rely on the user to manually drop the learning rate when the training curve saturates. In this paper, we develop an algorithm, that we call AutoDrop, that realizes the learning rate drop automatical…

2024

GRAWA: Gradient-based Weighted Averaging for Distributed Training of Deep Learning Models

AISTATS 2024poster

We study distributed training of deep learning models in time-constrained environments. We propose a new algorithm that periodically pulls workers towards the center variable computed as a weighted average of workers, where the weights are inversely proportional to the gradient norms of the workers…

2023

ERASE-Net: Efficient Segmentation Networks for Automotive Radar Signals

ICRA 2023poster

Among various sensors for assisted and autonomous driving systems, automotive radar has been considered as a robust and low-cost solution even in adverse weather or lighting conditions. With the recent development of radar technologies and open-sourced annotated data sets, semantic segmentation with…

Cited by 5SourceScholar
2022

DNN Patching: Progressive Fixing and Augmenting the Functionalities of DNNs for Autonomous Vehicles

RA-L 2022

Autonomous vehicles have become one of the most-awaited technologies of the century. In the recent years the advances in the area of deep learning and artificial intelligence enabled rapid development of the autonomous driving sector. Some car companies have already deployed autonomous driving softw

Cited by 6SourceScholar
2022

Low-Pass Filtering SGD for Recovering Flat Optima in the Deep Learning Optimization Landscape

AISTATS 2022poster

In this paper, we study the sharpness of a deep learning (DL) loss landscape around local minima in order to reveal systematic mechanisms underlying the generalization abilities of DL models. Our analysis is performed across varying network and optimizer hyper-parameters, and involves a rich family…

2020

Learning to Score Behaviors for Guided Policy Optimization

ICML 2020poster

We introduce a new approach for comparing reinforcement learning policies, using Wasserstein distances (WDs) in a newly defined latent behavioral space. We show that by utilizing the dual formulation of the WD, we can learn score functions over policy behaviors that can in turn be used to lead polic…

2019

Beyond Backprop: Online Alternating Minimization with Auxiliary Variables

ICML 2019oral

Despite significant recent advances in deep neural networks, training them remains a challenge due to the highly non-convex nature of the objective function. State-of-the-art methods rely on error backpropagation, which suffers from several well-known issues, such as vanishing and exploding gradient…

2018

Adversarial Learning-Based On-Line Anomaly Monitoring for Assured Autonomy

IROS 2018poster

The paper proposes an on-line monitoring framework for continuous real-time safety/security in learning-based control systems (specifically application to a unmanned ground vehicle). We monitor validity of mappings from sensor inputs to actuator commands, controller-focused anomaly detection (CFAM),…

Cited by 29SourceScholar
2018

VisualBackProp: Efficient Visualization of CNNs for Autonomous Driving

ICRA 2018poster

This paper proposes a new method, that we call VisualBackProp, for visualizing which sets of pixels of the input image contribute most to the predictions made by the convolutional neural network (CNN). The method heavily hinges on exploring the intuition that the feature maps contain less and less i…

Cited by 112SourceScholar
2017

Entropy-SGD: Biasing Gradient Descent Into Wide Valleys

ICLR 2017poster

This paper proposes a new optimization algorithm called Entropy-SGD for training deep neural networks that is motivated by the local geometry of the energy landscape. Local extrema with low generalization error have a large proportion of almost-zero eigenvalues in the Hessian with very few positive…

Cited by 899SourcecodeScholar
2017

Sensor modality fusion with CNNs for UGV autonomous driving in indoor environments

IROS 2017poster

We present a novel end-to-end learning framework to enable ground vehicles to autonomously navigate unknown environments by fusing raw pixels from cameras and depth measurements from a LiDAR. A deep neural network architecture is introduced to effectively perform modality fusion and reliably predict…

Cited by 78SourceScholar
2017

Simultaneous Learning of Trees and Representations for Extreme Classification and Density Estimation

ICML 2017poster

We consider multi-class classification where the predictor has a hierarchical structure that allows for a very large number of labels both at train and test time. The predictive power of such models can heavily depend on the structure of the tree, and although past work showed how to learn the tree…

2017

Structured adaptive and random spinners for fast machine learning computations

AISTATS 2017poster

We consider an efficient computational framework for speeding up several machine learning algorithms with almost no loss of accuracy. The proposed framework relies on projections via structured matrices that we call Structured Spinners, which are formed as products of three structured matrix-blocks…

Cited by 42SourcePDFScholar
2016

Binary embeddings with structured hashed projections

ICML 2016poster

We consider the hashing mechanism for constructing binary embeddings, that involves pseudo-random projections followed by nonlinear (sign function) mappings. The pseudo-random projection is described by a matrix, where not all entries are independent random variables but instead a fixed “budget of r…

Cited by 42SourcePDFScholar
2015

The Loss Surfaces of Multilayer Networks

AISTATS 2015poster

We study the connection between the highly non-convex loss function of a simple model of the fully-connected feed-forward neural network and the Hamiltonian of the spherical spin-glass model under the assumptions of: i) variable independence, ii) redundancy in network parametrization, and iii) unifo…

Cited by 1741SourcePDFScholar