Through the direct study of the analysis estimator we derive oracle inequalities with fast and slow rates by adapting the arguments involving projections by Dalalyan, Hebiri and Lederer (2017). We then extend the theory to the square root analysis estimator. Finally, we focus on (square root) total variation regularize…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “Total Variation Penalty”
Unified framework for fair regression in aware and unaware settings.
problem Lack of principled methods for fair regression in unawareness settings.
method Formulated as an optimal transport problem, unifying aware and unaware settings.
result Characterizes optimal prediction functions via optimal transport maps under different penalties.
We establish adaptive results for trend filtering: least squares estimation with a penalty on the total variation of order differences. Our approach is based on combining a general oracle inequality for the -penalized least squares estimator with "interpolating vectors" to upper-bound the "effe…
We generalize to tree graphs obtained by connecting path graphs an oracle result obtained for the Fused Lasso over the path graph. Moreover we show that it is possible to substitute in the oracle inequality the minimum of the distances between jumps by their harmonic mean. In doing so we prove a lower bound on the comp…
The total variation (TV) penalty, as many other analysis-sparsity problems, does not lead to separable factors or a proximal operatorwith a closed-form expression, such as soft thresholding for the penalty. As a result, in a variational formulation of an inverse problem or statisticallearning estimation, it l…
We present a convex approach to probabilistic segmentation and modeling of time series data. Our approach builds upon recent advances in multivariate total variation regularization, and seeks to learn a separate set of parameters for the distribution over the observations at each time point, but with an additional pena…
We introduce an iterative optimization scheme for convex objectives consisting of a linear loss and a non-separable penalty, based on the expectation-consistent approximation and the vector approximate message-passing (VAMP) algorithm. Specifically, the penalties we approach are convex on a linear transformation of the…
The use of machine-learning in neuroimaging offers new perspectives in early diagnosis and prognosis of brain diseases. Although such multivariate methods can capture complex relationships in the data, traditional approaches provide irregular (l2 penalty) or scattered (l1 penalty) predictive pattern with a very limited…
The paper tackles sparse model fitting in distributed machine learning with graph-structured data.
problem Sparse model fitting across a distributed collection of heterogeneous data sets.
method Basis Pursuit Denoising with a total variation penalty, using ADMM for distributed methods.
result Recovery is successful with fewer samples than solving problems independently, or using methods with large overlap in signal supports.
In this paper, we provide a Banach-space formulation of supervised learning with generalized total-variation (gTV) regularization. We identify the class of kernel functions that are admissible in this framework. Then, we propose a variation of supervised learning in a continuous-domain hybrid search space with gTV regu…
Bayesian priors and penalties are equivalent in variational inference.
problem Understanding the relationship between Bayesian priors and penalties in variational inference.
method Characterizing the regularizers that can arise in variational inference and providing a systematic way to compute the prior corresponding to a given penalty.
result Equivalence between Bayesian priors and penalties in variational inference.
Optimal dynamic allocation of carbon allowances reduces emissions efficiently.
problem Reducing carbon emissions from firms over time with dynamic allocation and trading.
method Variational approach to solve the Stackelberg game between regulator and firms.
result Optimal policies lead to constant abatement effort and allowance price, outperforming static allocations.
VCAE improves autoencoder quality on MNIST and CelebA.
problem Overfitting and poor generative/reconstruction quality in autoencoders.
method Proposes variance-constrained autoencoder (VCAE) to enforce variance constraint on latent distribution.
result VCAE outperforms Wasserstein Autoencoder and Variational Autoencoder in quality.
New method detects changepoints in PDEs using optimized neural networks.
problem Detecting changepoints in PDEs with unknown locations and times.
method Online optimized Physics-Informed Neural Networks (PINNs) with Total-Variation penalty.
result Improved parameter estimation and model fitting with changepoints.
Identification of regions of interest (ROI) associated with certain disease has a great impact on public health. Imposing sparsity of pixel values and extracting active regions simultaneously greatly complicate the image analysis. We address these challenges by introducing a novel region-selection penalty in the framew…
Systematic trading strategies are rule-based procedures which choose portfolios and allocate assets. In order to attain certain desired return profiles, quantitative strategists must determine a large array of trading parameters. Backtesting, the attempt to identify the appropriate parameters using historical data avai…
New method reduces bias in sparse Bayesian learning.
problem High sparsity in statistical models leads to significant bias.
method Variable-coefficient penalty with hyperpriors.
result Reduces bias in sparse Bayesian learning.
New scalable algorithm for non-negative linear regression with entropy-regularized OT loss.
problem Generalizing task-specific linear models to broader applications.
method Sinkhorn-like scaling iterations for convex penalty and datafit terms.
result Simple multiplicative updates for various penalty and datafit terms.
This paper addresses the problem of sparsity penalized least squares for applications in sparse signal processing, e.g. sparse deconvolution. This paper aims to induce sparsity more strongly than L1 norm regularization, while avoiding non-convex optimization. For this purpose, this paper describes the design and use of…
In the classic sparsity-driven problems, the fundamental L-1 penalty method has been shown to have good performance in reconstructing signals for a wide range of problems. However this performance relies on a good choice of penalty weight which is often found from empirical experiments. We propose an algorithm called t…
Although the Lasso has been extensively studied, the relationship between its prediction performance and the correlations of the covariates is not fully understood. In this paper, we give new insights into this relationship in the context of multiple linear regression. We show, in particular, that the incorporation of …
We consider estimating a piecewise-constant image, or a gradient-sparse signal on a general graph, from noisy linear measurements. We propose and study an iterative algorithm to minimize a penalized least-squares objective, with a penalty given by the "l_0-norm" of the signal's discrete graph gradient. The method proce…
Paper addresses Byzantine attacks in decentralized optimization over networks.
problem Byzantine attacks in decentralized stochastic optimization over static and time-varying networks.
method Formulate a TV norm-penalized approximation of the problem, solve using stochastic subgradient method.
result Proposed method reaches a neighborhood of the Byzantine-free optimal solution.
New privacy mechanism for user-level discrete distributions with reduced penalty.
problem Achieving privacy for all items of a single user in practical applications.
method Study of learning discrete distributions with user-level differential privacy, proposing a new mechanism with reduced privacy penalty.
result Proposed mechanism reduces privacy penalty to , significantly smaller than standard mechanisms.
This paper studies the risk-adjusted optimal timing to liquidate an option at the prevailing market price. In addition to maximizing the expected discounted return from option sale, we incorporate a path-dependent risk penalty based on shortfall or quadratic variation of the option price up to the liquidation time. We …
Nonconvex penalty methods for sparse modeling in linear regression have been a topic of fervent interest in recent years. Herein, we study a family of nonconvex penalty functions that we call the trimmed Lasso and that offers exact control over the desired level of sparsity of estimators. We analyze its structural prop…
Ideas from the image processing literature have recently motivated a new set of clustering algorithms that rely on the concept of total variation. While these algorithms perform well for bi-partitioning tasks, their recursive extensions yield unimpressive results for multiclass clustering tasks. This paper presents a g…
The paper studies curves in Riemannian manifolds using total variation flow.
problem Analyzing the evolution of curves in Riemannian manifolds using total variation.
method Defining and proving the existence of strong solutions to the flow equations, showing variational equality, and proving convergence.
result Strong solutions converge to a constant map in finite time for non-positive sectional curvature.
Total variation denoising improves image quality adaptively.
problem Improving image quality from noisy data.
method Total variation regularization for image denoising.
result Denoised images converge to true images at a parametric rate.
Optimal Pre-Processing to Achieve Fairness and Its Relationship with Total Variation Barycentercs.IT
Optimal pre-processing reduces disparate impact by minimizing total variation distance.
problem Achieving fairness in data outputs based on protected attributes.
method Using pre-processing to enforce fairness, minimizing total variation distance between pre-processed and original data distributions.
result The problem of fairness can be formulated as a linear program, efficiently solvable.
In this paper, we present a novel penalty approach for the numerical solution of continuously controlled HJB equations and HJB obstacle problems. Our results include estimates of the penalisation error for a class of penalty terms, and we show that variations of Newton's method can be used to obtain globally convergent…
The paper tackles sparse graph learning under Laplacian-related constraints, improving upon existing methods.
problem Learning a sparse undirected graph from multivariate data under Laplacian-related constraints.
method Modifications to penalized log-likelihood approaches to enforce total positivity and lasso/adaptive lasso penalties using ADMM.
result The proposed constrained adaptive lasso approach significantly outperforms existing Laplacian-based approaches.
Optimal subset selection for hypothesis testing with penalties.
problem Optimal subset selection of information sources for hypothesis testing with misclassification penalties.
method Proposes a misclassification penalty framework and studies two variants of subset selection problems under centralized Bayesian learning.
result Proves the submodularity of the objective and constraints of the subset selection problems and establishes performance guarantees for greedy algorithms.
We show a very simple and general total second variation formula for Perelman's -functional at arbitrary points in the space of Riemannian metrics. Moreover we perform a study of the properties of the variations of Kähler structures. We deduce a quite simple and general total second variation formula for P…
Principal component analysis (PCA) is an exploratory tool widely used in data analysis to uncover dominant patterns of variability within a population. Despite its ability to represent a data set in a low-dimensional space, the interpretability of PCA remains limited. However, in neuroimaging, it is essential to uncove…
Total variation minimization clusters partially labeled data points.
problem Clustering partially labeled data points in stochastic block models.
method Total variation minimization as a clustering method.
result Total variation minimization allows for accurate clustering under certain model parameters.
Two new methods improve block-sparse signal recovery from noisy data.
problem Recovering block-sparse signals with unknown partitions.
method LogLOP-l2/l1 and AdaLOP-l2/l1 methods using log-sum penalty and MCP.
result Our methods outperform existing techniques in estimation accuracy.
This paper introduces a method to incorporate risk sensitivity in RL using quadratic variation penalties.
problem Risk-sensitive reinforcement learning under entropy regularization.
method Equivalent martingale property and quadratic variation penalty for value process.
result The proposed method improves finite-sample performance in linear-quadratic control problems.
We derive variational formulas for the total Q-prime curvature under the deformation of strictly pseudoconvex domains in a complex manifold. We also show that the total Q-prime curvature agrees with the renormalized volume of such domains with respect to the complete Einstein-Kähler metric. In the appendix, by Rod Gove…
Predictive models can be used on high-dimensional brain images for diagnosis of a clinical condition. Spatial regularization through structured sparsity offers new perspectives in this context and reduces the risk of overfitting the model while providing interpretable neuroimaging signatures by forcing the solution to …
We consider the problem of estimating a function defined over locations on a -dimensional grid (having all side lengths equal to ). When the function is constrained to have discrete total variation bounded by , we derive the minimax optimal (squared) estimation error rate, parametrized by …
Study extends DRO with IPMs, linking robustness to regularization and GANs.
problem Addressing robustness of deep neural networks to adversarial attacks.
method Distributionally Robust Optimization (DRO) with Integral Probability Metrics (IPMs).
result DRO under any IPM corresponds to a family of regularization penalties.
The total variation distance is a core statistical distance between probability measures that satisfies the metric axioms, with value always falling in . This distance plays a fundamental role in machine learning and signal processing: It is a member of the broader class of -divergences, and it is related to …
Paper introduces Wasserstein total correlation for disentangled representation learning.
problem Learning disentangled representations from data.
method Adversarial training of a critic to estimate Wasserstein total correlation in variational and Wasserstein autoencoders.
result Proposed method achieves comparable disentanglement performance with less reconstruction loss.
SaR-SVM-STV improves hyperspectral image classification with shape-adaptive reconstruction and denoising.
problem Classifying hyperspectral images with limited labeled data.
method Shape-adaptive Reconstruction (SaR) for pixel preprocessing, SVM for probability estimation, and Smoothed Total Variation (STV) for denoising.
result SaR-SVM-STV outperforms SVM-STV with fewer labeled data.
Variational properties of the total inverse mean curvature in the plane under boundary constraintsmath.DG
Study variational properties of curves in half-plane with area constraints.
problem Characterize critical points of inverse mean curvature.
method Variational analysis of curves with boundary constraints.
result Existence and stability of critical points with prescribed area.
Study variations of Riemannian submersions to maintain geodesic fibers and positive curvatures.
problem Maintain geodesic fibers and positive sectional curvatures in Riemannian submersions.
method Vary Riemannian metrics while keeping fibers totally geodesic and horizontal distribution fixed.
result Conditions for making sectional curvatures positive and existence of fat submersions.
We examine the total mixed scalar curvature of a fixed distribution as a functional of a pseudo-Riemannian metric. We develop variational formulas for quantities of extrinsic geometry of the distribution to find the critical points of this action. Together with the arbitrary variations of the metric, we consider also v…