Home ›
Entities
› academia
› A pruning algorithm with relaxed conditions for high-order neural networks based on smoothing group <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e2238" altimg="si242.svg"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math> regularization and adaptive momentum
A pruning algorithm with relaxed conditions for high-order neural networks based on smoothing group <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e2238" altimg="si242.svg"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math> regularization and adaptive momentum
Research article (Knowledge-Based Systems, 2022) · cited 16× · AI/ML
A pruning algorithm with relaxed conditions for high-order neural networks based on smoothing group L1/2 regularization and adaptive momentum
Summary
A pruning algorithm with relaxed conditions for high-order neural networks based on smoothing group L1/2 regularization and adaptive momentum is a scholarly article<sup id="cite-A2" class="cite-ref" title="A pruning algorithm with relaxed conditions for high-order neural networks based on smoothing group [1].
Key Facts
A pruning algorithm with relaxed conditions for high-order neural networks based on smoothing group L1/2 regularization and adaptive momentum's instance of is recorded as scholarly article<sup id="cite-C1" class="cite-ref" title="A pruning algorithm with relaxed conditions for high-order neural networks based on smoothing group [2].
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). A pruning algorithm with relaxed conditions for high-order neural networks based on smoothing group <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e2238" altimg="si242.svg"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math> regularization and adaptive momentum. Retrieved May 24, 2026, from https://4ort.xyz/entity/a-pruning-algorithm-with-relaxed-conditions-for-high-order-neural-networks-based-on-smoothing-group-mml-math-xmlns-mml-h
MLA“A pruning algorithm with relaxed conditions for high-order neural networks based on smoothing group <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e2238" altimg="si242.svg"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math> regularization and adaptive momentum.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/a-pruning-algorithm-with-relaxed-conditions-for-high-order-neural-networks-based-on-smoothing-group-mml-math-xmlns-mml-h.
BibTeX@misc{4ortxyz_a-pruning-algorithm-with-relaxed-conditions-for-high-order-neural-networks-based-on-smoothing-group-mml-math-xmlns-mml-h_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A pruning algorithm with relaxed conditions for high-order neural networks based on smoothing group <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e2238" altimg="si242.svg"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math> regularization and adaptive momentum}}, year = {2026}, url = {https://4ort.xyz/entity/a-pruning-algorithm-with-relaxed-conditions-for-high-order-neural-networks-based-on-smoothing-group-mml-math-xmlns-mml-h}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A pruning algorithm with relaxed conditions for high-order neural networks based on smoothing group <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e2238" altimg="si242.svg"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math> regularization and adaptive momentum — https://4ort.xyz/entity/a-pruning-algorithm-with-relaxed-conditions-for-high-order-neural-networks-based-on-smoothing-group-mml-math-xmlns-mml-h (retrieved 2026-05-24)
