arXiv research

New proof shows knot Floer thickness limits bad domains in diagrams.

We establish sharp regularity and Fredholm theorems for the \bar{\partial}_b-Neumann problem on domains satisfying some non-generic geometric conditions. We use these domains to construct explicit examples of bad behaviour of the Kohn Laplacian: it is not always hypoelliptic up to the boundary, its partial inverse is n…

Proposes a new factor to improve BAB strategies by recognizing bad-beta assets.

The abstract constructs a set of bad 3-orbifolds and shows how any bad 3-orbifold can be transformed into a good one.

Recent work has noted that all bad local minima can be removed from neural network loss landscapes, by adding a single unit with a particular parameterization. We show that the core technique from these papers can be used to remove all bad local minima from any loss landscape, so long as the global minimum has a loss o…

New attacks reduce bad queries in black-box classifiers, improving effectiveness.

Study finds stocks with common firm fears earn lower returns.

This paper introduces a gradient analysis framework to improve language model performance by rewarding good examples and penalizing bad ones.

Self-training avoids spurious features in domain adaptation.

We provide two fundamental results on the population (infinite-sample) likelihood function of Gaussian mixture models with $M \geq 3$ components. Our first main result shows that the population likelihood function has bad local maxima even in the special case of equally-weighted mixtures of well-separated and spherical…

In this paper, we consider a dynamic asset pricing model in an approximate fractional economy to address empirical regularities related to both investor protection and past information. Our newly developed model features not only in terms with a controlling shareholder who diverts a fraction of the output, but also goo…

Due to the insufficient measurements in the distribution system state estimation (DSSE), full observability and redundant measurements are difficult to achieve without using the pseudo measurements. The matrix completion state estimation (MCSE) combines the matrix completion and power system model to estimate voltage b…

NICE learns a representation to avoid bad controls in causal inference.

In deep learning, \textit{depth}, as well as \textit{nonlinearity}, create non-convex loss surfaces. Then, does depth alone create bad local minima? In this paper, we prove that without nonlinearity, depth alone does not create bad local minima, although it induces non-convex loss surface. Using this insight, we greatl…

We show that every bad orbifold vector bundle can be realized as the restriction of a good orbifold vector bundle to a suborbifold of the base space. We give an explicit construction of this result in which the Chen-Ruan orbifold cohomology of the two base spaces are isomorphic (as additive groups). This construction i…

The empirically successful Thompson Sampling algorithm for stochastic bandits has drawn much interest in understanding its theoretical properties. One important benefit of the algorithm is that it allows domain knowledge to be conveniently encoded as a prior distribution to balance exploration and exploitation more eff…

In semi-supervised learning, virtual adversarial training (VAT) approach is one of the most attractive method due to its intuitional simplicity and powerful performances. VAT finds a classifier which is robust to data perturbation toward the adversarial direction. In this study, we provide a fundamental explanation why…

Computational models in fields such as computational neuroscience are often evaluated via stochastic simulation or numerical approximation. Fitting these models implies a difficult optimization problem over complex, possibly noisy parameter landscapes. Bayesian optimization (BO) has been successfully applied to solving…

In this work, we investigate semi-supervised learning (SSL) for image classification using adversarial training. Previous results have illustrated that generative adversarial networks (GANs) can be used for multiple purposes. Triple-GAN, which aims to jointly optimize model components by incorporating three players, ge…

Graph attacks can be successful with just a few bad nodes.

New findings on null measurability in symmetrization interface of VC learning.

Asymmetries in volatility spillovers are highly relevant to risk valuation and portfolio diversification strategies in financial markets. Yet, the large literature studying information transmission mechanisms ignores the fact that bad and good volatility may spill over at different magnitudes. This paper fills this gap…

Paper explores how generative models can be made more creative.

One of the main difficulties in analyzing neural networks is the non-convexity of the loss function which may have many bad local minima. In this paper, we study the landscape of neural networks for binary classification tasks. Under mild assumptions, we prove that after adding one special neuron with a skip connection…

