arXiv research

DNF-Net tackles tabular data challenges with neural architecture.

Developed a new thresholding method that connects soft and hard thresholding.

Classifiers based on sparse representations have recently been shown to provide excellent results in many visual recognition and classification tasks. However, the high cost of computing sparse representations at test time is a major obstacle that limits the applicability of these methods in large-scale problems, or in…

The problem of estimating a high-dimensional sparse vector $\boldsymbolθ \in \mathbb{R}^n$ from an observation in i.i.d. Gaussian noise is considered. The performance is measured using squared-error loss. An empirical Bayes shrinkage estimator, derived using a Bernoulli-Gaussian prior, is analyzed and compared with the…

Sparsity in Deep Neural Networks (DNNs) is studied extensively with the focus of maximizing prediction accuracy given an overall parameter budget. Existing methods rely on uniform or heuristic non-uniform sparsity budgets which have sub-optimal layer-wise parameter allocation resulting in a) lower prediction accuracy o…

Inspired by the recent success of deep neural networks and the recent efforts to develop multi-layer dictionary models, we propose a Deep Analysis dictionary Model (DeepAM) which is optimized to address a specific regression task known as single image super-resolution. Contrary to other multi-layer dictionary models, o…

Iterative thresholding algorithms seek to optimize a differentiable objective function over a sparsity or rank constraint by alternating between gradient steps that reduce the objective, and thresholding steps that enforce the constraint. This work examines the choice of the thresholding operator, and asks whether it i…

The article examines different thresholding methods for improving PAM algorithm in cancer classification.

Paper analyzes adaptive ISTA with MAD for LASSO problem.

CV inference can be invalid for relatively unstable model comparisons.

It has recently been observed that certain extremely simple feature encoding techniques are able to achieve state of the art performance on several standard image classification benchmarks including deep belief networks, convolutional nets, factored RBMs, mcRBMs, convolutional RBMs, sparse autoencoders and several othe…

We study the effectiveness of various approaches that defend against adversarial attacks on deep networks via manipulations based on basis function representations of images. Specifically, we experiment with low-pass filtering, PCA, JPEG compression, low resolution wavelet approximation, and soft-thresholding. We evalu…

Heavy Lasso improves robustness in high-dimensional linear regression with heavy-tailed errors.

A new method for sparse PCA using orthogonal rotations and soft-thresholding.

We present a theoretical analysis and empirical evaluations of a novel set of techniques for computational cost reduction of classifiers that are based on learned transform and soft-threshold. By modifying optimization procedures for dictionary and classifier training, as well as the resulting dictionary entries, our t…

Optimal control of reserve assets for stablecoins to maintain peg stability.

Paper proposes a new sparse group k-max regularization for sparsity constraints.

We study confidence intervals based on hard-thresholding, soft-thresholding, and adaptive soft-thresholding in a linear regression model where the number of regressors $k$ may depend on and diverge with sample size $n$. In addition to the case of known error variance, we define and study versions of the estimators when…

Proximal operators are of particular interest in optimization problems dealing with non-smooth objectives because in many practical cases they lead to optimization algorithms whose updates can be computed in closed form or very efficiently. A well-known example is the proximal operator of the vector $\ell_1$ norm, whic…

Information spreads across social and technological networks, but often the network structures are hidden from us and we only observe the traces left by the diffusion processes, called cascades. Can we recover the hidden network structures from these observed cascades? What kind of cascades and how many cascades do we …

Sparse coding is a core building block in many data analysis and machine learning pipelines. Typically it is solved by relying on generic optimization techniques, such as the Iterative Soft Thresholding Algorithm and its accelerated version (ISTA, FISTA). These methods are optimal in the class of first-order methods fo…

A novel method to propagate uncertainty through the soft-thresholding nonlinearity is proposed in this paper. At every layer the current distribution of the target vector is represented as a spike and slab distribution, which represents the probabilities of each variable being zero, or Gaussian-distributed. Using the p…

New algorithm samples from log-concave distributions over polytopes efficiently.

New method improves sampling from logconcave distributions truncated on polytopes.

We propose a robust elastic net (REN) model for high-dimensional sparse regression and give its performance guarantees (both the statistical error bound and the optimization bound). A simple idea of trimming the inner product is applied to the elastic net model. Specifically, we robustify the covariance matrix by trimm…

