Books

Benefits of Studying This Book 1. Deep Conceptual Understanding You will understand why AI algorithms work, not just how to run them. This allows you to innovate, debug, and improve models. 2. Career Advantage Strong mathematical foundations make you stand out in interviews for AI, ML, and DS roles. Many recruiters test candidates on linear algebra and probability skills. 3. Research Readiness Postgraduate students and researchers can directly apply these mathematical tools to design and analyze experiments. 4. Practical AI Skills Python-based implementation examples ensure that you can directly apply mathematical concepts in real-world AI systems. 5. Interdisciplinary Edge Mathematics learned here is not limited to AI — it can be applied in robotics, quantum computing, finance, bioinformatics, and more. How This Book Helps After StudyAfter completing this book, you will be able to:·        Build AI models from scratch, knowing exactly what mathematical operations are happening inside.·        Optimize models for performance using a deep understanding of linear algebra operations.·        Analyze and interpret model predictions probabilistically.·        Handle uncertainty and noise in datasets effectively.·        Implement advanced AI concepts like PCA, SVD, Bayesian inference, and Markov models without relying solely on pre-built libraries.This knowledge will directly help in:·        Academics: Scoring well in AI/ML/DS university courses.·        Industry: Working as an AI engineer, data scientist, ML engineer, or research scientist.·        Competitive Exams: Preparing for GATE, NET, and other AI-related exams where mathematics is heavily tested.·        Research: Publishing papers where mathematical rigor is required to explain new AI techniques. 

WHO SHOULD READ THIS BOOK?This book is ideal for:·        BCA, MCA, B.Tech, M.Tech students·        UGC NET aspirants·        AI/ML researchers·        Data scientists·        AI developers·        University professors·        PhD scholars·        Industry professionals working with black-box models·        Anyone who wants mathematical clarity on XAIIts writing style balances mathematical rigor with readability, making it useful for self-study and classroom use. TEACHING & LEARNING BENEFITS·        50+ diagrams, proofs, and mathematical derivations.·        Step-by-step logical flow for each model.·        Case studies from healthcare, finance, law, and engineering.·        Practical coding references (without over-reliance on tools).·        Integration of statistics, calculus, causality, and deep learning.·        Real-world examples for intuitive understanding.·        Problems at the end of each chapter (optional addition).Instructors can adopt this book for academic courses in:·        Explainable AI·        Machine Learning·        Statistical Inference·        Causality·        Artificial Intelligence Foundations·        Deep Learning Interpretability UNIQUE CONTRIBUTIONS OF THIS BOOKUnlike other XAI or ML books, this work by Anshuman Mishra offers:·        Mathematical derivations for SHAP, IG, LIME, and other explainability tools.·        Original proofs for fairness properties in attribution methods.·        Detailed causal diagrams and do-calculus explanations.·        A structured approach to XAI evaluation metrics.·        Coverage of transformer explainability—rare in academic books.·        Clarity in blending classical mathematical theory with modern AI systems.This makes the book a reference-level resource for the next decade of AI learning.

4. Who Should Read This Book?This book is specially designed for a wide audience:4.1 StudentsStudents of:Artificial intelligenceData scienceComputer scienceInformation technologyOperations researchApplied mathematicswill find this book essential for understanding foundations and applications of intelligent decision-making.4.2 ResearchersThis book helps researchers explore:Decision-making modelsPlanning algorithmsRisk-aware AIMathematical modelingOptimization under uncertaintyIt helps form a strong base for research projects and PhD work.4.3 Industry ProfessionalsEngineers and developers working on:RoboticsAutonomous vehiclesDecision support systemsPredictive analyticsAI toolsFinancial modelingwill find the algorithms, pseudocode, and frameworks highly practical.4.4 Faculty MembersTeachers and professors can use this book as:A primary textbookA reference guideA source of problems and case studiesA foundation for graduate and research courses 5. Learning OutcomesAfter studying this book, readers will be able to:Understand and construct utility functionsEvaluate rational choices under uncertaintyBuild decision treesConstruct influence diagramsDesign sequential decision systemsFormulate and solve MDPsApply POMDPs to real problemsImplement classical planning algorithmsModel multi-agent interactions using game theoryApply Bayesian decision theory to uncertain environmentsUnderstand the foundation of reinforcement learningBuild real-world decision and planning systemsThis ensures comprehensive mastery of both theory and practice.

