Results 231 to 240 of about 224,871 (275)
Advanced Intelligent Discovery, EarlyView.This work investigates the optimal initial data size for surrogate‐based active learning in functional material optimization. Using factorization machine (FM)‐based quadratic unconstrained binary optimization (QUBO) surrogates and averaged piecewise linear regression, we show that adequate initial data accelerates convergence, enhances efficiency, and ...
Seongmin Kim, In‐Saeng Suh
wiley +1 more source
Advanced Intelligent Discovery, EarlyView.An AI‐assisted approach is introduced to decode synthesis–performance relationships in metal‐organic framework‐derived supercapacitor materials using Bayesian optimization and predictive modeling, streamlining the search for optimal energy storage properties.
David Gryc +8 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Laplacian Sparse Coding, Hypergraph Laplacian Sparse Coding, and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013Sparse coding exhibits good performance in many computer vision applications. However, due to the overcomplete codebook and the independent coding process, the locality and the similarity among the instances to be encoded are lost. To preserve such locality and similarity information, we propose a Laplacian sparse coding (LSc) framework.
Shenghua Gao +2 more
exaly +3 more sources
Neurocomputing, 2014
Sparse coding has received an increasing amount of interest in recent years. It finds a basis set that captures high-level semantics in the data and learns sparse coordinates in terms of the basis set. However, most of the existing approaches fail to consider the geometrical structure of the data space.
Miao Zheng, Jiajun Bu
exaly +2 more sources
Sparse coding has received an increasing amount of interest in recent years. It finds a basis set that captures high-level semantics in the data and learns sparse coordinates in terms of the basis set. However, most of the existing approaches fail to consider the geometrical structure of the data space.
Miao Zheng, Jiajun Bu
exaly +2 more sources
Neural Computation, 2017
Sparse coding algorithms with continuous latent variables have been the subject of a large number of studies. However, discrete latent spaces for sparse coding have been largely ignored. In this work, we study sparse coding with latents described by discrete instead of continuous prior distributions.
Georgios Exarchakis, Jörg Lücke
openaire +3 more sources
Sparse coding algorithms with continuous latent variables have been the subject of a large number of studies. However, discrete latent spaces for sparse coding have been largely ignored. In this work, we study sparse coding with latents described by discrete instead of continuous prior distributions.
Georgios Exarchakis, Jörg Lücke
openaire +3 more sources
2014 IEEE Conference on Computer Vision and Pattern Recognition, 2014
Sparse coding is a widely involved technique in computer vision. However, the expensive computational cost can hamper its applications, typically when the codebook size must be limited due to concerns on running time. In this paper, we study a special case of sparse coding in which the codebook is a Cartesian product of two subcodebooks.
Tiezheng Ge, Kaiming He, Jian Sun 0001
openaire +1 more source
Sparse coding is a widely involved technique in computer vision. However, the expensive computational cost can hamper its applications, typically when the codebook size must be limited due to concerns on running time. In this paper, we study a special case of sparse coding in which the codebook is a Cartesian product of two subcodebooks.
Tiezheng Ge, Kaiming He, Jian Sun 0001
openaire +1 more source
Sparse Autoencoder for Sparse Code Multiple Access
2021 International Conference on Artificial Intelligence in Information and Communication (ICAIIC), 2021In the forthcoming 5G technology, Sparse Code Multiple Access (SCMA) is the most promising scheme that aims at improving spectral efficiency further and providing massive connectivity. The challenge behind implementing SCMA scheme is: constructing optimized codebooks in order to obtain minimum BER while keeping the receiver complexity minimum.
Medini Singh +2 more
openaire +1 more source
SC2Net: Sparse LSTMs for Sparse Coding
Proceedings of the AAAI Conference on Artificial Intelligence, 2018The iterative hard-thresholding algorithm (ISTA) is one of the most popular optimization solvers to achieve sparse codes. However, ISTA suffers from following problems: 1) ISTA employs non-adaptive updating strategy to learn the parameters on each dimension with a fixed learning rate. Such a strategy may lead to inferior performance due
Joey Tianyi Zhou +9 more
openaire +1 more source
2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541), 2005
Non-negative matrix factorization (NMF) is a very efficient parameter-free method for decomposing multivariate data into strictly positive activations and basis vectors. However, the method is not suited for overcomplete representations, where usually sparse coding paradigms apply.
Julian Eggert, Edgar Körner
openaire +1 more source
Non-negative matrix factorization (NMF) is a very efficient parameter-free method for decomposing multivariate data into strictly positive activations and basis vectors. However, the method is not suited for overcomplete representations, where usually sparse coding paradigms apply.
Julian Eggert, Edgar Körner
openaire +1 more source
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, 2000
In this article, we add a third dimension to partial redundancy elimination by considering code size as a further optimization goal in addition to the more classical consideration of computation costs and register pressure. This results in a family of sparse code motion algorithms coming as modular extensions of the algorithms for busy and lazy code ...
Oliver Rüthing +2 more
openaire +1 more source
In this article, we add a third dimension to partial redundancy elimination by considering code size as a further optimization goal in addition to the more classical consideration of computation costs and register pressure. This results in a family of sparse code motion algorithms coming as modular extensions of the algorithms for busy and lazy code ...
Oliver Rüthing +2 more
openaire +1 more source