In this paper we study the performance of the Projected Gradient Descent(PGD) algorithm for $\ell_{p}$-constrained least squares problems that arise in the framework of Compressed Sensing. Relying on the Restricted Isometry Property, we provide convergence guarantees for this algorithm for the entire range of $0\leq p\…

Almost Zoll affine surface found on cylinder.

We study affine maps between affine manifolds. Even when the fibers are compact and diffeomorphic, two of them can inherit different affine structures from the source space. This leads to a fixed linear holonomy deformation theory of the affine structure of an affine manifold. We found various conditions which make the…

In this article, we propose the notion of the general $p$-affine capacity and prove some basic properties for the general $p$-affine capacity, such as affine invariance and monotonicity. The newly proposed general $p$-affine capacity is compared with several classical geometric quantities, e.g., the volume, the $p$-var…

In this paper, we show that a compact affine manifold endowed with an Affine Anosov transformation is finitely covered by a complete affine nilmanifold.

An affine manifold is a manifold with torsion-free flat affine connection. A geometric topologist's definition of an affine manifold is a manifold with an atlas of charts to the affine space with affine transition functions; a radiant affine manifold is an affine manifold with holonomy consisting of affine transformati…

An affine manifold is said to be geodesically complete if all affine geodesics extend for all time. It is said to be affine Killing complete if the integral curves for any affine Killing vector field extend for all time. We use the solution space of the quasi-Einstein equation to examine these concepts in the setting o…

Two families of general affine surface areas are introduced. Basic properties and affine isoperimetric inequalities for these new affine surface areas as well as for $L_φ$ affine surface areas are established.

Study on completeness in affine and statistical geometry.

This thesis is devoted to the study of affine processes and their applications in financial mathematics. In the first part we consider the theory of time-inhomogeneous affine processes on general state spaces. We present a concise setup for time-inhomogeneous Markov processes. For stochastically continuous affine proce…

In this paper, we consider affine self-similar solutions for the affine curve shortening flow in the Euclidean plane. We obtain the equations of all affine self-similar solutions up to affine transformations and solve the equations or give descriptions of the solutions for the degenerate case. Some new special solution…

A (flat) affine $3$-manifold is a $3$-manifold with an atlas of charts to an affine space $\mathbb{R}^3$ with transition maps in the affine transformation group $\mathrm{Aff}(\mathbb{R}^3)$. We will show that a connected closed affine $3$-manifold is either an affine Hopf $3$-manifold or decomposes canonically to conca…

We study affine Jacobi structures on an affine bundle $π:A\to M$, i.e. Jacobi brackets that close on affine functions. We prove that there is a one-to-one correspondence between affine Jacobi structures on $A$ and Lie algebroid structures on the vector bundle $A^+=\bigcup_{p\in M}Aff(A_p,\R)$ of affine functionals. Som…

Neural networks that are based on unfolding of an iterative solver, such as LISTA (learned iterative soft threshold algorithm), are widely used due to their accelerated performance. Nevertheless, as opposed to non-learned solvers, these networks are trained on a certain dictionary, and therefore they are inapplicable f…

Paper shows affine constraint is unnecessary for high-dimensional data.

In this paper we discuss some affine properties of convex equal-area polygons, which are convex polygons such that all triangles formed by three consecutive vertices have the same area. Besides being able to approximate closed convex smooth curves almost uniformly with respect to affine length, convex equal-area polygo…

An affine Cartan calculus is developed. The concepts of special affine bundles and special affine duality are introduced. The canonical isomorphisms, fundamental for Lagrangian and Hamiltonian formulations of the dynamics in the affine setting are proved.

Calculates affine transformations for specific homogeneous spaces.

In this paper, we introduce a new structure, namely, affine Szabó connection. We prove that, on $2$-dimensional affine manifolds, the affine Szabó structure is equivalent to one of the cyclic parallelism of the Ricci tensor. A characterization for locally homogeneous affine Szabó surface is obtained. Examples of two- a…

In this paper, we introduce a new parameter, the affine twist parameter for the affine deformation of a sphere with holes. We show that the affine deformation space can be parametrized by Margulis invariants and affine twist parameters. The affine twist parameter is canonically regarded as a correspondence to the Fench…

The paper studies a new class of affine maximal surfaces with singularities.

Geometric models for algebraic suspensions using affine deformation spaces.

New kernel connects deep learning to optimization, improving generalization.