arXiv research

Yarbus' claim to decode the observer's task from eye movements has received mixed reactions. In this paper, we have supported the hypothesis that it is possible to decode the task. We conducted an exploratory analysis on the dataset by projecting features and data points into a scatter plot to visualize the nuance prop…

New BE dimension measure reveals rich RL problems with sample-efficient algorithms.

The thesis explores IMP, a process that identifies winning tickets in DNNs, and its universality.

Reduces nonlinear electromechanical dynamics through quasi-steady state hypothesis.

Click-through data has proven to be a valuable resource for improving search-ranking quality. Search engines can easily collect click data, but biases introduced in the data can make it difficult to use the data effectively. In order to measure the effects of biases, many click models have been proposed in the literatu…

This paper explores the following question: what kind of statistical guarantees can be given when doing variable selection in high-dimensional models? In particular, we look at the error rates and power of some multi-stage regression methods. In the first stage we fit a set of candidate models. In the second stage we s…

Machine learning models are generally vulnerable to adversarial examples, which is in contrast to the robustness of humans. In this paper, we try to leverage one of the mechanisms in human recognition and propose a bio-inspired classification framework in which model inference is conditioned on label hypothesis. We pro…

EFI automates statistical inference for big data.

Proposes a flexible tournament design combining knockout and round-robin.

Study shows how market efficiency changes during the pandemic.

The problem of non-stationarity in financial markets is discussed and related to the dynamic nature of price volatility. A new measure is proposed for estimation of the current asset volatility. A simple and illustrative explanation is suggested of the emergence of significant serial autocorrelations in volatility and …

Improved elimination strategies for adaptive bandit identification reduce sample complexity and computational burden.

Classification may not be reliable for several reasons: noise in the data, insufficient input information, overlapping distributions and sharp definition of classes. Faced with several possibilities neural network may in such cases still be useful if instead of a classification elimination of improbable classes is done…

The paper extends the collar theorem to non-compact surfaces using new comparison theorems.

New algorithm eliminates arms to minimize regret in complex bandit problems.

New tests detect high-order interactions without permutations.

Learning how to act when there are many available actions in each state is a challenging task for Reinforcement Learning (RL) agents, especially when many of the actions are redundant or irrelevant. In such cases, it is sometimes easier to learn which actions not to take. In this work, we propose the Action-Elimination…

Active learning (AL) repeatedly trains the classifier with the minimum labeling budget to improve the current classification model. The training process is usually supervised by an uncertainty evaluation strategy. However, the uncertainty evaluation always suffers from performance degeneration when the initial labeled …

We introduce Neural Choice by Elimination, a new framework that integrates deep neural networks into probabilistic sequential choice models for learning to rank. Given a set of items to chose from, the elimination strategy starts with the whole item set and iteratively eliminates the least worthy item in the remaining …

Aims to eliminate domain bias in authentication without domain labels.

Due to a resource-constrained environment, network compression has become an important part of deep neural networks research. In this paper, we propose a new compression method, \textit{Inter-Layer Weight Prediction} (ILWP) and quantization method which quantize the predicted residuals between the weights in all convol…

We simplify Khovanov homology for torus braids using Gaussian elimination.

Logic approach finds real singularities in differential equations.

A wide class of machine learning algorithms can be reduced to variable elimination on factor graphs. While factor graphs provide a unifying notation for these algorithms, they do not provide a compact way to express repeated structure when compared to plate diagrams for directed graphical models. To exploit efficient t…

We develop an approach for feature elimination in statistical learning with kernel machines, based on recursive elimination of features.We present theoretical properties of this method and show that it is uniformly consistent in finding the correct feature space under certain generalized assumptions.We present four cas…

New algorithm CROP achieves asymptotic optimality with bounded regret.

In this paper, we theoretically prove that adding one special neuron per output unit eliminates all suboptimal local minima of any deep neural network, for multi-class classification, binary classification, and regression with an arbitrary loss function, under practical assumptions. At every local minimum of any deep n…

Two new feature selection algorithms improve on RFE.

In this paper, we consider the problem of online learning of Markov decision processes (MDPs) with very large state spaces. Under the assumptions of realizable function approximation and low Bellman ranks, we develop an online learning algorithm that learns the optimal value function while at the same time achieving ve…

GPE algorithm optimizes nonparametric contextual bandits with efficient regret bounds.

A framework for hypothesis testing on attributed graphs using sampling.

Efficiently clusters survival curves without computationally intensive resampling.

We consider closed immersed hypersurfaces in $\R^3$ and $\R^4$ evolving by a special class of constrained surface diffusion flows. This class of constrained flows includes the classical surface diffusion flow. In this paper we present a Lifespan Theorem for these flows, which gives a positive lower bound on the time fo…

A new estimator corrects bias in high-dimensional predictive regressions.

Generative modelling is often cast as minimizing a similarity measure between a data distribution and a model distribution. Recently, a popular choice for the similarity measure has been the Wasserstein metric, which can be expressed in the Kantorovich duality formulation as the optimum difference of the expected value…

We develop a novel method, called PoWER-BERT, for improving the inference time of the popular BERT model, while maintaining the accuracy. It works by: a) exploiting redundancy pertaining to word-vectors (intermediate encoder outputs) and eliminating the redundant vectors. b) determining which word-vectors to eliminate …

New algorithm robust to label corruptions in active learning.

This research simplifies verification of machine learning systems using reparameterization.

We propose a computationally efficient wrapper feature selection method - called Autoencoder and Model Based Elimination of features using Relevance and Redundancy scores (AMBER) - that uses a single ranker model along with autoencoders to perform greedy backward elimination of features. The ranker model is used to pri…

Probabilistic graphical models offer a powerful framework to account for the dependence structure between variables, which is represented as a graph. However, the dependence between variables may render inference tasks intractable. In this paper we review techniques exploiting the graph structure for exact inference, b…

We present a study of generalization for data-dependent hypothesis sets. We give a general learning guarantee for data-dependent hypothesis sets based on a notion of transductive Rademacher complexity. Our main result is a generalization bound for data-dependent hypothesis sets expressed in terms of a notion of hypothe…

A unified summary is given of the existence theory of Stein manifolds in all dimensions, based on published and pending literature. Eliashberg's characterization of manifolds admitting Stein structures requires an extra delicate hypothesis in complex dimension 2, which can be eliminated by passing to the topological se…

The paper sets thresholds for testing correlation in hypergraphs, distinguishing between independent and correlated states.

Hypothesis testing is an important problem with applications in target localization, clinical trials etc. Many active hypothesis testing strategies operate in two phases: an exploration phase and a verification phase. In the exploration phase, selection of experiments is such that a moderate level of confidence on the …

We present a provably optimal differentially private algorithm for the stochastic multi-arm bandit problem, as opposed to the private analogue of the UCB-algorithm [Mishra and Thakurta, 2015; Tossou and Dimitrakakis, 2016] which doesn't meet the recently discovered lower-bound of $Ω\left(\frac{K\log(T)}ε \right)$ [Shar…

Learnable multiclass hypothesis classes don't always have a sample compression scheme of fixed size.

Paper resolves open problems on sample complexity in binary hypothesis testing.

New bounds improve generalization in learning scenarios.