arXiv research

Detects crypto pump-and-dump schemes with a thresholding-based model.

TBAL reduces manual annotation but requires validated data.

We study online learning when partial feedback information is provided following every action of the learning process, and the learner incurs switching costs for changing his actions. In this setting, the feedback information system can be represented by a graph, and previous works studied the expected regret of the le…

We study ranking quantilized mean-field games to select top-performing agents.

Subspace clustering refers to the problem of clustering high-dimensional data points into a union of low-dimensional linear subspaces, where the number of subspaces, their dimensions and orientations are all unknown. In this paper, we propose a variation of the recently introduced thresholding-based subspace clustering…

This paper addresses the problem of neighborhood selection for Gaussian graphical models. We present two heuristic algorithms: a forward-backward greedy algorithm for general Gaussian graphical models based on mutual information test, and a threshold-based algorithm for walk summable Gaussian graphical models. Both alg…

Study uses supercomputers to improve financial predictions.

New algorithm achieves almost exact graph matching in almost quadratic time.

Assessing the fairness of a decision making system with respect to a protected class, such as gender or race, is challenging when class membership labels are unavailable. Probabilistic models for predicting the protected class based on observable proxies, such as surname and geolocation for race, are sometimes used to …

Locally adaptive clustering for tree delineation.

To be effective, state of the art machine learning technology needs large amounts of annotated data. There are numerous compelling applications in healthcare that can benefit from high performance automated decision support systems provided by deep learning technology, but they lack the comprehensive data resources req…

Proposes ATH for KPI anomaly detection based on local data properties.

We consider the problem of clustering noisy high-dimensional data points into a union of low-dimensional subspaces and a set of outliers. The number of subspaces, their dimensions, and their orientations are unknown. A probabilistic performance analysis of the thresholding-based subspace clustering (TSC) algorithm intr…

We consider the problem of online active learning to collect data for regression modeling. Specifically, we consider a decision maker with a limited experimentation budget who must efficiently learn an underlying linear population model. Our main contribution is a novel threshold-based algorithm for selection of most i…

A privacy-preserving algorithm for high-dimensional bandits.

This paper aims at developing a new method by which to build a data-driven portfolio featuring a target risk-return. We first present a comparative study of recurrent neural network models (RNNs), including a simple RNN, long short-term memory (LSTM), and gated recurrent unit (GRU) for selecting the best predictor to u…

A class of heterogeneous agent models is investigated where investors switch trading position whenever their motivation to do so exceeds some critical threshold. These motivations can be psychological in nature or reflect behaviour suggested by the efficient market hypothesis (EMH). By introducing different propensitie…

AutoClip automatically adjusts gradient clipping for better audio separation.

Study evaluates thresholds for removing noise from DNN weights using random matrix theory.

Likelihood from a generative model is a natural statistic for detecting out-of-distribution (OoD) samples. However, generative models have been shown to assign higher likelihood to OoD samples compared to ones from the training distribution, preventing simple threshold-based detection rules. We demonstrate that OoD det…

Evaluation of the marginal likelihood plays an important role in model selection problems. The widely applicable Bayesian information criterion (WBIC) and singular Bayesian information criterion (sBIC) give approximations to the log marginal likelihood, which can be applied to both regular and singular models. When the…

In this paper, we study the problem of learning a mixture of Gaussians with streaming data: given a stream of $N$ points in $d$ dimensions generated by an unknown mixture of $k$ spherical Gaussians, the goal is to estimate the model parameters using a single pass over the data stream. We analyze a streaming version of …

SplitWise enhances stepwise regression by adaptively encoding numeric predictors into binary features.

Detecting edge correlation between two graphs sharpens a threshold based on densest subgraph.

This paper presents a spatiotemporal unsupervised feature learning method for cause identification of electromagnetic transient events (EMTE) in power grids. The proposed method is formulated based on the availability of time-synchronized high-frequency measurement, and using the convolutional neural network (CNN) as t…

A deep learning model improves pedestrian tracking accuracy.

We investigate the problem of machine learning with mislabeled training data. We try to make the effects of mislabeled training better understood through analysis of the basic model and equations that characterize the problem. This includes results about the ability of the noisy model to make the same decisions as the …

Proposes a network-based strategy to manage financial market risks.

New approach predicts stock price synchronization using RNNs and LSTMs.

Noise-Aware Conformal Prediction (NACP) calibrates CP for noisy labels.

Adaptive algorithm for outlier detection by balancing arm exploration and threshold estimation.

Fairly allocate items with noisy queries, reducing envy.

Subspace clustering refers to the problem of clustering unlabeled high-dimensional data points into a union of low-dimensional linear subspaces, assumed unknown. In practice one may have access to dimensionality-reduced observations of the data only, resulting, e.g., from "undersampling" due to complexity and speed con…

Study improves top-k set prediction with low cardinality.

The paper improves confidence regions for band-limited functions using tighter norm bounds and majority voting.

Proposes a framework to explain KS deterioration in credit risk models.

Study optimal treatment assignment policies under strategic agent responses.

The paper analyzes methods for sparse Bayesian regression in nonlinear system identification.

The high-dimensional linear model $y = X β^0 + ε$ is considered and the focus is put on the problem of recovering the support $S^0$ of the sparse vector $β^0.$ We introduce Lasso-Zero, a new $\ell_1$-based estimator whose novelty resides in an "overfit, then threshold" paradigm and the use of noise dictionaries concate…

New algorithm for reinforcement learning in uncertain environments with unknown thresholds.

We study the problem of robust time series analysis under the standard auto-regressive (AR) time series model in the presence of arbitrary outliers. We devise an efficient hard thresholding based algorithm which can obtain a consistent estimate of the optimal AR model despite a large fraction of the time series points …

M-learner estimates treatment effects in mediation models with subgroup identification.

Proposes a framework for OOD detection combining multiple statistics.

RCLA reduces noise in topological data analysis, preserving essential structure.

L-ARC improves model fairness by localizing risk guarantees.

Online method learns sparse models efficiently in large scale settings.

New algorithms optimize metrics for binary classification with class imbalance.

Image segmentation is one of the most fundamental tasks of computer vision. In many practical applications, it is essential to properly evaluate the reliability of individual segmentation results. In this study, we propose a novel framework to provide the statistical significance of segmentation results in the form of …