Suchergebnisse - "algorithms with oracles"

Andere Suchmöglichkeiten:

  • Treffer 1 - 13 von 13
Treffer weiter einschränken
  1. 1

    A Constrained Particle Swarm Optimization Algorithm with Oracle Penalty Method von Dong, Ming Gang, Cheng, Xiao Hui, Niu, Qin Zhou

    ISBN: 3037856521, 9783037856529
    ISSN: 1660-9336, 1662-7482, 1662-7482
    Veröffentlicht: Zurich Trans Tech Publications Ltd 01.02.2013
    Veröffentlicht in Applied Mechanics and Materials (01.02.2013)
    “… To solve constrained optimization problems, an Oracle penalty method-based comprehensive learning particle swarm optimization (OBCLPSO) algorithm was proposed …”
    Volltext
    Journal Article
  2. 2
  3. 3

    Complexity Classes for Online Problems with and without Predictions von Berg, Magnus, Boyar, Joan, Favrholdt, Lene M, Larsen, Kim S

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 26.06.2024
    Veröffentlicht in arXiv.org (26.06.2024)
    “… online algorithms with oracle advice, but predictions of uncertain quality is a very different matter …”
    Volltext
    Paper
  4. 4

    Local volumetric error calibration of a weak stiffness on-machine measuring device with a new 3-D calibrator von Li, Helin, Lin, Bin, Sui, Tianyi, Huang, Tian, Liu, Haitao, Yu, Fukan, Zhao, Pengcheng, Jia, Yueting, Zhu, Fuan

    ISSN: 0268-3768, 1433-3015
    Veröffentlicht: London Springer London 01.07.2022
    “… Subsequently, a smoothly clipped absolute deviation (SCAD) regularization algorithm with oracle property is introduced to identify equivalent coefficients as well as select …”
    Volltext
    Journal Article
  5. 5

    Group Variable Selection with Oracle Property by Weight-Fused Adaptive Elastic Net Model for Strongly Correlated Data von Fu, Guang-Hui, Zhang, Wen-Ming, Dai, Lin, Fu, Ying-Zi

    ISSN: 0361-0918, 1532-4141
    Veröffentlicht: Philadelphia Taylor & Francis 26.11.2014
    “… ) (Zou and Zhang, 2009 ), and a new group variable selection algorithm with oracle property (Fan and Li, 2001 ; Zou, 2006 ) is obtained …”
    Volltext
    Journal Article
  6. 6

    Quantum algorithm to find invariant linear structure of MD hash functions von Wu, WanQing, Zhang, HuanGuo, Mao, ShaoWu, Wang, HouZhen

    ISSN: 1570-0755, 1573-1332
    Veröffentlicht: Boston Springer US 01.03.2015
    Veröffentlicht in Quantum information processing (01.03.2015)
    “… .” We present a quantum algorithm with “Oracle” to solve this problem. The successful probability of the quantum algorithm is ( 2 l - 1 2 l …”
    Volltext
    Journal Article
  7. 7

    Derandomization vs. Lower Bounds for Arthur-Merlin Protocols von Mocelin Sdroievski, Nicollas

    ISBN: 9798383610992
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2024
    “… The subfield of derandomization in computational complexity theory aims to understand the conditions under which randomness can be efficiently reduced or …”
    Volltext
    Dissertation
  8. 8

    Federated Learning under Distributed Concept Drift von Jothimurugesan, Ellango, Hsieh, Kevin, Wang, Jianyu, Joshi, Gauri, Gibbons, Phillip B

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 28.02.2023
    Veröffentlicht in arXiv.org (28.02.2023)
    “… Federated Learning (FL) under distributed concept drift is a largely unexplored area. Although concept drift is itself a well-studied phenomenon, it poses …”
    Volltext
    Paper
  9. 9

    Lifelong Bandit Optimization: No Prior and No Regret von Schur, Felix, Kassraie, Parnian, Rothfuss, Jonas, Krause, Andreas

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 20.06.2023
    Veröffentlicht in arXiv.org (20.06.2023)
    “… Machine learning algorithms are often repeatedly applied to problems with similar structure over and over again. We focus on solving a sequence of bandit …”
    Volltext
    Paper
  10. 10

    Adaptively Exploiting d-Separators with Causal Bandits von Bilodeau, Blair, Wang, Linbo, Roy, Daniel M

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 26.10.2022
    Veröffentlicht in arXiv.org (26.10.2022)
    “… Ideally, an algorithm should be adaptive; that is, perform nearly as well as an algorithm with oracle knowledge of the presence or absence of a d-separator …”
    Volltext
    Paper
  11. 11

    Minimizing Convex Functions with Rational Minimizers von Jiang, Haotian

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 20.09.2022
    Veröffentlicht in arXiv.org (20.09.2022)
    “… Given a separation oracle \(\mathsf{SO}\) for a convex function \(f\) defined on \(\mathbb{R}^n\) that has an integral minimizer inside a box with radius …”
    Volltext
    Paper
  12. 12

    A polynomial-time algorithm for learning nonparametric causal graphs von Gao, Ming, Ding, Yi, Aragam, Bryon

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 10.11.2020
    Veröffentlicht in arXiv.org (10.11.2020)
    “… Compared to an optimal algorithm with oracle knowledge of the variable ordering, the additional cost of the algorithm is linear in the dimension \(d …”
    Volltext
    Paper
  13. 13

    DriftSurf: A Risk-competitive Learning Algorithm under Concept Drift von Tahmasbi, Ashraf, Jothimurugesan, Ellango, Tirthapura, Srikanta, Gibbons, Phillip B

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 02.08.2020
    Veröffentlicht in arXiv.org (02.08.2020)
    “… When learning from streaming data, a change in the data distribution, also known as concept drift, can render a previously-learned model inaccurate and require …”
    Volltext
    Paper