language:
Find link is a tool written by Edward Betts.Longer titles found: Least-squares function approximation (view)
searching for Function approximation 60 found (99 total)
alternate case: function approximation
Envelope (waves)
(1,844 words)
[view diff]
exact match in snippet
view article
259. ISBN 0126077444. Christian Schüller (2006). "§2.4.1 Envelope function approximation (EFA)". Inelastic Light Scattering of Semiconductor Nanostructures:Reinforcement learning (8,293 words) [view diff] exact match in snippet view article find links to article
powerful: the use of samples to optimize performance, and the use of function approximation to deal with large environments. Thanks to these two key componentsLiquid state machine (531 words) [view diff] no match in snippet view article find links to article
A liquid state machine (LSM) is a type of reservoir computer that uses a spiking neural network. An LSM consists of a large collection of units (calledPhysics-informed neural networks (4,952 words) [view diff] exact match in snippet view article find links to article
of admissible solutions, increasing the generalizability of the function approximation. This way, embedding this prior information into a neural networkUniversal approximation theorem (5,190 words) [view diff] exact match in snippet view article find links to article
properties is sufficient for universal function approximation on bounded graphs and restricted universal function approximation on unbounded graphs, with an accompanyingDiscovery Studio (884 words) [view diff] exact match in snippet view article find links to article
regression, partial least squares, recursive partitioning, Genetic Function approximation and 3D field-based QSAR ADME Predictive toxicity Molecular MechanicsRandom neural network (1,063 words) [view diff] exact match in snippet view article find links to article
15, (2), 147–155, 1997. E. Gelenbe, Z. H. Mao, and Y. D. Li, "Function approximation with the random neural network", IEEE Trans. Neural Networks, 10Majority function (680 words) [view diff] no match in snippet view article find links to article
Avner; Pitassi, Toniann (2006). "Monotone Circuits for the Majority Function". Approximation, Randomization, and Combinatorial Optimization. Algorithms andShalabh Bhatnagar (753 words) [view diff] case mismatch in snippet view article find links to article
Prashanth; Bhatnagar, Shalabh (June 2011). "Reinforcement Learning With Function Approximation for Traffic Signal Control". IEEE Transactions on Intelligent TransportationKansa method (1,964 words) [view diff] exact match in snippet view article find links to article
which was then quite popular in scattered data processing and function approximation, to the solution of partial differential equations in the strong-formExponential integral (3,488 words) [view diff] case mismatch in snippet view article find links to article
Stegun, p. 229, 5.1.24 Giao, Pham Huy (2003-05-01). "Revisit of Well Function Approximation and An Easy Graphical Curve Matching Technique for Theis' Solution"Architectural design optimization (3,239 words) [view diff] exact match in snippet view article find links to article
architects. Wortmann, Thomas (2019-07-01). "Genetic evolution vs. function approximation: Benchmarking algorithms for architectural design optimization"Jerome H. Friedman (478 words) [view diff] exact match in snippet view article find links to article
1214/aos/1176347963. JSTOR 2241837. Friedman, Jerome H. (2001). "Greedy function approximation: a gradient boosting machine". Annals of Statistics. 29 (5): 1189–1232G-network (1,215 words) [view diff] exact match in snippet view article find links to article
1016/S0377-2217(99)00476-2. Gelenbe, Erol; Mao, Zhi-Hong; Da Li, Yan (1999). "Function approximation with spiked random networks". IEEE Transactions on Neural NetworksTopological index (1,229 words) [view diff] exact match in snippet view article find links to article
of phenylsulfonyl carboxylates to Vibrio fischeri using genetic function approximation". Bioorganic & Medicinal Chemistry. 13 (4): 1185–94. doi:10.1016/jSinc numerical methods (444 words) [view diff] exact match in snippet view article find links to article
_{k=-M}^{N}f(kh)\,{\textrm {sinc}}\left({\dfrac {x}{h}}-k\right)} . function approximation, approximation of derivatives, approximate definite and indefiniteSilvia Ferrari (1,445 words) [view diff] exact match in snippet view article find links to article
and different perspective. S. Ferrari, and R.F. Stengel. "Smooth function approximation using neural networks". IEEE Xplore. Silvia Ferrari and Robert FBart Kosko (1,052 words) [view diff] exact match in snippet view article find links to article
Kosko, Bart (August 2001). "The shape of fuzzy sets in adaptive function approximation". IEEE Transactions on Fuzzy Systems. 9 (4): 249–255. doi:10.1109/91Huber loss (1,098 words) [view diff] case mismatch in snippet view article find links to article
gradient descent algorithms. ICML. Friedman, J. H. (2001). "Greedy Function Approximation: A Gradient Boosting Machine". Annals of Statistics. 26 (5): 1189–1232Cerebellar model articulation controller (1,137 words) [view diff] exact match in snippet view article find links to article
CMAC receptive field functions produce discontinuous staircase function approximation, by integrating CMAC with B-splines functions, continuous CMAC offersContinuous-variable quantum information (2,427 words) [view diff] exact match in snippet view article find links to article
equations with the Feynman–Kac formula, initial value problems, function approximation, high-dimensional integration and quantum cryptography. QuantumActivation function (1,961 words) [view diff] case mismatch in snippet view article find links to article
Kenji (2018). "Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learning". Neural Networks. 107: 3–11. arXiv:1702Swish function (737 words) [view diff] case mismatch in snippet view article find links to article
(2017-11-02). "Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learning". arXiv:1702.03118v3 [cs.LG]. SerengilProduct-form solution (1,817 words) [view diff] exact match in snippet view article find links to article
S2CID 38667978. Gelenbe, Erol; Mao, Zhi-Hong; Li, Yan-Da (1991). "Function approximation with the random neural network". IEEE Transactions on Neural NetworksPhase Transitions and Critical Phenomena (1,295 words) [view diff] case mismatch in snippet view article find links to article
of Fluids', by G. Stell. 'Heisenberg Ferromagnet in the Green's Function Approximation', by R.A. Tahir-Kheli. 'Thermal Measurements and Critical PhenomenaBasis (linear algebra) (4,751 words) [view diff] exact match in snippet view article
Y.-H. (1995). "Stochastic choice of basis functions in adaptive function approximation and the functional-link net". IEEE Trans. Neural Netw. 6 (6): 1320–1329Deep backward stochastic differential equation method (4,113 words) [view diff] exact match in snippet view article find links to article
derivatives pricing and risk management. By leveraging the powerful function approximation capabilities of deep neural networks, deep BSDE addresses the computationalBinomial distribution (7,602 words) [view diff] exact match in snippet view article find links to article
Binomial probability mass function and normal probability density function approximation for n = 6 and p = 0.5Optimal control (4,742 words) [view diff] exact match in snippet view article find links to article
or the control, or both, are approximated using an appropriate function approximation (e.g., polynomial approximation or piecewise constant parameterization)Stock market prediction (2,738 words) [view diff] exact match in snippet view article find links to article
ANNs and stock prediction is that a classification approach (vs. function approximation) using outputs in the form of buy (y=+1) and sell (y=-1) resultsPosition of the Sun (3,398 words) [view diff] exact match in snippet view article find links to article
declination near the September equinox by up to +1.5°. The sine function approximation by itself leads to an error of up to 0.26° and has been discouragedDeep reinforcement learning (2,929 words) [view diff] exact match in snippet view article find links to article
suffers from high variance, making it impractical for use with function approximation in deep RL. Subsequent algorithms have been developed for more stableLearning to rank (4,442 words) [view diff] case mismatch in snippet view article find links to article
2018-06-13, retrieved 2020-10-12 Friedman, Jerome H. (2001). "Greedy Function Approximation: A Gradient Boosting Machine". The Annals of Statistics. 29 (5):Gradient boosting (4,259 words) [view diff] case mismatch in snippet view article find links to article
California, Berkeley. Friedman, J. H. (February 1999). "Greedy Function Approximation: A Gradient Boosting Machine" (PDF). Archived from the originalLeast-squares spectral analysis (3,354 words) [view diff] exact match in snippet view article find links to article
and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Proc. 27th AsilomarPerceptual computing (1,330 words) [view diff] exact match in snippet view article find links to article
constraint is the major difference between perceptual computing and function approximation applications of FSs and systems. Chai K.C.; Tay K. M.; Lim C.P.Generative model (2,431 words) [view diff] exact match in snippet view article find links to article
the target attribute Y. Mitchell 2015: "Logistic Regression is a function approximation algorithm that uses training data to directly estimate P ( Y ∣ XLina Jamil Karam (1,423 words) [view diff] exact match in snippet view article find links to article
James H. McClellan. As part of her PhD work, she introduced a new function approximation theory that enabled the development of a new efficient algorithmDeep learning (18,121 words) [view diff] exact match in snippet view article find links to article
high-dimensional problems in financial mathematics. By leveraging the powerful function approximation capabilities of deep neural networks, deep BSDE addresses the computationalTrajectory optimization (3,522 words) [view diff] exact match in snippet view article find links to article
method (Simultaneous Method) A transcription method that is based on function approximation, typically using implicit Runge--Kutta schemes. Pseudospectral methodNormal distribution (21,755 words) [view diff] no match in snippet view article find links to article
in Shore (2005). Some more approximations can be found at: Error function#Approximation with elementary functions. In particular, small relative error onMatching pursuit (2,176 words) [view diff] exact match in snippet view article find links to article
Krishnaprasad, P. (1993). "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition". Proceedings of 27thBackward stochastic differential equation (613 words) [view diff] exact match in snippet view article find links to article
problems in financial mathematics problems. By leveraging the powerful function approximation capabilities of deep neural networks, deep BSDE addresses the computationalBinade (454 words) [view diff] exact match in snippet view article find links to article
"A general-purpose method for faithfully rounded floating-point function approximation in FPGAs". 22nd IEEE Symposium on Computer Arithmetic. ARITH 2015Quantum-confined Stark effect (2,780 words) [view diff] exact match in snippet view article find links to article
the associated wavefunctions can be written using the envelope function approximation as follows: ψ ( r ) = ϕ n ( z ) 1 A e i ( k x ⋅ x + k y ⋅ y ) uNeural coding (8,560 words) [view diff] exact match in snippet view article find links to article
P. S. (November 1993). "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition". Proceedings of 27thEvolving intelligent system (2,223 words) [view diff] exact match in snippet view article find links to article
and M. J. Er, "Dynamic fuzzy neural networks-a novel approach to function approximation". in IEEE Transactions on Systems, Man, and Cybernetics, Part BErol Gelenbe (3,719 words) [view diff] exact match in snippet view article find links to article
28 (3): 656–663 (Sep. 1991). E. Gelenbe, Mao, Z.H., Li, Y.D. "Function approximation with spiked random networks", IEEE Trans. on Neural Networks, 10Nonlinear system identification (3,454 words) [view diff] exact match in snippet view article find links to article
approximation properties but these are usually based on standard function approximation results using for example the Weierstrass Theorem that applies equallyFrank L. Lewis (1,446 words) [view diff] exact match in snippet view article find links to article
Lyapunov Stability Theory, passivity, and nonlinear-in-the-parameters function approximation to invent novel feedback structures and parameter tuning laws thatGene expression programming (6,491 words) [view diff] exact match in snippet view article find links to article
instance, these numerical constants may be the weights or factors in a function approximation problem (see the GEP-RNC algorithm below); they may be the weightsOne-shot learning (computer vision) (4,136 words) [view diff] exact match in snippet view article
not be well-peaked, as is assumed in a δ {\displaystyle \delta } function approximation. Thus instead of this traditional approximation, the Bayesian one-shotRISE controllers (868 words) [view diff] exact match in snippet view article find links to article
uncertainties, neural network-based implementations for enhanced nonlinear function approximation, and modifications designed to address issues such as input saturationStefano De Marchi (576 words) [view diff] exact match in snippet view article find links to article
Alma mater University of Padua Known for Polynomial and radial basis function approximation Awards Habilitation (2017) Scientific career Fields Numerical analysisLambert W function (12,644 words) [view diff] exact match in snippet view article find links to article
computation of Lambert W function by piecewise minimax rational function approximation with variable transformation". doi:10.13140/RG.2.2.30264.37128.Log amplifier (2,429 words) [view diff] exact match in snippet view article find links to article
until the first limits. The resulting curve is a piecewise linear function approximation of the log function. If limiting amplifiers that clip "softly" areList of numerical analysis topics (8,327 words) [view diff] exact match in snippet view article find links to article
of continuity — measures smoothness of a function Least squares (function approximation) — minimizes the error in the L2-norm Minimax approximation algorithmActor-critic algorithm (1,872 words) [view diff] exact match in snippet view article find links to article
{\displaystyle V^{\pi _{\theta }}(s)} , then it can be learned by any value function approximation method. Let the critic be a function approximator V ϕ ( s ) {\displaystyleDiffusion model (14,123 words) [view diff] exact match in snippet view article find links to article
Given a density q {\displaystyle q} , we wish to learn a score function approximation f θ ≈ ∇ ln q {\displaystyle f_{\theta }\approx \nabla \ln q}Policy gradient method (6,297 words) [view diff] case mismatch in snippet view article find links to article
(1999). "Policy Gradient Methods for Reinforcement Learning with Function Approximation". Advances in Neural Information Processing Systems. 12. MIT Press