微分積分:Calculus

Protected: Optimal arm identification and AB testing in the bandit problem_2

Optimal arm identification and AB testing in bandit problems utilized in digital transformation, artificial intelligence, and machine learning tasks sequential deletion policy, false positive rate, fixed confidence, fixed budget, LUCB policy, UCB policy, optimal arm, score-based method, LCB, algorithm, cumulative reward maximization, optimal arm identification policy, ε-optimal arm identification

2023.03.09

アルゴリズム:Algorithmsグラフ理論スパースモデリングバンディッド問題幾何学:Geometry微分積分:Calculus最適化:Optimization機械学習:Machine Learning確率・統計:Probability and Statistics線形代数:Linear Algebra

Protected: Statistical Mathematical Theory for Boosting

Statistical and mathematical theory boosting generalized linear model, modified Newton method, log likelihood, weighted least squares method, boosting, coordinate descent method, iteratively weighted least squares method, iteratively reweighted least squares method, IRLS method, weighted empirical discriminant error, parameter update law, Hessian matrix, corrected Newton method, Newton method, Newton method, iteratively reweighted least squares method, IRLS method) used for digital transformation, artificial intelligence, machine learning tasks. iteratively reweighted least square method, IRLS method, weighted empirical discriminant error, parameter update law, Hessian matrix, corrected Newton method, modified Newton method, Newton method, Newton method, link function, logistic loss, logistic loss, boosting algorithm, logit boost, exponential loss, convex margin loss, adaboost, weak hypothesis, empirical margin loss, nonlinear optimization

2023.03.08

アルゴリズム:Algorithmsスパースモデリング幾何学:Geometry微分積分:Calculus最適化:Optimization機械学習:Machine Learning確率・統計:Probability and Statistics線形代数:Linear Algebra

Protected: Quasi-Newton Methods as Sequential Optimization in Machine Learning (2)Quasi-Newton Methods with Memory Restriction

Quasi-Newton method with memory restriction (sparse clique factorization, sparse clique factorization, chordal graph, sparsity, secant condition, sparse Hessian matrix, DFP formula, BFGS formula, KL divergence, quasi-Newton method, maximal clique, positive definite matrix, positive definite matrix completion, positive define matrix composition, graph triangulation, complete subgraph, clique, Hessian matrix, triple diagonal matrix Hestenes-Stiefel method, L-BFGS method)

2023.03.07

アルゴリズム:Algorithmsスパースモデリング微分積分:Calculus最適化:Optimization機械学習:Machine Learning確率・統計:Probability and Statistics線形代数:Linear Algebra集合論:Set theory

Protected: An example of machine learning by Bayesian inference: inference by collapsed Gibbs sampling of a Poisson mixture model

Inference by collapsed Gibbs sampling of Poisson mixed models as an example of machine learning by Bayesian inference utilized in digital transformation, artificial intelligence, and machine learning tasks variational inference, Gibbs sampling, evaluation on artificial data, algorithms, prior distribution, gamma distribution, Bayes' theorem, Dirichlet distribution, categorical distribution, graphical models

2023.03.06

アルゴリズム:Algorithmsグラフ理論ベイズ推定幾何学:Geometry微分積分:Calculus最適化:Optimization機械学習:Machine Learning確率・統計:Probability and Statistics線形代数:Linear Algebra

Protected: Applying Neural Networks to Reinforcement Learning Applying Deep Learning to Strategy:Advanced Actor Critic (A2C)

Application of Neural Networks to Reinforcement Learning for Digital Transformation, Artificial Intelligence, and Machine Learning tasks Implementation of Advanced Actor Critic (A2C) applying deep learning to strategies (Policy Gradient method, Q-learning, Gumbel Max Trix, A3C (Asynchronous Advantage Actor Critic))

2023.03.02

アルゴリズム:Algorithmsグラフ理論スパースモデリング幾何学:Geometry強化学習微分積分:Calculus最適化:Optimization機械学習:Machine Learning深層学習:Deep Learning確率・統計:Probability and Statistics線形代数:Linear Algebra

Protected: Implementation of recommendation algorithm using Clojure/Mahout

