Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithmic Learning Theory [[electronic resource] ] : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, Proceedings / / edited by Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann
| Algorithmic Learning Theory [[electronic resource] ] : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, Proceedings / / edited by Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 397 p. 30 illus.) |
| Disciplina | 006.31 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Algorithms Computers Computer logic Pattern recognition Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs Pattern Recognition |
| ISBN | 3-642-40935-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Editors’ Introduction -- Learning and Optimizing with Preferences -- Efficient Algorithms for Combinatorial Online Prediction -- Exact Learning from Membership Queries: Some Techniques, Results and New Directions -- Online Learning Universal Algorithm for Trading in Stock Market Based on the Method of Calibration -- Combinatorial Online Prediction via Metarounding -- On Competitive Recommendations -- Online PCA with Optimal Regrets -- Inductive Inference and Grammatical Inference Partial Learning of Recursively Enumerable Languages -- Topological Separations in Inductive Inference -- PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data -- Universal Knowledge-Seeking Agents for Stochastic Environments -- Teaching and Learning from Queries Order Compression Schemes -- Learning a Bounded-Degree Tree Using Separator Queries -- Faster Hoeffding Racing: Bernstein Races via Jackknife Estimates -- Robust Risk-Averse Stochastic Multi-armed Bandits -- An Efficient Algorithm for Learning with Semi-bandit Feedback -- Differentially-Private Learning of Low Dimensional Manifolds -- Generalization and Robustness of Batched Weighted Average Algorithm with V-Geometrically Ergodic Markov Data -- Adaptive Metric Dimensionality Reduction -- Dimension-Adaptive Bounds on Compressive FLD Classification -- Bayesian Methods for Low-Rank Matrix Estimation: Short Survey and Theoretical Study -- Concentration and Confidence for Discrete Bayesian Sequence Predictors -- Algorithmic Connections between Active Learning and Stochastic Convex Optimization -- Unsupervised/Semi-Supervised Learning Unsupervised Model-Free Representation Learning -- Fast Spectral Clustering via the Nyström Method -- Nonparametric Multiple Change Point Estimation in Highly Dependent Time Series. |
| Record Nr. | UNISA-996465423903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, Proceedings / / edited by Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann
| Algorithmic Learning Theory : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, Proceedings / / edited by Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 397 p. 30 illus.) |
| Disciplina | 006.31 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Logic, Symbolic and mathematical Algorithms Computers Computer logic Pattern perception Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs Pattern Recognition |
| ISBN | 3-642-40935-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Editors’ Introduction -- Learning and Optimizing with Preferences -- Efficient Algorithms for Combinatorial Online Prediction -- Exact Learning from Membership Queries: Some Techniques, Results and New Directions -- Online Learning Universal Algorithm for Trading in Stock Market Based on the Method of Calibration -- Combinatorial Online Prediction via Metarounding -- On Competitive Recommendations -- Online PCA with Optimal Regrets -- Inductive Inference and Grammatical Inference Partial Learning of Recursively Enumerable Languages -- Topological Separations in Inductive Inference -- PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data -- Universal Knowledge-Seeking Agents for Stochastic Environments -- Teaching and Learning from Queries Order Compression Schemes -- Learning a Bounded-Degree Tree Using Separator Queries -- Faster Hoeffding Racing: Bernstein Races via Jackknife Estimates -- Robust Risk-Averse Stochastic Multi-armed Bandits -- An Efficient Algorithm for Learning with Semi-bandit Feedback -- Differentially-Private Learning of Low Dimensional Manifolds -- Generalization and Robustness of Batched Weighted Average Algorithm with V-Geometrically Ergodic Markov Data -- Adaptive Metric Dimensionality Reduction -- Dimension-Adaptive Bounds on Compressive FLD Classification -- Bayesian Methods for Low-Rank Matrix Estimation: Short Survey and Theoretical Study -- Concentration and Confidence for Discrete Bayesian Sequence Predictors -- Algorithmic Connections between Active Learning and Stochastic Convex Optimization -- Unsupervised/Semi-Supervised Learning Unsupervised Model-Free Representation Learning -- Fast Spectral Clustering via the Nyström Method -- Nonparametric Multiple Change Point Estimation in Highly Dependent Time Series. |
| Record Nr. | UNINA-9910484834203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Recent Advances in Reinforcement Learning [[electronic resource] ] : 8th European Workshop, EWRL 2008, Villeneuve d'Ascq, France, June 30-July 3, 2008, Revised and Selected Papers / / edited by Sertan Girgin, Manuel Loth, Rémi Munos, Philippe Preux, Daniil Ryabko
| Recent Advances in Reinforcement Learning [[electronic resource] ] : 8th European Workshop, EWRL 2008, Villeneuve d'Ascq, France, June 30-July 3, 2008, Revised and Selected Papers / / edited by Sertan Girgin, Manuel Loth, Rémi Munos, Philippe Preux, Daniil Ryabko |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XII, 283 p.) |
| Disciplina | 006.3/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer programming Computers Application software Database management Artificial Intelligence Programming Techniques Theory of Computation Computation by Abstract Devices Information Systems Applications (incl. Internet) Database Management |
| ISBN | 3-540-89722-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lazy Planning under Uncertainty by Optimizing Decisions on an Ensemble of Incomplete Disturbance Trees -- Exploiting Additive Structure in Factored MDPs for Reinforcement Learning -- Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration -- Efficient Reinforcement Learning in Parameterized Models: Discrete Parameter Case -- Regularized Fitted Q-Iteration: Application to Planning -- A Near Optimal Policy for Channel Allocation in Cognitive Radio -- Evaluation of Batch-Mode Reinforcement Learning Methods for Solving DEC-MDPs with Changing Action Sets -- Bayesian Reward Filtering -- Basis Expansion in Natural Actor Critic Methods -- Reinforcement Learning with the Use of Costly Features -- Variable Metric Reinforcement Learning Methods Applied to the Noisy Mountain Car Problem -- Optimistic Planning of Deterministic Systems -- Policy Iteration for Learning an Exercise Policy for American Options -- Tile Coding Based on Hyperplane Tiles -- Use of Reinforcement Learning in Two Real Applications -- Applications of Reinforcement Learning to Structured Prediction -- Policy Learning – A Unified Perspective with Applications in Robotics -- Probabilistic Inference for Fast Learning in Control -- United We Stand: Population Based Methods for Solving Unknown POMDPs -- New Error Bounds for Approximations from Projected Linear Equations -- Markov Decision Processes with Arbitrary Reward Processes. |
| Record Nr. | UNISA-996466337803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||