Deep neural networks (DNNs) are known for their vulnerability to adversarial examples. These are examples that have undergone small, carefully crafted perturbations, and which can easily fool a DNN into making misclassifications at test time. Thus far, the field of adversarial research has mainly focused on image model…

We identify a class of over-parameterized deep neural networks with standard activation functions and cross-entropy loss which provably have no bad local valley, in the sense that from any point in parameter space there exists a continuous path on which the cross-entropy loss is non-increasing and gets arbitrarily clos…

We detect and quantify asymmetries in volatility spillovers using the realized semivariances of petroleum commodities: crude oil, gasoline, and heating oil. During the 1987--2014 period we document increasing spillovers from volatility among petroleum commodities that substantially change after the 2008 financial crisi…

Highly connected orbifolds are rare but exist.

PyBADS optimizes complex functions quickly and reliably.

Reviews recent findings on neural network landscapes.

This research secures deployed sentiment analysis models by identifying and defending against attack vectors.

Bad models can teach well by replicating noise.

A policy is said to be robust if it maximizes the reward while considering a bad, or even adversarial, model. In this work we formalize two new criteria of robustness to action uncertainty. Specifically, we consider two scenarios in which the agent attempts to perform an action $a$, and (i) with probability $α$, an alt…

Proposes a method to simulate data for testing credit risk scorecard stability.

In this paper, we study a simple and generic framework to tackle the problem of learning model parameters when a fraction of the training samples are corrupted. We first make a simple observation: in a variety of such settings, the evolution of training accuracy (as a function of training epochs) is different for clean…

Deep learning using neural networks has provided advances in image style transfer, merging the content of one image (e.g., a photo) with the style of another (e.g., a painting). Our research shows this concept can be extended to analyse the design of streetscapes in relation to health and wellbeing outcomes. An Austral…

A simple modification improves GAN performance by discarding bad samples.

We present an extension of Monte Carlo Tree Search (MCTS) that strongly increases its efficiency for trees with asymmetry and/or loops. Asymmetric termination of search trees introduces a type of uncertainty for which the standard upper confidence bound (UCB) formula does not account. Our first algorithm (MCTS-T), whic…

In this paper, we prove that depth with nonlinearity creates no bad local minima in a type of arbitrarily deep ResNets with arbitrary nonlinear activation functions, in the sense that the values of all local minima are no worse than the global minimum value of corresponding classical machine-learning models, and are gu…

The study analyzes local minima in ReLU networks and finds low probability of bad local minima.

As deep neural networks continue to revolutionize various application domains, there is increasing interest in making these powerful models more understandable and interpretable, and narrowing down the causes of good and bad predictions. We focus on recurrent neural networks (RNNs), state of the art models in speech re…

The lattice cohomology of a plumbed 3--manifold $M$ associated with a connected negative definite plumbing graph is an important tool in the study of topological properties of $M$, and in the comparison of the topological properties with analytic ones when $M$ is realized as complex analytic singularity link. By defini…

For the problem of high-dimensional sparse linear regression, it is known that an $\ell_0$-based estimator can achieve a $1/n$ "fast" rate on the prediction error without any conditions on the design matrix, whereas in absence of restrictive conditions on the design matrix, popular polynomial-time methods only guarante…

New rule reduces exploration regret to logarithmic, improving bad episode handling.

We show how bad and good volatility propagate through forex markets, i.e., we provide evidence for asymmetric volatility connectedness on forex markets. Using high-frequency, intra-day data of the most actively traded currencies over 2007 - 2015 we document the dominating asymmetries in spillovers that are due to bad r…

We find that factors explaining bank loan recovery rates vary depending on the state of the economic cycle. Our modeling approach incorporates a two-state Markov switching mechanism as a proxy for the latent credit cycle, helping to explain differences in observed recovery rates over time. We are able to demonstrate ho…

Deep ReLU networks with extra parameters have mostly good loss landscapes.

Black box machine learning models are currently being used for high stakes decision-making throughout society, causing problems throughout healthcare, criminal justice, and in other domains. People have hoped that creating methods for explaining these black box models will alleviate some of these problems, but trying t…