Most enterprise LLM deployments fail not at the demo stage — but at scale. This book gives AI architects and engineering leaders the cost models, architecture patterns, and fine-tuning frameworks to run LLMs reliably in production, sized for your actual organization.

Escrito por um líder de engenharia que constrói sistemas de IA em escala, este playbook traduz o que realmente está acontecendo por trás do hype em decisões que você pode tomar hoje. 18 capítulos cobrindo fundamentos de IA, aplicações de negócio, avaliação de fornecedores, segurança, governança e seu plano de ação de 90 dias. Sem código, sem jargão.

Written by an engineering leader who builds AI systems at scale, this playbook translates what's really happening behind the hype into decisions you can make today. 18 chapters covering AI fundamentals, business applications, vendor evaluation, security, governance, and your 90-day action plan. No code, no jargon — just clarity.

Guia prático para desenvolvimento agêntico com Claude Code, MCP, Claude API e Agent SDK. De modelos mentais a arquiteturas de produção — tudo que um dev experiente precisa para trabalhar de forma agêntica, não apenas usar ferramentas de IA.

A hands-on guide to building with Claude Code, MCP, the Claude API, and the Agent SDK. From mental models to production architectures — everything an experienced developer needs to work agentically, not just use AI tools.

You already know how to build a Spring Boot service. Controllers, services, repositories, tests—it’s muscle memory. But what happens when your product manager asks for “an AI assistant” instead of “another REST endpoint”?Spring Boot Meets AI shows you how to plug modern AI models into the Spring applications you’re already running, using Spring AI’s fluent clients and Boot starters. You’ll go from zero to “curlable” AI endpoints in a few lines of code, then build up to real features: chat, summarisation, data extraction into POJOs, RAG over your own docs, and AI workflows that can safely call your own Java code.No new language. No separate AI microservice nobody wants to maintain. Just Spring Boot, Spring AI, and a set of patterns you can take back to work on Monday

After more than twenty years at IBM — including roles as Regional Technical Leader for Security Technologies and Tivoli Software across Central and Eastern Europe — I have seen many SOC modernization projects. Organizations consistently face the same dilemma: substantial existing investments in SIEM, SOAR, processes, and human expertise versus the urgent need to keep pace with AI-powered threats.Most vendors pushed rip-and-replace cloud solutions. I took a different path.The Brownfield Agentic SOC concept was born from the realization that modernization does not require replacement. It is possible — and often far more effective — to intelligently augment existing infrastructure with multi-level AI agents, dynamic business context, structured investigation, and strong governance, while preserving data sovereignty and human judgment.This book is intentionally practical and conceptual. Certain advanced techniques (self-healing patterns, zero-visible-downtime adaptation, tamper-evident intelligent audit) are subject to pending patent protection and are presented here at architectural level only.I wrote this book for three audiences:CISOs and SOC leaders in regulated industries seeking realistic modernizationSecurity architects responsible for next-generation operationsTeams that prioritize sovereignty, compliance, and human-AI collaborationMy goal is to provide a clear, actionable blueprint that respects real-world constraints while delivering measurable improvement.I hope this book inspires and equips you to build more resilient, intelligent, and sovereign Security Operations Centers.Zsolt L. Kocsis, M.Sc., MBA Associate Professor honoris causa Budapest University of Technology and Economics (BME) May 2026

