Results 121 to 130 of about 992,707 (136)
Detecting rumors in social media using emotion based deep learning approach. [PDF]
PeerJ Comput SciSharma D, Srivastava A.
europepmc +1 more source
RANK-BASED INDICES FOR TESTING INDEPENDENCE BETWEEN TWO HIGH-DIMENSIONAL VECTORS. [PDF]
Ann StatZhou Y, Xu K, Zhu L, Li R.
europepmc +1 more source
Integrated Approach Using Intuitionistic Fuzzy Multicriteria Decision-Making to Support Classifier Selection for Technology Adoption in Patients with Parkinson Disease: Algorithm Development and Validation. [PDF]
JMIR Rehabil Assist TechnolOrtiz-Barrios M +7 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Combinatorial Hoeffding Decomposition and Asymptotic Normality of Subgraph Count Statistics
, 2004Given kand nconsidera graph with k vertices and n “blue” edges. We assume that the set of “blue”edges \({{a}_{n}} = \sum\limits_{{m = 0}}^{{n - 1}} {\underbrace{{{{{\left( q \right)}}_{{n - 1}}}\sum\limits_{{h = 0}}^{\infty } {p\left( {h,m} \right){{q}^{h}}.} }}_{{\mathop{ = }\limits^{{def}} {{H}_{{n,m}}}\left( q \right)}}} \) Is uniformly distributed ...
M. Bloznelis
semanticscholar +2 more sources
Characterization of Exchangeable Hoeffding-decomposable Sequences
Proceedings of the Bulgarian Academy of SciencesHoeffding decomposition is a classical method for studying symmetric statistics based on i.i.d. observations. The notion was extended by G. Peccati [Ann. Probab.
Stefan Gerdjikov +2 more
semanticscholar +1 more source
Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition
International Conference on Learning RepresentationsWe study the gap-dependent bounds of two important algorithms for on-policy Q-learning for finite-horizon episodic tabular Markov Decision Processes (MDPs): UCB-Advantage (Zhang et al. 2020) and Q-EarlySettled-Advantage (Li et al. 2021).
Zhong Zheng, Haochen Zhang, Lingzhou Xue
semanticscholar +1 more source
arXiv.org
In this article, we propose a new error bound for Koopman operator approximation using Kernel Extended Dynamic Mode Decomposition. The new estimate is $O(N^{-1/2})$, with a constant related to the probability of success of the bound, given by Hoeffding's
Diego Olgu'in +2 more
semanticscholar +1 more source
In this article, we propose a new error bound for Koopman operator approximation using Kernel Extended Dynamic Mode Decomposition. The new estimate is $O(N^{-1/2})$, with a constant related to the probability of success of the bound, given by Hoeffding's
Diego Olgu'in +2 more
semanticscholar +1 more source
Journal of Chemical Theory and Computation
We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition. For various quantum algorithms, in particular in the context of quantum chemistry, it is crucial to have energy estimates with
Alexander Gresch, Uğur Tepe, M. Kliesch
semanticscholar +1 more source
We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition. For various quantum algorithms, in particular in the context of quantum chemistry, it is crucial to have energy estimates with
Alexander Gresch, Uğur Tepe, M. Kliesch
semanticscholar +1 more source
Second-order approximation of exponential random graph models
Science China MathematicsExponential random graph models (ERGMs) are flexible probability models allowing edge dependency. However, it is known that to a first-order approximation, many ERGMs behave like Erdös-Rényi random graphs, where edges are independent.
Wen-Yi Ding, Xiao Fang
semanticscholar +1 more source