Implementation of recommendation algorithms using Clojure/Mahout for digital transformation, artificial intelligence, and machine learning tasks information retrieval statistics, precision, recall, DCG, IDCG, Ideal Discounted Cumulative Gain, Discounted Cumulative Gain, Discounted Cumulative Gain, fall-out, F-measure, harmonic mean, RMSE, k-nearest neighbor method, Pearson correlation, Spearman's rank correlation coefficient, Pearson correlation similarity, similarity measure Jaccard distance, Euclidean distance, cosine distance, pairwise differences, item-based, user-based

2023.03.01

Clojureアルゴリズム:Algorithmsグラフ理論微分積分:Calculus最適化:Optimization機械学習:Machine Learning確率・統計:Probability and Statistics線形代数:Linear Algebra

Protected: Optimal arm identification and A/B testing in the bandit problem_1

Optimal arm identification and A/B testing in bandit problems for digital transformation, artificial intelligence, and machine learning tasks Heffding's inequality, optimal arm identification, sample complexity, sample complexity, riglet minimization, cumulative riglet minimization, cumulative reward maximization, ε-optimal arm identification, simple riglet minimization, ε-best arm identification, KL-UCB strategy, KL divergence) cumulative reward maximization, ε-optimal arm identification, simple liglet minimization, ε-best arm identification, KL-UCB strategy, KL divergence, A/B testing of the normal distribution, fixed confidence, fixed confidence

2023.02.24

アルゴリズム:Algorithmsグラフ理論バンディッド問題幾何学:Geometry微分積分:Calculus最適化:Optimization機械学習:Machine Learning確率・統計:Probability and Statistics線形代数:Linear Algebra集合論:Set theory

Protected: Overview of nu-Support Vector Machines by Statistical Mathematics Theory

Overview of nu-support vector machines by statistical mathematics theory utilized in digital transformation, artificial intelligence, and machine learning tasks (kernel functions, boundedness, empirical margin discriminant error, models without bias terms, reproducing nuclear Hilbert spaces, prediction discriminant error, uniform bounds Statistical Consistency, C-Support Vector Machines, Correspondence, Statistical Model Degrees of Freedom, Dual Problem, Gradient Descent, Minimum Distance Problem, Discriminant Bounds, Geometric Interpretation, Binary Discriminant, Experience Margin Discriminant Error, Experience Discriminant Error, Regularization Parameter, Minimax Theorem, Gram Matrix, Lagrangian Function).

2023.02.23

アルゴリズム:Algorithmsグラフ理論スパースモデリング幾何学:Geometry微分積分:Calculus最適化:Optimization機械学習:Machine Learning確率・統計:Probability and Statistics線形代数:Linear Algebra集合論:Set theory

Protected: Stochastic coordinate descent as a distributed process for batch stochastic optimization

Stochastic coordinate descent as a distributed process for batch stochastic optimization utilized in digital transformation, artificial intelligence, and machine learning tasks (COCOA, convergence rate, SDCA, γf-smooth, approximate solution of subproblems, stochastic coordinate descent, parallel stochastic coordinate descent, parallel computing process, Communication-Efficient Coordinate Ascent, dual coordinate descent)

2023.02.22

アルゴリズム:Algorithmsグラフ理論スパースモデリング幾何学:Geometry微分積分:Calculus最適化:Optimization機械学習:Machine Learning確率・統計:Probability and Statistics線形代数:Linear Algebra

Protected: Quasi-Newton Method as Sequential Optimization in Machine Learning(1) Algorithm Overview

Quasi-Newton methods as continuous machine learning optimization for digital transformation, artificial intelligence, and machine learning tasks (BFGS formulas, Lagrange multipliers, optimality conditions, convex optimization problems, KL divergence minimization, equality constrained optimization problems, DFG formulas, positive definite matrices, geometric structures, secant conditions, update laws for quasi-Newton methods, Hesse matrices, optimization algorithms, search directions, Newton methods)

2023.02.21

アルゴリズム:Algorithms微分積分:Calculus最適化:Optimization機械学習:Machine Learning確率・統計:Probability and Statistics線形代数:Linear Algebra集合論:Set theory