Part VIII — Mathematical AppendicesTo support learning, the book includes:Optimization methodsProbability referencePseudocode for all algorithmsReal-world datasets and examplesThis makes the book self-contained for academic courses and self-study. 4. Who Should Read This Book?This book is specially designed for a wide audience:4.1 StudentsStudents of:Artificial intelligenceData scienceComputer scienceInformation technologyOperations researchApplied mathematicswill find this book essential for understanding foundations and applications of intelligent decision-making.4.2 ResearchersThis book helps researchers explore:Decision-making modelsPlanning algorithmsRisk-aware AIMathematical modelingOptimization under uncertaintyIt helps form a strong base for research projects and PhD work.4.3 Industry ProfessionalsEngineers and developers working on:RoboticsAutonomous vehiclesDecision support systemsPredictive analyticsAI toolsFinancial modelingwill find the algorithms, pseudocode, and frameworks highly practical.4.4 Faculty MembersTeachers and professors can use this book as:A primary textbookA reference guideA source of problems and case studiesA foundation for graduate and research courses 5. Learning OutcomesAfter studying this book, readers will be able to:Understand and construct utility functionsEvaluate rational choices under uncertaintyBuild decision treesConstruct influence diagramsDesign sequential decision systemsFormulate and solve MDPsApply POMDPs to real problemsImplement classical planning algorithmsModel multi-agent interactions using game theoryApply Bayesian decision theory to uncertain environmentsUnderstand the foundation of reinforcement learningBuild real-world decision and planning systemsThis ensures comprehensive mastery of both theory and practice.

Pedagogical Features To ensure clarity and academic depth, each chapter includes:·        Conceptual Explanation: Theoretical context and motivation·        Mathematical Derivation: Step-by-step proofs and equations·        Algorithm Design: Pseudocode for each major algorithm·        Numerical Examples: Solved problems for classroom and self-practice·        Visual Illustrations: Graphical understanding of value functions and convergence·        Exercises and Research Notes: For deeper investigationThis structure makes the book equally useful for students learning the subject, teachers designing course material, and researchers developing new models. Why This Book Is Unique 1.      Mathematical Depth: Every equation is derived and explained, not merely presented.2.      Pedagogical Precision: Structured for both classroom teaching and independent study.3.      Balanced Approach: Covers both classical RL (Bellman, DP, Q-learning) and modern RL (DQN, PPO, Actor-Critic).4.      Research Orientation: Provides open problems, mathematical proofs, and advanced theoretical questions.5.      Language Clarity: Written in simple, academic English with minimal jargon.While most books treat RL as a subset of machine learning, this book presents RL as a pure mathematical science of decision-making under uncertainty.

