arXiv:2201.08233
공식 코드 · Papers with Code
Encoding large information structures in linear algebra and statistical models
원문 초록
Large information sizes in samples and features can be encoded to speed up the learning of statistical models based on linear algebra and remove unwanted signals. Encoding information can reduce both sample and feature dimension to a smaller representational set. Here two examples are shown on linear mixed models and mixture models speeding up the run time for parameter estimation by a factor defined by the user's choice on dimension reduction (can be linear, quadratic or beyond based on dimension specification).
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
On the performance of multi-fidelity and reduced-dimensional neural emulators for inference of physiologic boundary conditions
Analytic estimation of parameters of stochastic volatility diffusion models with exponential-affine characteristic function for currency option pricing
A Simple Approximate Bayesian Inference Neural Surrogate for Stochastic Petri Net Models
Robust Spatiotemporal Epidemic Modeling with Integrated Adaptive Outlier Detection
Active Learning for Manifold Gaussian Process Regression
IMC-PINN-FE: A Physics-Informed Neural Network for Patient-Specific Left Ventricular Finite Element Modeling with Image Motion Consistency and Biomechanical Parameter Estimation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.