arXiv research

Develops a privacy-preserving algorithm for sparse robust regression.

Paper proposes robust LAD estimators for 2D sinusoidal model, proving consistency and normality.

Exact LAD line fitting via PALB with linear scaling and speed.

Improved robust regression for heavy-tailed and contaminated data.

Paper proposes a novel method to improve matrix completion with median loss for large datasets.

The paper addresses nonconvex penalized LAD estimation in partial linear models using DNNs.

Paper analyzes adaptive ISTA with MAD for LASSO problem.

The support vector machine (SVM) is a widely used method for classification. Although many efforts have been devoted to develop efficient solvers, it remains challenging to apply SVM to large-scale problems. A nice property of SVM is that the non-support vectors have no effect on the resulting classifier. Motivated by …

We propose a clustering-based iterative algorithm to solve certain optimization problems in machine learning, where we start the algorithm by aggregating the original data, solving the problem on aggregated data, and then in subsequent steps gradually disaggregate the aggregated data. We apply the algorithm to common m…

The paper proves deep learning can be robust with certain loss functions.

Autotune optimizes Lasso tuning parameters efficiently and accurately.

This paper achieves optimal regret bounds for locally private linear contextual bandit.

In this paper, we consider complete non-catenoidal minimal surfaces of finite total curvature with two ends. A family of such minimal surfaces with least total absolute curvature is given. Moreover, we obtain a uniqueness theorem for this family from its symmetries.

Recently, it has been shown that Absolute Parallelism (AP) geometry admits paths that are naturally quantized. These paths have been used to describe the motion of spinning particles in a background gravitational field. In case of a weak static gravitational field limits, the paths are applied successfully to interpret…

The typical behavior of optimal solutions to portfolio optimization problems with absolute deviation and expected shortfall models using replica analysis was pioneeringly estimated by S. Ciliberti and M. Mézard [Eur. Phys. B. 57, 175 (2007)]; however, they have not yet developed an approximate derivation method for fin…

Optimal weight windows are symmetric rectangles centered at peak.

Quantile regression is a method to estimate the quantiles of the conditional distribution of a response variable, and as such it permits a much more accurate portrayal of the relationship between the response variable and observed covariates than methods such as Least-squares or Least Absolute Deviations regression. It…

Investigates MAD-RP portfolios for asset allocation.

Nonparametric methods are widely applicable to statistical inference problems, since they rely on a few modeling assumptions. In this context, the fresh look advocated here permeates benefits from variable selection and compressive sampling, to robustify nonparametric regression against outliers - that is, data markedl…

Unified approach to linear regression using covariance fitting for optimal weights.

Decomposing complex time series into trend, seasonality, and remainder components is an important task to facilitate time series anomaly detection and forecasting. Although numerous methods have been proposed, there are still many time series characteristics exhibiting in real-world data which are not addressed properl…

In this paper, we study non-asymptotic deviation bounds of the least squares estimator in Gaussian AR($n$) processes. By relying on martingale concentration inequalities and a tail-bound for $χ^2$ distributed variables, we provide a concentration bound for the sample covariance matrix of the process output. With this, …

The paper studies curves in Finsler-like spaces and their properties.

Let G be a connected semisimple Lie group with at least one absolutely simple factor S such that R-rank(S) is at least 2, and let $Γ$ be a uniform lattice in G. (a) If $CH$ holds, then $Γ$ has a unique asymptotic cone up to homeomorphism. (b) If $CH$ fails, then $Γ$ has $2^{2^ω}$ asymptotic cones up to homeomorphism.

The study improves VaR forecast accuracy by modeling conditional quantile dynamics.

Private sketches protect linear regression data privacy.

K-ARMA models cluster time series data robustly.

New algorithm reduces sketching dimension to effective problem size.

The importance of Einstein's geometrization philosophy, as an alternative to the least action principle, in constructing general relativity (GR), is illuminated. The role of differential identities in this philosophy is clarified. The use of Bianchi identity to write the field equations of GR is shown. Another similar …

SpinSVAR estimates SVAR models with sparse input, improving accuracy and scalability.

The study finds dense orbits and absolute period leaves for complex flows.

Regularized approaches have been successfully applied to linear system identification in recent years. Many of them model unknown impulse responses exploiting the so called Reproducing Kernel Hilbert spaces (RKHSs) that enjoy the notable property of being in one-to-one correspondence with the class of positive semidefi…

Using artificial neural network for the prediction of heat demand has attracted more and more attention. Weather conditions, such as ambient temperature, wind speed and direct solar irradiance, have been identified as key input parameters. In order to further improve the model accuracy, it is of great importance to und…

Recurrent neural networks (RNNs) are notoriously difficult to train. When the eigenvalues of the hidden to hidden weight matrix deviate from absolute value 1, optimization becomes difficult due to the well studied issue of vanishing and exploding gradients, especially when trying to learn long-term dependencies. To cir…

One popular method for dealing with large-scale data sets is sampling. For example, by using the empirical statistical leverage scores as an importance sampling distribution, the method of algorithmic leveraging samples and rescales rows/columns of data matrices to reduce the data size before performing computations on…

Method estimates parameters of complex nonlinear systems.

In this paper, we consider the problem of recovering a sparse signal based on penalized least squares formulations. We develop a novel algorithm of primal-dual active set type for a class of nonconvex sparsity-promoting penalties, including $\ell^0$, bridge, smoothly clipped absolute deviation, capped $\ell^1$ and mini…

Objective: A median of 14.4% of patient undergone at least one adverse event during surgery and a third of them are preventable. The occurrence of adverse events forces surgeons to implement corrective strategies and, thus, deviate from the standard surgical process. Therefore, it is clear that the automatic identifica…

Model predicts viscosity of multicomponent systems efficiently.

The purpose of this research is to apply technical analysis of Sutte Indicator in stock trading which will assist in the investment decision making process i.e. buying or selling shares. This research takes data of "A" on the Indonesia Stock Exchange(IDX or BEI) 29 November 2006 until 20 September 2016 period. To see t…

New risk class penalizes loss deviations from mean on both sides.

We are concerned with obtaining novel concentration inequalities for the missing mass, i.e. the total probability mass of the outcomes not observed in the sample. We not only derive - for the first time - distribution-free Bernstein-like deviation bounds with sublinear exponents in deviation size for missing mass, but …

In the last twenty-five years (1990-2014), algorithmic advances in integer optimization combined with hardware improvements have resulted in an astonishing 200 billion factor speedup in solving Mixed Integer Optimization (MIO) problems. We present a MIO approach for solving the classical best subset selection problem o…

We consider the problem of predicting as well as the best linear combination of d given functions in least squares regression, and variants of this problem including constraints on the parameters of the linear combination. When the input distribution is known, there already exists an algorithm having an expected excess…

Proves spheres with bounded curvatures must contain a unit ball.

Understanding efficiency in high dimensional linear models is a longstanding problem of interest. Classical work with smaller dimensional problems dating back to Huber and Bickel has illustrated the benefits of efficient loss functions. When the number of parameters $p$ is of the same order as the sample size $n$, $p \…

Enhances RSCNs with hybrid regularization for nonlinear dynamics.

We present reconstruction algorithms for smooth signals with block sparsity from their compressed measurements. We tackle the issue of varying group size via group-sparse least absolute shrinkage selection operator (LASSO) as well as via latent group LASSO regularizations. We achieve smoothness in the signal via fusion…