Mathematics of Reinforcement Learning: From Bellman Equations to Q-Learning  VOL-1 A Mathematical Journey through Dynamic Programming and Optimal Decision-Making Author: Anshuman Mishra, M.Tech (Computer Science) Assistant Professor, Doranda College, Ranchi University  COPYRIGHT PAGE© 2025 Anshuman Mishra, M.Tech (Computer Science) All rights reserved.No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means—electronic, mechanical, photocopying, recording, or otherwise—without the prior written permission of the author or publisher, except for brief quotations used in reviews, academic references, or scholarly works.First Edition: 2025 DISCLAIMER This book is designed to provide academic and research-based knowledge on Mathematics of Reinforcement Learning, including the principles of dynamic programming, Bellman equations, Q-learning, and related computational models. The information contained herein is intended solely for educational purposes for students, teachers, and researchers in computer science, mathematics, and artificial intelligence.While every effort has been made to ensure the accuracy of the contents, the author and publisher make no representations or warranties with respect to the accuracy or completeness of the contents of this book. The examples, algorithms, and derivations have been thoroughly checked, but errors may still exist. The author and publisher shall not be liable for any damages arising from the use of the material contained herein.The mathematical examples and algorithms are for educational and illustrative purposes only. Readers implementing algorithms for research or practical projects are encouraged to verify results independently and consult additional resources as needed.All trademarks, trade names, or logos mentioned belong to their respective owners. Any resemblance of examples or case studies to actual data, individuals, or organizations is purely coincidental.  BOOK DESCRIPTION Title: Mathematics of Reinforcement Learning: From Bellman Equations to Q-Learning  VOL-1 Subtitle: A Mathematical Journey through Dynamic Programming and Optimal Decision-Making Author: Anshuman Mishra, M.Tech (Computer Science) Assistant Professor, Doranda College, Ranchi University About the Book The 21st century marks a revolutionary transformation in artificial intelligence (AI), where machines are not only learning from data but are also learning how to act intelligently in dynamic environments. Among the various branches of AI, Reinforcement Learning (RL) stands as the mathematical and conceptual foundation that allows computers and robots to make autonomous decisions through trial and reward.This book, Mathematics of Reinforcement Learning, serves as a bridge between mathematical theory and practical algorithms, enabling readers to deeply understand the mathematical intuition behind learning systems that think, adapt, and optimize behavior.Unlike traditional AI books that focus only on algorithmic implementation, this book unfolds the complete mathematical foundation—from Bellman equations and dynamic programming to Monte Carlo methods, temporal-difference learning, and Q-learning. Each topic is mathematically derived, systematically explained, and complemented with step-by-step numerical examples and proofs.This book is written specifically for:·        Undergraduate and postgraduate students (B.Tech, BCA, MCA, M.Sc. AI, Data Science)·        Teachers and researchers in artificial intelligence and applied mathematics·        Industry professionals and developers seeking deeper theoretical clarity in RL Philosophy Behind the Book Most introductory books on reinforcement learning explain algorithms but rarely delve into why these algorithms work or how their mathematical properties guarantee convergence, stability, and optimality. This book aims to unveil the mathematics that drives intelligence, presenting reinforcement learning not as a set of black-box algorithms but as a beautifully structured mathematical framework grounded in linear algebra, probability, optimization, and dynamic programming.Each chapter begins with fundamental theory and builds toward algorithmic application, showing how every step—from expectation computation to Bellman optimization—can be rigorously formulated using mathematical logic.The goal is to empower readers to not only use reinforcement learning but to understand and innovate upon it. Structure and Organization This book is divided into seven modules and twenty comprehensive chapters, organized in an intuitive learning sequence. Module I: Foundations of Reinforcement Learning It begins with the basic building blocks—agents, environments, states, actions, and rewards—and introduces readers to the concept of learning through interaction. Chapters 1 to 3 explore:·        The mathematical definitions of Markov Processes and Decision Models·        The essential linear algebra and probability theory underlying reinforcement learning·        The formal structure of Markov Decision Processes (MDPs) and Bellman equationsBy the end of this module, the reader understands the theoretical backbone of RL, paving the way for algorithmic exploration. Module II: Bellman Equations and Dynamic Programming Here, the mathematics of optimality takes center stage. The Bellman equations are explored in full depth—both expectation and optimality formulations—along with proofs of convergence and computational methods.Dynamic programming methods such as policy evaluation, policy iteration, and value iteration are introduced with complete derivations and worked-out numerical examples. The connection between dynamic programming and reinforcement learning is clearly established, showing how each step in the algorithm emerges from a recursive mathematical structure. Module III: Monte Carlo and Temporal-Difference Learning This module blends probability, sampling, and prediction. It explains how learning can happen from experience through Monte Carlo estimation and Temporal Difference (TD) learning. Readers learn the relationships between bias, variance, convergence speed, and data efficiency. The transition from offline to online learning is demonstrated through examples like the Blackjack problem and Random Walk prediction.Eligibility traces and TD(λ) methods are explained rigorously with mathematical equivalence proofs, bridging theory with implementation. Module IV: Control Algorithms — From Sarsa to Q-Learning The heart of reinforcement learning—learning to control—is covered in this section. Starting with on-policy control (Sarsa) and progressing to off-policy control (Q-Learning), readers explore the mathematical mechanisms that enable agents to learn optimal strategies.The derivation of the Q-learning update rule from the Bellman optimality principle is shown step-by-step, providing a strong conceptual understanding of how agents converge to optimal policies. Comparisons between different approaches (Sarsa, Expected Sarsa, and Q-Learning) are backed with numerical and graphical examples.    Module V: Advanced Mathematical Tools and Extensions At this point, the book transitions from classical reinforcement learning to advanced formulations. Topics include:·        Policy Gradient Theorem and its derivation·        Actor-Critic architecture with detailed gradient calculations·        Regularization and constrained optimization for safe and stable learning·        Entropy and KL-Divergence based formulations for robust policy optimizationReaders are introduced to Lagrangian optimization in RL, showing how constraints can be mathematically imposed to ensure balanced exploration and exploitation. Module VI: Deep and Approximate Reinforcement Learning This section connects traditional reinforcement learning to deep neural networks and function approximation. The mathematical underpinnings of Deep Q-Networks (DQN) are derived, explaining loss functions, gradient backpropagation, and the role of target networks.Advanced architectures such as Double DQN, Dueling Networks, Prioritized Replay, and Proximal Policy Optimization (PPO) are also presented with mathematical clarity. Through carefully designed examples, the book shows how deep learning integrates with reinforcement learning, resulting in modern AI systems like AlphaGo and autonomous robots. Module VII: Theoretical and Research Perspectives The final section consolidates all mathematical insights, focusing on proofs, convergence theorems, and future research directions. It contains:·        Rigorous proofs of TD and Q-learning convergence·        Stability analysis using stochastic approximation theory·        Exploration of open challenges such as safe RL, explainable RL, and quantum RLThis section encourages teachers and researchers to extend the theoretical boundaries of reinforcement learning. Pedagogical Features To ensure clarity and academic depth, each chapter includes:·        Conceptual Explanation: Theoretical context and motivation·        Mathematical Derivation: Step-by-step proofs and equations·        Algorithm Design: Pseudocode for each major algorithm·        Numerical Examples: Solved problems for classroom and self-practice·        Visual Illustrations: Graphical understanding of value functions and convergence·        Exercises and Research Notes: For deeper investigationThis structure makes the book equally useful for students learning the subject, teachers designing course material, and researchers developing new models. Why This Book Is Unique 1.      Mathematical Depth: Every equation is derived and explained, not merely presented.2.      Pedagogical Precision: Structured for both classroom teaching and independent study.3.      Balanced Approach: Covers both classical RL (Bellman, DP, Q-learning) and modern RL (DQN, PPO, Actor-Critic).4.      Research Orientation: Provides open problems, mathematical proofs, and advanced theoretical questions.5.      Language Clarity: Written in simple, academic English with minimal jargon.While most books treat RL as a subset of machine learning, this book presents RL as a pure mathematical science of decision-making under uncertainty.

As the author, I (Anshuman Mishra) have written this book with the spirit of mentorship — not just to explain how chatbots work, but to help you build one confidently and ethically. I have taught AI, programming, and computer science for nearly two decades, and I have seen countless students struggle to bridge the gap between theory and implementation.This book closes that gap. It teaches you what to do, why to do it, and how to do it right. It’s not just a manual — it’s a journey from curiosity to mastery.You are not just learning to build a chatbot; you are learning to create intelligence — responsibly, creatively, and with purpose.

As the author, I (Anshuman Mishra) have written this book with the spirit of mentorship — not just to explain how chatbots work, but to help you build one confidently and ethically. I have taught AI, programming, and computer science for nearly two decades, and I have seen countless students struggle to bridge the gap between theory and implementation.This book closes that gap. It teaches you what to do, why to do it, and how to do it right. It’s not just a manual — it’s a journey from curiosity to mastery.You are not just learning to build a chatbot; you are learning to create intelligence — responsibly, creatively, and with purpose.