• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2010 Fiscal Year Final Research Report

Learning non-linear concepts based on random projection

Research Project

  • PDF
Project/Area Number 20500001
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Fundamental theory of informatics
Research InstitutionKyushu University

Principal Investigator

TAKIMOTO Eiji  Kyushu University, 大学院・システム情報科学研究院, 教授 (50236395)

Project Period (FY) 2008 – 2010
Keywords計算学習理論 / ブースティング / マージン最大化 / ランキング学習 / オンライン予測 / エネルギー複雑度 / 論理式複雑さ
Research Abstract

We investigate new schema for learning non-linear concepts by combining random projection with linear classifiers. In particular, we show that a boosting algorithm naturally results in our learning scheme, where the algorithm randomly chooses appropriate rules in a given rule class and produces as a final hypothesis a linear combination of them. On the other hand, we give lower bounds on the complexity of constant depth threshold circuits, which serve the most natural hypothesis class for our learning schema. The bounds imply theoretical limitations for our shema.

  • Research Products

    (29 results)

All 2011 2010 2009 2008 Other

All Journal Article (11 results) Presentation (16 results) Book (1 results) Remarks (1 results)

  • [Journal Article] Size-energy tradeoffs for unate circuits omputing symmetric Boolean functions2011

    • Author(s)
      Kei Uchizawa, Eiji Takimoto, Takao Nishizeki
    • Journal Title

      Theoretical Computer Science 412

      Pages: 773-782

  • [Journal Article] Energy and depth of threshold circuits2010

    • Author(s)
      Kei Uchizawa, Takao Nishizeki, Eiji Takimoto
    • Journal Title

      Theoretical Computer Science 411

      Pages: 3938-3946

  • [Journal Article] NPN-representatives of a Set of Optimal Boolean Formulas, IEICE Transactions on Fundamentals of Electronics2010

    • Author(s)
      Hideaki Fukuhara, Eiji Takimoto, Kazuyuki Amano
    • Journal Title

      Communications and Computer Sciences E-93A,6

      Pages: 1008-1015

  • [Journal Article] Lower Bounds on Quantum Query Complexity for Read-once Formulas with XOR and MUX Operators2010

    • Author(s)
      Hideaki Fukuhara, Eiji Takimoto
    • Journal Title

      IEICE Transactions on Information and Systems E-93D,2

      Pages: 280-289

  • [Journal Article] Linear Programming Boosting by Column and Row Generation2009

    • Author(s)
      Kohei Hatano, Eiji Takimoto
    • Journal Title

      Lecture Notes on Artificial Intelligence 5808

      Pages: 401-408

  • [Journal Article] Energy Complexity and Depth of Threshold Circuits2009

    • Author(s)
      Kei Uchizawa, Takao Nishizeki, Eiji Takimoto
    • Journal Title

      Lecture Notes on Computer Science 5699

      Pages: 335-345

  • [Journal Article] Size and Energy of Threshold Circuits Computing Mod Functions2009

    • Author(s)
      Kei Uchizawa, Takao Nishizeki, Eiji Takimoto
    • Journal Title

      Lecture Notes on Computer Science 5734

      Pages: 724-735

  • [Journal Article] Lower bounds on quantum query complexity for read-once decision trees with parity nodes, Theory of Computing 2009. Proc Fifteenth Computing : The Australasian Theory Symposium (CATS 2009)2009

    • Author(s)
      Hideaki Fukuhara, Eiji Takimoto
    • Journal Title

      CRPIT 94

      Pages: 474-487

  • [Journal Article] Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity2008

    • Author(s)
      Kei Uchizawa, Eiji Takimoto
    • Journal Title

      Theoretical Computer Science 407(1-3)

      Pages: 474-487

  • [Journal Article] Smooth Boosting for Margin-Based Ranking2008

    • Author(s)
      Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, Masayuki Takeda
    • Journal Title

      Lecture Notes on Artificial Inteeligence 5254

      Pages: 227-239

  • [Journal Article] Monotone DNF Formula that has a Minimal or Maximal Number of Satisfying Assignments2008

    • Author(s)
      Takayuki Sato, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka
    • Journal Title

      Lecture Notes on Computer Science 5092

      Pages: 191-203

  • [Presentation] Online Prediction over Permutahedron2011

    • Author(s)
      安武翔太
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      琉球大学
    • Year and Date
      2011-03-07
  • [Presentation] 確率的評価値をもつゲーム木における最善手探索2011

    • Author(s)
      奥山洋平
    • Organizer
      冬のLAシンポジウム
    • Place of Presentation
      京都大学
    • Year and Date
      2011-02-02
  • [Presentation] カーネル法を用いたコンピュータ将棋の評価関数の学習2010

    • Author(s)
      末廣大貴
    • Organizer
      第15回ゲームプログラミングワークショップ(GPW-10)
    • Place of Presentation
      箱根セミナーハウス
    • Year and Date
      2010-11-12
  • [Presentation] オンラインランク統合問題2010

    • Author(s)
      安武翔太
    • Organizer
      第13回情報論的学習理論ワークショップ(IBIS 2010)
    • Place of Presentation
      東京大学
    • Year and Date
      2010-11-05
  • [Presentation] SVMによるバイパータイトランキング学習を用いたコンピュータ将棋における評価関数の学習2010

    • Author(s)
      末廣大貴
    • Organizer
      第13回情報論的学習理論ワークショップ(IBIS 2010)
    • Place of Presentation
      東京大学
    • Year and Date
      2010-11-04
  • [Presentation] Online rank aggregation2010

    • Author(s)
      安武翔太
    • Organizer
      第9回情報科学技術フォーラム(FIT 2010)
    • Place of Presentation
      九州大学
    • Year and Date
      2010-09-09
  • [Presentation] Size and Energy of Unate Circuits Computing Symmetric Boolean Functions2010

    • Author(s)
      内沢啓
    • Organizer
      The 13th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2010)
    • Place of Presentation
      金沢市文化ホール
    • Year and Date
      2010-07-23
  • [Presentation] 重みつき窓を用いた適応型オンライン予測2010

    • Author(s)
      吉田真一
    • Organizer
      人工知能学会データマイニングと統計数理研究会
    • Place of Presentation
      統計数理研究所
    • Year and Date
      2010-03-30
  • [Presentation] Size-Energy Tradeoff of Unate Circuits Computing Symmetric Functions2010

    • Author(s)
      内沢啓
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      九州大学
    • Year and Date
      2010-01-25
  • [Presentation] 行と列の生成による線形計画ブースティング2009

    • Author(s)
      畑埜晃平
    • Organizer
      第12回情報論的学習理論ワークショップ(IBIS 2009)
    • Place of Presentation
      九州大学
    • Year and Date
      2009-10-19
  • [Presentation] 長方形分割数に対する緩和による論理式のサイズの下界2009

    • Author(s)
      福原秀明
    • Organizer
      夏のLAシンポジウム
    • Place of Presentation
      かんぽの宿松嶋
    • Year and Date
      2009-07-22
  • [Presentation] Lower Bounds on Quantum Query Complexity for Read-once Formulas with XOR and MUX Operators2009

    • Author(s)
      福原秀明
    • Organizer
      Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2009)
    • Place of Presentation
      杭州(中国)
    • Year and Date
      2009-04-11
  • [Presentation] 最簡な論理式でNPN同値類の代表のみを生成するアルゴリズム2009

    • Author(s)
      福原秀明
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      東京工業大学
    • Year and Date
      2009-03-02
  • [Presentation] ブール剰余関数を計算するしきい値論理回路のサイズとエネルギー複雑度のトレードオフ2008

    • Author(s)
      内沢啓
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      東北大学
    • Year and Date
      2008-10-10
  • [Presentation] Lower bounds on quantum query complexity for decision trees2008

    • Author(s)
      福原秀明
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      東北大学
    • Year and Date
      2008-10-10
  • [Presentation] Smooth Boosting for Margin-Based Ranking2008

    • Author(s)
      Jun-ichi Moribe
    • Organizer
      人工知能学会データマイニングと統計数理研究会
    • Place of Presentation
      小樽市民センター
    • Year and Date
      2008-07-23
  • [Book] 現代数理科学事典(第2版)3.4.3節学習アルゴリズム2009

    • Author(s)
      瀧本英二
    • Publisher
      丸善
  • [Remarks] ホームページ

    • URL

      http://www.i.kyushu-u.ac.jp/~eiji

URL: 

Published: 2012-01-26   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi