Say for $x \in \mathbb{R}^n$, I'm minimizing $\|Ax - b \|_2^2$ with L1 regularization on selected entries of $x$. i.e. instead of directly add a $\|x\|_1$ regularization term, it would be on $|x_i| + |x_j| + \cdots + |x_k|$, where ${i, j, \cdots, k}$ are the entries I wish to impose sparsity constraint. If with gradient-based method, how should I approach this problem? I know for the regular L1 norm regularization we can use subgradient, but how to deal with this problem?
2026-03-26 09:38:36.1774517916
least squares with L1 regularization in selected entries
186 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LEAST-SQUARES
- Is the calculated solution, if it exists, unique?
- Statistics - regression, calculating variance
- Dealing with a large Kronecker product in Matlab
- How does the probabilistic interpretation of least squares for linear regression works?
- Optimizing a cost function - Matrix
- Given matrix $Q$ and vector $s$, find a vector $w$ that minimizes $\| Qw-s \|^2$
- Defects of Least square regression in some textbooks
- What is the essence of Least Square Regression?
- Alternative to finite differences for numerical computation of the Hessian of noisy function
- Covariance of least squares parameter?
Related Questions in GRADIENT-DESCENT
- Gradient of Cost Function To Find Matrix Factorization
- Can someone explain the calculus within this gradient descent function?
- Established results on the convergence rate of iterates for Accelerated Gradient Descent?
- Sensitivity (gradient) of function solved using RK4
- Concerning the sequence of gradients in Nesterov's Accelerated Descent
- Gradient descent proof: justify $\left(\dfrac{\kappa - 1}{\kappa + 1}\right)^2 \leq \exp(-\dfrac{4t}{\kappa+1})$
- If the gradient of the logistic loss is never zero, does that mean the minimum can never be achieved?
- How does one show that the likelihood solution for logistic regression has a magnitude of infinity for separable data (Bishop exercise 4.14)?
- How to determinate that a constrained inequality system is not empty?
- How to show that the gradient descent for unconstrained optimization can be represented as the argmin of a quadratic?
Related Questions in REGULARIZATION
- Zeta regularization vs Dirichlet series
- Uniform convergence of regularized inverse
- Composition of regularized inverse of linear operator on dense subspace converges on whole space?
- Linear Least Squares with $ {L}_{2} $ Norm Regularization / Penalty Term
- SeDuMi form of $\min_x\left\{\|Ax-b\|_2^2 + \lambda\|x\|_2\right\}$
- Solving minimization problem $L_2$ IRLS (Iteration derivation)
- How to utilize the right-hand side in inverse problems
- How Does $ {L}_{1} $ Regularization Present Itself in Gradient Descent?
- Proof in inverse scattering theory (regularization schemes)
- Derivation of Hard Thresholding Operator (Least Squares with Pseudo $ {L}_{0} $ Norm)
Related Questions in SUBGRADIENT
- how to prove the affine composition of the subdifferential?
- why subgradient of convex function is unique
- Subgradients of parametrized LP
- How to show $\partial f(x) =\{\nabla f(x) \}$ for a convex differentiable function?
- What is the subdifferential of the $f(x)$?
- Plot and calculate subgradient of f(x)
- Calculate the convex conjugate of f(x)?
- Proving necessity of a condition for minimum of a convex function
- An optimality condition for constrained problems using subgradients
- A necessary and sufficient condition for optimality of non-smooth convex functions over convex set
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Consider the proximal mapping $$ \mathrm{prox}_t(\mathbf{x}) =\arg \min_\mathbf{z} \frac{1}{2t} \| \mathbf{x-z} \|_2^2 + \lambda \|\mathbf{z}\|_1 $$
We can reason components by components. For those components that are not impacted by the regularization term, the minimizer is x_i For the others, it is $S_{\lambda t}(x_i)$.
Let call $S_{\lambda t}^*$ this modified soft-threshold operator
Proximal gradient update is in this case $$ \mathbf{x}^+ = S^*_{\lambda t} \left[\mathbf{x} - t \mathbf{A}^T \left( \mathbf{Ax-b} \right) \right] $$