Skip to content
DraconiticResearch
Search Sources API
178,033 studies31 sourcesUpdated 30 min ago
PreprintarXiv licencearXiv

A Nonconvex Framework for Joint Sparse Sample Weighting and Parameter Estimation

Abstract

We propose a joint sparse sample weighting and parameter estimation (SWAPE) framework that jointly optimizes model parameters and sample weights to train a model while simultaneously assigning an individual weight to each training data point. Our framework accommodates several widely used loss functions for the model parameters, including convex, weakly convex, and difference-of-convex loss, and weakly convex sparsity functions to control the complexity of the sample weights. To solve the resulting bivariate problem, we propose an alternating minimization method in which the subproblems for updating the model parameters and weights are each approximated using majorize-minimize techniques. We provide several approximation methods for the loss functions considered in this paper, and show the overall algorithm's convergence. Numerical experiments on various learning tasks and data anomaly settings demonstrate the effectiveness of the proposed framework in minimizing the impact of undesirable data points compared to benchmark methods.

Related

  1. HARS: LDPC Bit-Flipping Decoding With Initial-Syndrome-Conditioned Parameter Mapping and Local-Reliability Weighting
    Tung Hsu Wu, Huang-Chang Lee
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. Keeping Score: Adaptive, Tuning-Free Loss Weighting for Score-Augmented Neural Ratio Estimation
    Alexander Shen, Mikael Kuusela
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. Sparse domination and the bi-parameter Hilbert transform
    Bingyang Hu
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  4. Weighting Scheme and Construction in IPCW Survival Estimation
    Ruohui Chen, Shuhan Liu, Scott Zuo +5
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Preconditioned Three-Term Conjugate Gradient Framework for Nonconvex Finite Minimax Problems
    Wenzhe Zhao
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{nojavan2026nonconvex,
  title = {{A Nonconvex Framework for Joint Sparse Sample Weighting and Parameter Estimation}},
  author = {Hassan Nojavan and Chul Moon and Miju Ahn},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.33957},
  eprint = {2610.33957},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.33957},
}
RIS
TY  - UNPB
TI  - A Nonconvex Framework for Joint Sparse Sample Weighting and Parameter Estimation
AU  - Hassan Nojavan
AU  - Chul Moon
AU  - Miju Ahn
PY  - 2026
DA  - 2026/10/25
PB  - arXiv
DO  - 10.48550/arxiv.2610.33957
UR  - https://arxiv.org/abs/2610.33957
AB  - We propose a joint sparse sample weighting and parameter estimation (SWAPE) framework that jointly optimizes model parameters and sample weights to train a model while simultaneously assigning an individual weight to each training data point. Our framework accommodates several widely used loss functions for the model parameters, including convex, weakly convex, and difference-of-convex loss, and weakly convex sparsity functions to control the complexity of the sample weights. To solve the resulting bivariate problem, we propose an alternating minimization method in which the subproblems for updating the model parameters and weights are each approximated using majorize-minimize techniques. We provide several approximation methods for the loss functions considered in this paper, and show the overall algorithm's convergence. Numerical experiments on various learning tasks and data anomaly settings demonstrate the effectiveness of the proposed framework in minimizing the impact of undesirable data points compared to benchmark methods.
ER  -