Neural networks parameterize finite-rank generators for ODEs on the orthogonal Lie group, allowing optimization of orthonormal bases in function space with a universality result that rank-2 generators suffice for density.
Sigmoid-weighted linear units for neural network function approximation in reinforcement learning.Neural networks, 107:3–11
6 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
years
2026 6verdicts
UNVERDICTED 6roles
background 3polarities
background 3representative citing papers
ReMIA offers a practical privacy metric for synthetic data by training two generators and using a classifier to detect source dataset membership, achieving sensitivity comparable to standard MIAs with far less computation.
LoopUS converts pretrained LLMs into looped latent refinement models via block decomposition, selective gating, random deep supervision, and confidence-based early exiting to improve reasoning performance.
Multiscreen replaces softmax attention with screening to provide absolute query-key relevance, resulting in models with 30% fewer parameters that maintain stable performance at long contexts.
GRAM is a latent-variable generative model that performs recursive reasoning via stochastic trajectories, trained with amortized variational inference to support multi-hypothesis reasoning and unconditional generation.
SymADiT generates stable symmetric materials by enforcing Wyckoff-position and space-group constraints inside a latent generative model built on the prior ADiT architecture.
citing papers explorer
-
Learning Orthonormal Bases for Function Spaces
Neural networks parameterize finite-rank generators for ODEs on the orthogonal Lie group, allowing optimization of orthonormal bases in function space with a universality result that rank-2 generators suffice for density.
-
ReMIA: a Powerful and Efficient Alternative to Membership Inference Attacks against Synthetic Data Generators
ReMIA offers a practical privacy metric for synthetic data by training two generators and using a classifier to detect source dataset membership, achieving sensitivity comparable to standard MIAs with far less computation.
-
LoopUS: Recasting Pretrained LLMs into Looped Latent Refinement Models
LoopUS converts pretrained LLMs into looped latent refinement models via block decomposition, selective gating, random deep supervision, and confidence-based early exiting to improve reasoning performance.
-
Screening Is Enough
Multiscreen replaces softmax attention with screening to provide absolute query-key relevance, resulting in models with 30% fewer parameters that maintain stable performance at long contexts.
-
Generative Recursive Reasoning
GRAM is a latent-variable generative model that performs recursive reasoning via stochastic trajectories, trained with amortized variational inference to support multi-hypothesis reasoning and unconditional generation.
-
Generating Symmetric Materials using Latent Flow Matching
SymADiT generates stable symmetric materials by enforcing Wyckoff-position and space-group constraints inside a latent generative model built on the prior ADiT architecture.