IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i16p2652-d1726992.html
   My bibliography  Save this article

ConceptVoid: Precision Multi-Concept Erasure in Generative Video Diffusion

Author

Listed:
  • Zhongbin Huang

    (Zhijiang College, Zhejiang University of Technology, Hangzhou 312030, China)

  • Xingjia Jin

    (School of Animation and Games, China Academy of Art, Hangzhou 310000, China)

  • Cunkang Wu

    (School of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China)

  • Wei Mao

    (Zhijiang College, Zhejiang University of Technology, Hangzhou 312030, China)

Abstract

Generative video diffusion models (GVDs) generate high-fidelity, text-conditioned videos but risk producing unsafe or copyrighted content due to training on large, uncurated datasets. Concept erasure techniques aim to remove such harmful concepts from pre-trained models while preserving overall generative performance. However, existing methods mainly target single-concept erasure and thus cannot satisfy the demand for simultaneously eliminating multi-concept in real-world scenarios. On the one hand, naively applying single-concept erasure sequentially to multi-concept often yields suboptimal results due to conflicts among target concepts; on the other hand, methods that alter concept mappings exhibit very poor adaptability and fail to accommodate the dynamic concept changes. To address these, we propose ConceptVoid, a scalable multi-concept erasure framework formulated as a constrained multi-objective optimization problem. For each target concept, an erasure loss is defined as the discrepancy between noise predictions conditioned and unconditioned on the concept. Non-target generation capabilities are preserved via output-distribution alignment regularization. We apply the multiple gradient descent algorithm (MGDA) to obtain Pareto-optimal solutions, aiming to minimize conflicts among different concept erasure objectives. In addition, we improve MGDA by introducing an importance-weighting mechanism, which adjusts the weights of gradients corresponding to each erasure objective, enabling flexible control over the priority and intensity of erasing different concepts, thereby enhancing the scalability of ConceptVoid. Extensive experiments demonstrate the effectiveness of ConceptVoid, validating our key contributions: (1) a scalable framework for multi-concept erasure in GVDs; (2) the integration of per-concept erasure with distribution alignment to retain non-target quality; and (3) an enhanced MGDA for conflict-aware, controllable erasure.

Suggested Citation

  • Zhongbin Huang & Xingjia Jin & Cunkang Wu & Wei Mao, 2025. "ConceptVoid: Precision Multi-Concept Erasure in Generative Video Diffusion," Mathematics, MDPI, vol. 13(16), pages 1-15, August.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:16:p:2652-:d:1726992
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/16/2652/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/16/2652/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Marguerite Frank & Philip Wolfe, 1956. "An algorithm for quadratic programming," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 95-110, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Valentina Morandi, 2024. "Bridging the user equilibrium and the system optimum in static traffic assignment: a review," 4OR, Springer, vol. 22(1), pages 89-119, March.
    2. Guillaume Sagnol & Edouard Pauwels, 2019. "An unexpected connection between Bayes A-optimal designs and the group lasso," Statistical Papers, Springer, vol. 60(2), pages 565-584, April.
    3. Abdelfettah Laouzai & Rachid Ouafi, 2022. "A prediction model for atmospheric pollution reduction from urban traffic," Environment and Planning B, , vol. 49(2), pages 566-584, February.
    4. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    5. Francesco Rinaldi & Damiano Zeffiro, 2023. "Avoiding bad steps in Frank-Wolfe variants," Computational Optimization and Applications, Springer, vol. 84(1), pages 225-264, January.
    6. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    7. Tiến-Sơn Phạm, 2019. "Optimality Conditions for Minimizers at Infinity in Polynomial Programming," Management Science, INFORMS, vol. 44(4), pages 1381-1395, November.
    8. Filippozzi, Rafaela & Gonçalves, Douglas S. & Santos, Luiz-Rafael, 2023. "First-order methods for the convex hull membership problem," European Journal of Operational Research, Elsevier, vol. 306(1), pages 17-33.
    9. Abulimiti Wubuli & Fangfang Li & Shanwei Cao & Lingling Zhang, 2025. "Timing of Preventive Highway Maintenance: A Study from the Whole Life Cycle Perspective," Sustainability, MDPI, vol. 17(3), pages 1-21, January.
    10. Ke, Ginger Y. & Zhang, Huiwen & Bookbinder, James H., 2020. "A dual toll policy for maintaining risk equity in hazardous materials transportation with fuzzy incident rate," International Journal of Production Economics, Elsevier, vol. 227(C).
    11. Friesz, Terry L. & Tourreilles, Francisco A. & Han, Anthony Fu-Wha, 1979. "Multi-Criteria Optimization Methods in Transport Project Evaluation: The Case of Rural Roads in Developing Countries," Transportation Research Forum Proceedings 1970s 318817, Transportation Research Forum.
    12. Damian Clarke & Daniel Paila~nir & Susan Athey & Guido Imbens, 2023. "Synthetic Difference In Differences Estimation," Papers 2301.11859, arXiv.org, revised Feb 2023.
    13. Fabiana R. Oliveira & Orizon P. Ferreira & Gilson N. Silva, 2019. "Newton’s method with feasible inexact projections for solving constrained generalized equations," Computational Optimization and Applications, Springer, vol. 72(1), pages 159-177, January.
    14. Ali Fattahi & Sriram Dasu & Reza Ahmadi, 2019. "Mass Customization and “Forecasting Options’ Penetration Rates Problem”," Operations Research, INFORMS, vol. 67(4), pages 1120-1134, July.
    15. Pokojovy, Michael & Jobe, J. Marcus, 2022. "A robust deterministic affine-equivariant algorithm for multivariate location and scatter," Computational Statistics & Data Analysis, Elsevier, vol. 172(C).
    16. Jeffrey Christiansen & Brian Dandurand & Andrew Eberhard & Fabricio Oliveira, 2023. "A study of progressive hedging for stochastic integer programming," Computational Optimization and Applications, Springer, vol. 86(3), pages 989-1034, December.
    17. Wei-jie Cong & Le Wang & Hui Sun, 2020. "Rank-two update algorithm versus Frank–Wolfe algorithm with away steps for the weighted Euclidean one-center problem," Computational Optimization and Applications, Springer, vol. 75(1), pages 237-262, January.
    18. Bo Jiang & Tianyi Lin & Shiqian Ma & Shuzhong Zhang, 2019. "Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis," Computational Optimization and Applications, Springer, vol. 72(1), pages 115-157, January.
    19. Li, Li & Li, Xiaopeng, 2019. "Parsimonious trajectory design of connected automated traffic," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 1-21.
    20. James Chok & Geoffrey M. Vasil, 2023. "Convex optimization over a probability simplex," Papers 2305.09046, arXiv.org, revised Apr 2025.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:16:p:2652-:d:1726992. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.