A Distributed Active Subspace Method for Scalable Surrogate Modeling of Function Valued Outputs
نویسندگان
چکیده
منابع مشابه
Active Subspace: Toward Scalable Low-Rank Learning
We address the scalability issues in low-rank matrix learning problems. Usually these problems resort to solving nuclear norm regularized optimization problems (NNROPs), which often suffer from high computational complexities if based on existing solvers, especially in large-scale settings. Based on the fact that the optimal solution matrix to an NNROP is often low rank, we revisit the classic ...
متن کاملA Structured-Outputs Method for Prediction of Protein Function
We apply the structured-output methodology to the problem of predicting the molecular function of proteins. Our results demonstrate that learning the structure of the output space yields better performance when compared to the traditional “transfer of annotation” method.
متن کاملScalable Maximum Margin Matrix Factorization by Active Riemannian Subspace Search
The user ratings in recommendation systems are usually in the form of ordinal discrete values. To give more accurate prediction of such rating data, maximum margin matrix factorization (MF) was proposed. Existing MF algorithms, however, either have massive computational cost or require expensive model selection procedures to determine the number of latent factors (i.e. the rank of the matrix to...
متن کاملScalable Distributed Garbage Collection for Systems of Active Objects
Automatic storage management is important in highly parallel programming environments where large numbers of objects and processes are being constantly created and discarded. Part of the difficulty with automatic garbage collection in systems of active objects, such as actors, is that an active object may not be garbage if it has references to other reachable objects, even when no other object ...
متن کاملA Scalable Modularized Synthesis Method for Distributed Kalman Filters ⋆
This paper presents a scheme to construct distributed observers for a system consisting of agents interconnected in a graph structure. The scheme is an iterative procedure to improve the observers with respect to global performance. It is modular in the sense that each agent iterates using only local model information. As a consequence, the complexity of the scheme scales linearly with the size...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2020
ISSN: 0885-7474,1573-7691
DOI: 10.1007/s10915-020-01346-2