Search Results - Approximate sample error minimization algorithm*

Refine Results
  1. 1

    Learning from non-irreducible Markov chains by Sandrić, Nikola, Šebek, Stjepan

    ISSN: 0022-247X, 1096-0813
    Published: Elsevier Inc 15.07.2023
    “…Most of the existing literature on supervised machine learning problems focuses on the case when the training data set is drawn from an i.i.d. sample…”
    Get full text
    Journal Article
  2. 2

    Learning from non-irreducible Markov chains by Sandrić, Nikola, Šebek, Stjepan

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 20.01.2023
    Published in arXiv.org (20.01.2023)
    “…Mostof the existing literature on supervised machine learning problems focuses on the case when the training data set is drawn from an i.i.d. sample…”
    Get full text
    Paper
  3. 3

    Optimal Subsampling for Large Sample Logistic Regression by Wang, HaiYing, Zhu, Rong, Ma, Ping

    ISSN: 0162-1459, 1537-274X, 1537-274X
    Published: United States Taylor & Francis 03.04.2018
    “… In this article, we propose fast subsampling algorithms to efficiently approximate the maximum likelihood estimate in logistic regression…”
    Get full text
    Journal Article
  4. 4

    A Randomized Algorithm for Nonconvex Minimization With Inexact Evaluations and Complexity Guarantees by Li, Shuyao, Wright, Stephen J.

    ISSN: 0022-3239, 1573-2878
    Published: New York Springer US 01.12.2025
    “…We consider minimization of a smooth nonconvex function with inexact oracle access to gradient and Hessian…”
    Get full text
    Journal Article
  5. 5

    Phase Transition of Total Variation Based on Approximate Message Passing Algorithm by Cheng, Xiang, Lei, Hong

    ISSN: 2079-9292, 2079-9292
    Published: Basel MDPI AG 01.08.2022
    Published in Electronics (Basel) (01.08.2022)
    “…In compressed sensing (CS), one seeks to down-sample some high-dimensional signals and recover them accurately by exploiting the sparsity of the signals…”
    Get full text
    Journal Article
  6. 6

    Rademacher learning rates for iterated random functions by Sandrić, Nikola

    ISSN: 0885-064X
    Published: Elsevier Inc 01.12.2025
    Published in Journal of Complexity (01.12.2025)
    “…Most supervised learning methods assume training data is drawn from an i.i.d. sample. However, real-world problems often exhibit temporal dependence and strong correlations between marginals of the data-generating process, rendering…”
    Get full text
    Journal Article
  7. 7

    Efficient Data Placement and Replication for QoS-Aware Approximate Query Evaluation of Big Data Analytics by Xia, Qiufen, Xu, Zichuan, Liang, Weifa, Yu, Shui, Guo, Song, Zomaya, Albert Y.

    ISSN: 1045-9219, 1558-2183
    Published: New York IEEE 01.12.2019
    “… Instead, sometimes users may only be interested in timely approximate rather than exact query results…”
    Get full text
    Journal Article
  8. 8

    A Canonical Form for Weighted Automata and Applications to Approximate Minimization by Balle, Borja, Panangaden, Prakash, Precup, Doina

    ISSN: 1043-6871
    Published: IEEE 01.07.2015
    “…We study the problem of constructing approximations to a weighted automaton. Weighted finite automata (WFA) are closely related to the theory of rational…”
    Get full text
    Conference Proceeding
  9. 9

    Minimization for conditional simulation: Relationship to optimal transport by Oliver, Dean S.

    ISSN: 0021-9991, 1090-2716
    Published: Elsevier Inc 15.05.2014
    Published in Journal of computational physics (15.05.2014)
    “…In this paper, we consider the problem of generating independent samples from a conditional distribution when independent samples from the prior distribution are available…”
    Get full text
    Journal Article
  10. 10

    Machine learning based energy-free structure predictions of molecules, transition states, and solids by Lemm, Dominik, von Rudorff, Guido Falk, von Lilienfeld, O. Anatole

    ISSN: 2041-1723, 2041-1723
    Published: London Nature Publishing Group UK 22.07.2021
    Published in Nature communications (22.07.2021)
    “… Conventionally, force-fields or ab initio methods determine structure through energy minimization, which is either approximate or computationally demanding…”
    Get full text
    Journal Article
  11. 11

    Approximation of frame based missing data recovery by Cai, Jian-Feng, Shen, Zuowei, Ye, Gui-Bo

    ISSN: 1063-5203, 1096-603X
    Published: Elsevier Inc 01.09.2011
    “… While many such algorithms have been developed recently, there are very few papers available on their error estimations…”
    Get full text
    Journal Article
  12. 12

    On optimal selection of summary statistics for approximate Bayesian computation by Nunes, Matthew A, Balding, David J

    ISSN: 1544-6115, 1544-6115
    Published: Germany 01.01.2010
    “… We approach it from the point of view of seeking data summaries that minimize the average squared error of the posterior distribution for a parameter of interest under approximate Bayesian computation (ABC…”
    Get more information
    Journal Article
  13. 13

    An optimal control framework for adaptive neural ODEs by Aghili, Joubine, Mula, Olga

    ISSN: 1019-7168, 1572-9044
    Published: New York Springer US 01.06.2024
    Published in Advances in computational mathematics (01.06.2024)
    “… The learning task consists in finding the ODE parameters as the optimal values of a sampled loss minimization problem…”
    Get full text
    Journal Article
  14. 14

    A new learning algorithm with logarithmic performance index for complex-valued neural networks by Savitha, R., Suresh, S., Sundararajan, N., Saratchandran, P.

    ISSN: 0925-2312, 1872-8286
    Published: Elsevier B.V 01.10.2009
    Published in Neurocomputing (Amsterdam) (01.10.2009)
    “…) learning algorithm depends on the choice of the activation function, learning sample distribution, minimization criterion, initial weights and the learning rate…”
    Get full text
    Journal Article
  15. 15

    Analysis of the Generalization Error: Empirical Risk Minimization over Deep Artificial Neural Networks Overcomes the Curse of Dimensionality in the Numerical Approximation of Black-Scholes Partial Differential Equations by Berner, Julius, Grohs, Philipp, Jentzen, Arnulf

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 11.11.2020
    Published in arXiv.org (11.11.2020)
    “…The development of new classification and regression algorithms based on empirical risk minimization (ERM…”
    Get full text
    Paper
  16. 16

    Estimating the Total Volume of Queries to a Search Engine by Lillo, Fabrizio, Ruggieri, Salvatore

    ISSN: 1041-4347, 1558-2191
    Published: New York IEEE 01.11.2022
    “… These assumptions are consistent with empirical data, with keyword research practices, and with approximate algorithms used to take counts of query frequencies…”
    Get full text
    Journal Article
  17. 17

    Near-optimality of greedy set selection in the sampling of graph signals by Chamon, Luiz F. O., Ribeiro, Alejandro

    Published: IEEE 01.12.2016
    “… Still, sampling set selection remains an open issue. Indeed, although conditions for graph signal reconstruction from noiseless samples were derived, the presence of noise makes sampling set selection combinatorial and NP-hard in general…”
    Get full text
    Conference Proceeding
  18. 18

    Big-But-Biased Data Analytics for Air Quality by Borrajo, Laura, Cao, Ricardo

    ISSN: 2079-9292, 2079-9292
    Published: Basel MDPI AG 01.09.2020
    Published in Electronics (Basel) (01.09.2020)
    “… A new bootstrap algorithm is used to approximate the mean squared error of the new estimator…”
    Get full text
    Journal Article
  19. 19

    Statistical learning problem of artificial neural network to control roofing process by Lapidus, Azariy, Makarov, Aleksandr

    ISSN: 2261-236X, 2274-7214, 2261-236X
    Published: Les Ulis EDP Sciences 01.01.2017
    Published in MATEC web of conferences (01.01.2017)
    “… ANN learning is the main stage of its development. A key question for supervised learning is how many number of training examples we need to approximate the true relationship between network inputs and output with the desired accuracy…”
    Get full text
    Journal Article Conference Proceeding
  20. 20

    Novel and Efficient Approximations for Zero-One and Ranking Losses of Linear Classifiers by Ghanbari, Hiva, Li, Minhan, Scheinberg, Katya

    ISSN: 2305-221X, 2305-2228
    Published: Heidelberg Springer Nature B.V 01.10.2025
    Published in Vietnam journal of mathematics (01.10.2025)
    “…The predictive quality of machine learning models is typically measured in terms of their (approximate…”
    Get full text
    Journal Article