The DOI matches its Crossref record.
Adaptive Algorithms and Stochastic Approximations
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Cognitive radio: brain-empowered wireless communications
Haykin, S. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.839380 · Cited by 11,916
Pattern Recognition and Neural Networks
Ripley, B. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511812651 · Cited by 6,459
Natural Language Processing (almost) from Scratch
Collobert, R., Weston, J., Bottou, L., Karlen, M., Kavukcuoglu, K., & Kuksa, P. P. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1103.0398 · Cited by 4,962
Detection of Abrupt Changes: Theory and Application
Riedel, K. S. (1994) · Technometrics · doi:10.1080/00401706.1994.10485821 · Cited by 3,518
Optimization Methods for Large-Scale Machine Learning
Bottou, L., Curtis, F. E., & Nocedal, J. (2018) · SIAM Review · doi:10.1137/16m1080173 · Cited by 3,128
Online Learning for Matrix Factorization and Sparse Coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.0050 · Cited by 2,258
Online dictionary learning for sparse coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553463 · Cited by 2,114
Zhang, Q., & Benveniste, A. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.165591 · Cited by 2,091
Self-citationStochastic Gradient Descent Tricks
Bottou, L. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8_25 · Cited by 1,929
Roth, A. E., & Erev, I. (1995) · Games and Economic Behavior · doi:10.1016/s0899-8256(05)80020-x · Cited by 1,678
Pegasos: primal estimated sub-gradient solver for SVM
Shalev-Shwartz, S., Singer, Y., Srebro, N., & Cotter, A. (2011) · Mathematical Programming · doi:10.1007/s10107-010-0420-4 · Cited by 1,477
Equivariant adaptive source separation
Cardoso, J.-F., & Laheld, B. H. (1996) · IEEE Transactions on Signal Processing · doi:10.1109/78.553476 · Cited by 1,349
Big data deep learning: Challenges and perspectives
Chen, X.-W., & Lin, X. (2014) · IEEE Access · doi:10.1109/access.2014.2325029 · Cited by 1,255
Relational learning via collective matrix factorization
Singh, A. P., & Gordon, G. J. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401969 · Cited by 1,204
An analysis of temporal-difference learning with function approximation
Tsitsiklis, J. N., & Van Roy, B. (1997) · IEEE Transactions on Automatic Control · doi:10.1109/9.580874 · Cited by 1,194
Learning mid-level features for recognition
Boureau, Y.-L., Bach, F., LeCun, Y., & Ponce, J. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539963 · Cited by 1,052
Theano: A CPU and GPU Math Compiler in Python
Bergstra, J., Breuleux, O., Bastien, F., Lamblin, P., Pascanu, R., Desjardins, G., Turian, J., Warde-Farley, D., & Bengio, Y. (2010) · Proceedings of the Python in Science Conference · doi:10.25080/majora-92bf1922-003 · Cited by 1,052
Lee, C., Xie, S., Gallagher, P., Zhang, Z., & Zhuowen Tu, A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.5185 · Cited by 993
Pegasos: Primal Estimated sub-GrAdient SOlver for SVM
Shalev-Shwartz, S., Singer, Y., & Srebro, N. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273598 · Cited by 973
Andrieu, C., & Thoms, J. (2008) · Statistics and Computing · doi:10.1007/s11222-008-9110-y · Cited by 903
Optimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
Practical Lessons from Predicting Clicks on Ads at Facebook
He, X., Pan, J., Jin, O., Xu, T., Liu, B., Xu, T., Shi, Y., Atallah, A., Herbrich, R., Bowers, S., et al. (2014) · Proceedings of the Eighth International Workshop on Data Mining for Online Advertising · doi:10.1145/2648584.2648589 · Cited by 869
Task-Driven Dictionary Learning
Mairal, J., Bach, F., & Ponce, J. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.156 · Cited by 823
Learning Through Reinforcement and Replicator Dynamics
Börgers, T., & Sarin, R. (1997) · Journal of Economic Theory · doi:10.1006/jeth.1997.2319 · Cited by 737
Optimization with Sparsity-Inducing Penalties
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2025) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000015 · Cited by 730
Konda, V. R., & Tsitsiklis, J. N. (2003) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012901385691 · Cited by 709
Artificial Intelligence, Algorithmic Pricing, and Collusion
Calvano, E., Calzolari, G., Denicolò, V., & Pastorello, S. (2020) · American Economic Review · doi:10.1257/aer.20190623 · Cited by 708
Wireless Networks Design in the Era of Deep Learning: Model-Based, AI-Based, or Both?
Zappone, A., Di Renzo, M., & Debbah, M. (2019) · arXiv · doi:10.48550/arxiv.1902.02647 · Cited by 685
Wireless Networks Design in the Era of Deep Learning: Model-Based, AI-Based, or Both?
Zappone, A., Di Renzo, M., & Debbah, M. (2019) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2924010 · Cited by 684
FISM: factored item similarity models for top-N recommender systems
Kabbur, S., Ning, X., & Karypis, G. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487589 · Cited by 651
Minimum classification error rate methods for speech recognition
Juang, B.-H., Hou, W., & Lee, C.-H. (1997) · IEEE Transactions on Speech and Audio Processing · doi:10.1109/89.568732 · Cited by 618
Regression methods for pricing complex American-style options
Tsitsiklis, J. N., & Van Roy, B. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.935083 · Cited by 612
Optimization with Sparsity-Inducing Penalties
Bach, F. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985118 · Cited by 608
Mathematics for Machine Learning
Deisenroth, M. P., Faisal, A. A., & Ong, C. S. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108679930 · Cited by 573
On-line Learning and Stochastic Approximations
Bottou, L. (1999) · On-Line Learning in Neural Networks · doi:10.1017/cbo9780511569920.003 · Cited by 564
Membership Inference Attacks on Machine Learning: A Survey
Hu, H., Salcic, Z., Sun, L., Dobbie, G., Yu, P. S., & Zhang, X. (2022) · ACM Computing Surveys · doi:10.1145/3523273 · Cited by 564
Natural actor–critic algorithms
Bhatnagar, S., Sutton, R. S., Ghavamzadeh, M., & Lee, M. (2009) · Automatica · doi:10.1016/j.automatica.2009.07.008 · Cited by 559
Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
Besbes, O., & Zeevi, A. (2009) · Operations Research · doi:10.1287/opre.1080.0640 · Cited by 506
The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
Borkar, V. S., & Meyn, S. P. (2000) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012997331639 · Cited by 499
Kulis, B. (2013) · now publishers, Inc. eBooks · doi:10.1561/9781601986979 · Cited by 482
Gradient-Based Optimization of Hyperparameters
Bengio, Y. (2000) · Neural Computation · doi:10.1162/089976600300015187 · Cited by 466
Gradient Convergence in Gradient methods with Errors
Bertsekas, D. P., & Tsitsiklis, J. N. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623497331063 · Cited by 437
Adaptive stochastic approximation by the simultaneous perturbation method
Spall, J. C. (2000) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2000.880982 · Cited by 424
Forecasting exchange rates using feedforward and recurrent neural networks
Kuan, C., & Liu, T. (1995) · Journal of Applied Econometrics · doi:10.1002/jae.3950100403 · Cited by 428
An optimal method for stochastic composite optimization
Lan, G. (2012) · Mathematical Programming · doi:10.1007/s10107-010-0434-y · Cited by 427
Optimization via simulation: A review
Fu, M. C. (1994) · Annals of Operations Research · doi:10.1007/bf02136830 · Cited by 417
Dynamics of stochastic approximation algorithms
Benaïm, M. (1999) · Lecture Notes in Mathematics · doi:10.1007/bfb0096509 · Cited by 413
Huang, M., & Manton, J. H. (2009) · SIAM Journal on Control and Optimization · doi:10.1137/06067359x · Cited by 401
Memory neuron networks for identification and control of dynamical systems
Sastry, P. S., Santharam, G., & Unnikrishnan, K. P. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279193 · Cited by 363
The dropout learning algorithm
Baldi, P., & Sadowski, P. (2014) · Artificial Intelligence · doi:10.1016/j.artint.2014.02.004 · Cited by 340
Non-stationary stochastic optimization
Besbes, O., Gur, Y., & Zeevi, A. (2015) · Operations Research · doi:10.1287/opre.2015.1408 · Cited by 337
Particle Methods for Change Detection, System Identification, and Control
Andrieu, C., Doucet, A., Singh, S. S., & Tadic, V. B. (2004) · Proceedings of the IEEE · doi:10.1109/jproc.2003.823142 · Cited by 335
Tsitsiklis, J. N., & van Roy, B. (1999) · IEEE Transactions on Automatic Control · doi:10.1109/9.793723 · Cited by 326
Train faster, generalize better: Stability of stochastic gradient descent
Hardt, M., Recht, B., & Singer, Y. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.01240 · Cited by 323
High-dimensional Exploratory Item Factor Analysis by A Metropolis–Hastings Robbins–Monro Algorithm
Cai, L. (2010) · Psychometrika · doi:10.1007/s11336-009-9136-x · Cited by 323
Yoshida, W., Dolan, R. J., & Friston, K. J. (2008) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000254 · Cited by 322
Sastry, P. S., Phansalkar, V. V., & Thathachar, M. A. L. (1994) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.293490 · Cited by 320
Subspace-based fault detection algorithms for vibration monitoring
Basseville, M., Abdelghani, M., & Benveniste, A. (2000) · Automatica · doi:10.1016/s0005-1098(99)00093-x · Cited by 296
Self-citationOn the ergodicity properties of some adaptive MCMC algorithms
Andrieu, C., & Moulines, É. (2006) · The Annals of Applied Probability · doi:10.1214/105051606000000286 · Cited by 277
Gastaldi, X. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.07485 · Cited by 276
Schaul, T., Zhang, S., & LeCun, Y. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.1106 · Cited by 266
An Overview of Sequential Monte Carlo Methods for Parameter Estimation in General State-Space Models
Kantas, N., Doucet, A., Singh, S. S., & Maciejowski, J. M. (2009) · IFAC Proceedings Volumes · doi:10.3182/20090706-3-fr-2004.00129 · Cited by 265
Coupling a stochastic approximation version of EM with an MCMC procedure
Kuhn, E., & Lavielle, M. (2004) · ESAIM: Probability and Statistics · doi:10.1051/ps:2004007 · Cited by 262
Robust adaptive Metropolis algorithm with coerced acceptance rate
Vihola, M. (2012) · Statistics and Computing · doi:10.1007/s11222-011-9269-5 · Cited by 258
Hyperparameter ensembles for robustness and uncertainty quantification
Wenzel, F., Snoek, J., Tran, D., & Jenatton, R. (2020) · arXiv · doi:10.48550/arxiv.2006.13570 · Cited by 122
GossipGraD: Scalable Deep Learning using Gossip Communication based Asynchronous Gradient Descent
Daily, J., Vishnu, A., Siegel, C., Warfel, T., & Amatya, V. (2018) · arXiv · doi:10.48550/arxiv.1803.05880 · Cited by 80
Online Non-Negative Convolutive Pattern Learning for Speech Signals
Wang, D., Vipperla, R., Evans, N., & Zheng, T. F. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2222381 · Cited by 25
Convergence of stochastic-approximation-based algorithms for blind channel identification
Chen, H.-F., Cao, X.-R., & Zhu, J. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.995653 · Cited by 19
Badarla, V., & Murthy, C. S. R. (2011) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2010.12.012 · Cited by 12
“Approximating stochastic algorithms, such as CALA learning algorithmby anODE to understand its long-termbehavior is a well studied method in [4,19].”
MethodA novel learning based solution for efficient data transport in heterogeneous wireless networks
Badarla, V., & Siva Ram Murthy, C. (2010) · Wireless Networks · doi:10.1007/s11276-009-0228-4 · Cited by 6
Metadata
- Authors
- Benveniste, A., Métivier, M., & Priouret, P.
- Venue
- Springer eBooks
- Publisher
- Springer Berlin Heidelberg
- Published
- 1990
- OpenAlex
- W1568229137
- Cited by
- 2,006
- References
- 0
- FWCI
- 6.95
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.