Log in

Relevant bibliographies by topics / Minimax rate / Journal articles

To see the other types of publications on this topic, follow the link: Minimax rate.

Journal articles on the topic 'Minimax rate'

Author: Grafiati

Published: 26 October 2024

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Minimax rate.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Bose, N. K., and C. Charoenlarpnopparut. "Minimax controller design using rate feedback." Circuits, Systems, and Signal Processing 18, no. 1 (1999): 17–25. http://dx.doi.org/10.1007/bf01206542.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bu, Yuheng, Shaofeng Zou, Yingbin Liang, and Venugopal V. Veeravalli. "Estimation of KL Divergence: Optimal Minimax Rate." IEEE Transactions on Information Theory 64, no. 4 (2018): 2648–74. http://dx.doi.org/10.1109/tit.2018.2805844.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bose, N. K., and C. Charoenlarpnopparut. "Minimax controller using rate feedback: Latest results." IFAC Proceedings Volumes 32, no. 2 (1999): 3714–19. http://dx.doi.org/10.1016/s1474-6670(17)56635-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Gao, Wei. "Minimax Learning Rate for Multi-dividing Ontology Algorithm." Journal of Information and Computational Science 11, no. 6 (2014): 1853–60. http://dx.doi.org/10.12733/jics20103216.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Yuhong Yang. "Minimax rate adaptive estimation over continuous hyper-parameters." IEEE Transactions on Information Theory 47, no. 5 (2001): 2081–85. http://dx.doi.org/10.1109/18.930947.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Carpentier, A., O. Collier, L. Comminges, A. B. Tsybakov, and Yu Wang. "Minimax Rate of Testing in Sparse Linear Regression." Automation and Remote Control 80, no. 10 (2019): 1817–34. http://dx.doi.org/10.1134/s0005117919100047.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zhao, Puning, and Lifeng Lai. "Minimax Rate Optimal Adaptive Nearest Neighbor Classification and Regression." IEEE Transactions on Information Theory 67, no. 5 (2021): 3155–82. http://dx.doi.org/10.1109/tit.2021.3062078.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Wang, Jane-Ling. "Asymptotically Minimax Estimators for Distributions with Increasing Failure Rate." Annals of Statistics 14, no. 3 (1986): 1113–31. http://dx.doi.org/10.1214/aos/1176350053.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Wiest, E. J., and E. Polak. "On the rate of convergence of two minimax algorithms." Journal of Optimization Theory and Applications 71, no. 1 (1991): 1–30. http://dx.doi.org/10.1007/bf00940037.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Guerre, Emmanuel, and Pascal Lavergne. "OPTIMAL MINIMAX RATES FOR NONPARAMETRIC SPECIFICATION TESTING IN REGRESSION MODELS." Econometric Theory 18, no. 5 (2002): 1139–71. http://dx.doi.org/10.1017/s0266466602185069.

Full text

Abstract:

In the context of testing the specification of a nonlinear parametric regression function, we adopt a nonparametric minimax approach to determine the maximum rate at which a set of smooth alternatives can approach the null hypothesis while ensuring that a test can uniformly detect any alternative in this set with some predetermined power. We show that a smooth nonparametric test has optimal asymptotic minimax properties for regular alternatives. As a by-product, we obtain the rate of the smoothing parameter that ensures rate-optimality of the test. We show that, in contrast, a class of nonsmoo

APA, Harvard, Vancouver, ISO, and other styles

11

Geraniotis, E., and H. Poor. "Minimax discrimination for observed Poisson processes with uncertain rate functions." IEEE Transactions on Information Theory 31, no. 5 (1985): 660–69. http://dx.doi.org/10.1109/tit.1985.1057091.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Efromovich, Sam. "Minimax theory of nonparametric hazard rate estimation: efficiency and adaptation." Annals of the Institute of Statistical Mathematics 68, no. 1 (2014): 25–75. http://dx.doi.org/10.1007/s10463-014-0487-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Yang, Guowu, and Yuhong Yang. "Minimax-rate adaptive nonparametric regression with unknown correlations of errors." Science China Mathematics 62, no. 2 (2019): 227–44. http://dx.doi.org/10.1007/s11425-018-9394-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Chen, Xiaohong, and Markus Reiss. "ON RATE OPTIMALITY FOR ILL-POSED INVERSE PROBLEMS IN ECONOMETRICS." Econometric Theory 27, no. 3 (2010): 497–521. http://dx.doi.org/10.1017/s0266466610000381.

Full text

Abstract:

In this paper we clarify the relations between the existing sets of regularity conditions for convergence rates of nonparametric indirect regression (NPIR) and nonparametric instrumental variables (NPIV) regression models. We establish minimax risk lower bounds in mean integrated squared error loss for the NPIR and NPIV models under two basic regularity conditions: the approximation number and the link condition. We show that both a simple projection estimator for the NPIR model and a sieve minimum distance estimator for the NPIV model can achieve the minimax risk lower bounds and are rate opt

APA, Harvard, Vancouver, ISO, and other styles

15

Zhu, Yuancheng, and John Lafferty. "Quantized minimax estimation over Sobolev ellipsoids." Information and Inference: A Journal of the IMA 7, no. 1 (2017): 31–82. http://dx.doi.org/10.1093/imaiai/iax007.

Full text

Abstract:

Abstract We formulate the notion of minimax estimation under storage or communication constraints, and prove an extension to Pinsker's theorem for non-parametric estimation over Sobolev ellipsoids. Placing limits on the number of bits used to encode any estimator, we give tight lower and upper bounds on the excess risk due to quantization in terms of the number of bits, the signal size and the noise level. This establishes the Pareto optimal tradeoff between storage and risk under quantization constraints for Sobolev spaces. Our results and proof techniques combine elements of rate distortion

APA, Harvard, Vancouver, ISO, and other styles

16

Liu, Peili, Yanyan Zhao, Libai Xu, and Tao Wang. "Optimal Minimax Rate of Smoothing Parameter in Distributed Nonparametric Specification Test." Axioms 14, no. 3 (2025): 228. https://doi.org/10.3390/axioms14030228.

Full text

Abstract:

A model specification test is a statistical procedure used to assess whether a given statistical model accurately represents the underlying data-generating process. The smoothing-based nonparametric specification test is widely used due to its efficiency against “singular” local alternatives. However, large modern datasets create various computational problems when implementing the nonparametric specification test. The divide-and-conquer algorithm is highly effective for handling large datasets, as it can break down a large dataset into more manageable datasets. By applying divide-and-conquer,

APA, Harvard, Vancouver, ISO, and other styles

17

Cai, T. Tony, and Anru Zhang. "Minimax rate-optimal estimation of high-dimensional covariance matrices with incomplete data." Journal of Multivariate Analysis 150 (September 2016): 55–74. http://dx.doi.org/10.1016/j.jmva.2016.05.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Kroll, Martin. "Rate optimal estimation of quadratic functionals in inverse problems with partially unknown operator and application to testing problems." ESAIM: Probability and Statistics 23 (2019): 524–51. http://dx.doi.org/10.1051/ps/2018027.

Full text

Abstract:

We consider the estimation of quadratic functionals in a Gaussian sequence model where the eigenvalues are supposed to be unknown and accessible through noisy observations only. Imposing smoothness assumptions both on the signal and the sequence of eigenvalues, we develop a minimax theory for this problem. We propose a truncated series estimator and show that it attains the optimal rate of convergence if the truncation parameter is chosen appropriately. Consequences for testing problems in inverse problems are equally discussed: in particular, the minimax rates of testing for signal detection

APA, Harvard, Vancouver, ISO, and other styles

19

Ding, Litao, and Peter Mathé. "Minimax Rates for Statistical Inverse Problems Under General Source Conditions." Computational Methods in Applied Mathematics 18, no. 4 (2018): 603–8. http://dx.doi.org/10.1515/cmam-2017-0055.

Full text

Abstract:

AbstractWe describe the minimax reconstruction rates in linear ill-posed equations in Hilbert space when smoothness is given in terms of general source sets. The underlying fundamental result, the minimax rate on ellipsoids, is proved similarly to the seminal study by D. L. Donoho, R. C. Liu, and B. MacGibbon [4]. These authors highlighted the special role of the truncated series estimator, and for such estimators the risk can explicitly be given. We provide several examples, indicating results for statistical estimation in ill-posed problems in Hilbert space.

APA, Harvard, Vancouver, ISO, and other styles

20

Royset, J. O., and E. Y. Pee. "Rate of Convergence Analysis of Discretization and Smoothing Algorithms for Semiinfinite Minimax Problems." Journal of Optimization Theory and Applications 155, no. 3 (2012): 855–82. http://dx.doi.org/10.1007/s10957-012-0109-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Galstyan, Tigran, and Arshak Minasyan. "Optimality of the Least Sum of Logarithms in the Problem of Matching Map Recovery in the Presence of Noise and Outliers." Armenian Journal of Mathematics 15, no. 5 (2023): 1–9. http://dx.doi.org/10.52737/18291163-2023.15.5-1-9.

Full text

Abstract:

We consider the problem of estimating the matching map between two sets of feature-vectors observed in a noisy environment and contaminated by outliers. It was already known in the literature that in the outlier-free setting, the least sum of squares (LSS) and the least sum of logarithms (LSL) are both minimax-rate-optimal. It has been recently proved that the optimality properties of the LSS continue to hold in the case the data sets contain outliers. In this work, we show that the same is true for the LSL as well. Therefore, LSL has the same desirable properties as the LSS, and, in addition,

APA, Harvard, Vancouver, ISO, and other styles

22

Wally Zaher, Jiddah r., and Ali Hameed Yousif. "Proposing Shrinkage Estimator of MCP and Elastic-Net penalties in Quantile Regression Model." Wasit Journal of Pure sciences 1, no. 3 (2022): 126–34. http://dx.doi.org/10.31185/wjps.73.

Full text

Abstract:

In some studies, there is a need to estimate the conditional distribution of the response variable at different points, and this is not available in linear regression. The alternative procedure to deal with these problems is quantile regression. In this research, a new estimator for estimating and selecting variables is proposed in the quantile regression model. A new estimator was combines two estimators Minimax Concave Penalty (MCP) and Elastic-Net called shrinkage estimator. It was compared with estimators (Minimax Concave Penalty (MCP) and Elastic-Net) by using simulation and based on Mean

APA, Harvard, Vancouver, ISO, and other styles

23

Ouyang, Liang-Yuh, and Bor-Ren Chuang. "A MINIMAX DISTRIBUTION FREE PROCEDURE FOR STOCHASTIC INVENTORY MODELS WITH A RANDOM BACKORDER RATE." Journal of the Operations Research Society of Japan 42, no. 3 (1999): 342–51. http://dx.doi.org/10.15807/jorsj.42.342.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

del Álamo, Miguel, and Axel Munk. "Total variation multiscale estimators for linear inverse problems." Information and Inference: A Journal of the IMA 9, no. 4 (2020): 961–86. http://dx.doi.org/10.1093/imaiai/iaaa001.

Full text

Abstract:

Abstract Even though the statistical theory of linear inverse problems is a well-studied topic, certain relevant cases remain open. Among these is the estimation of functions of bounded variation ($BV$), meaning $L^1$ functions on a $d$-dimensional domain whose weak first derivatives are finite Radon measures. The estimation of $BV$ functions is relevant in many applications, since it involves minimal smoothness assumptions and gives simplified, interpretable cartoonized reconstructions. In this paper, we propose a novel technique for estimating $BV$ functions in an inverse problem setting and

APA, Harvard, Vancouver, ISO, and other styles

25

Xie, Fangzheng, and Yanxun Xu. "Optimal Bayesian estimation for random dot product graphs." Biometrika 107, no. 4 (2020): 875–89. http://dx.doi.org/10.1093/biomet/asaa031.

Full text

Abstract:

Summary We propose and prove the optimality of a Bayesian approach for estimating the latent positions in random dot product graphs, which we call posterior spectral embedding. Unlike classical spectral-based adjacency, or Laplacian spectral embedding, posterior spectral embedding is a fully likelihood-based graph estimation method that takes advantage of the Bernoulli likelihood information of the observed adjacency matrix. We develop a minimax lower bound for estimating the latent positions, and show that posterior spectral embedding achieves this lower bound in the following two senses: it

APA, Harvard, Vancouver, ISO, and other styles

26

Zhao, Puning, and Zhiguo Wan. "Robust Nonparametric Regression under Poisoning Attack." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 15 (2024): 17007–15. http://dx.doi.org/10.1609/aaai.v38i15.29644.

Full text

Abstract:

This paper studies robust nonparametric regression, in which an adversarial attacker can modify the values of up to q samples from a training dataset of size N. Our initial solution is an M-estimator based on Huber loss minimization. Compared with simple kernel regression, i.e. the Nadaraya-Watson estimator, this method can significantly weaken the impact of malicious samples on the regression performance. We provide the convergence rate as well as the corresponding minimax lower bound. The result shows that, with proper bandwidth selection, supremum error is minimax optimal. The L2 error is o

APA, Harvard, Vancouver, ISO, and other styles

27

Liu, Yi, and Sin-Ho Jung. "An analytical study of the critical values of response rate in single-arm phase II clinical trial designs." Biometrics & Biostatistics International Journal 11, no. 5 (2022): 178–83. http://dx.doi.org/10.15406/bbij.2022.11.00374.

Full text

Abstract:

A single-arm phase II clinical trial is usually conducted for finding an appropriate dose-level and testing toxicity for an experimental cancer therapy in comparison to some historical controls, and is usually the most doable trial type due to the feasibility under limited budget, patient pool and medical conditions that can be met. We considered the standard setting of a single-arm two-stage phase II clinical trial, and investigated the patterns of critical values and sample sizes at both two stages of minimax and optimal designs under different design parameters, i.e., under different respon

APA, Harvard, Vancouver, ISO, and other styles

28

Liu, Yi, and Sin-Ho Jung. "An analytical study of the critical values of response rate in single-arm phase II clinical trial designs." Biometrics & Biostatistics International Journal 11, no. 5 (2022): 178–83. http://dx.doi.org/10.15406/bbij.2023.12.00374.

Full text

Abstract:

A single-arm phase II clinical trial is usually conducted for finding an appropriate dose-level and testing toxicity for an experimental cancer therapy in comparison to some historical controls, and is usually the most doable trial type due to the feasibility under limited budget, patient pool and medical conditions that can be met. We considered the standard setting of a single-arm two-stage phase II clinical trial, and investigated the patterns of critical values and sample sizes at both two stages of minimax and optimal designs under different design parameters, i.e., under different respon

APA, Harvard, Vancouver, ISO, and other styles

29

Wu, Jong-Wuu, Wen-Chuan Lee, and Chia-Ling Lei. "Optimal Inventory Policy Involving Ordering Cost Reduction, Back-Order Discounts, and Variable Lead Time Demand by Minimax Criterion." Mathematical Problems in Engineering 2009 (2009): 1–19. http://dx.doi.org/10.1155/2009/928932.

Full text

Abstract:

This paper allows the backorder rate as a control variable to widen applications of a continuous review inventory model. Moreover, we also consider the backorder rate that is proposed by combining Ouyang and Chuang (2001) (or Lee (2005)) with Pan and Hsiao (2001) to present a new form. Thus, the backorder rate is dependent on the amount of shortages and backorder price discounts. Besides, we also treat the ordering cost as a decision variable. Hence, we develop an algorithmic procedure to find the optimal inventory policy by minimax criterion. Finally, a numerical example is also given to illu

APA, Harvard, Vancouver, ISO, and other styles

30

Zhou, Yang, and Di-Rong Chen. "Optimal rate for prediction when predictor and response are functions." Analysis and Applications 18, no. 04 (2020): 697–714. http://dx.doi.org/10.1142/s0219530520500037.

Full text

Abstract:

In functional data analysis, linear prediction problems have been widely studied based on the functional linear regression model. However, restrictive condition is needed to ensure the existence of the coefficient function. In this paper, a general linear prediction model is considered on the framework of reproducing kernel Hilbert space, which includes both the functional linear regression model and the point impact model. We show that from the point view of prediction, this general model works as well even the coefficient function does not exist. Moreover, under mild conditions, the minimax

APA, Harvard, Vancouver, ISO, and other styles

31

Charoenlarpnopparut, Chalie. "Optimal Minimax Controller for Plants with Four Oscillatory Modes Using Grobner Basis." ECTI Transactions on Electrical Engineering, Electronics, and Communications 7, no. 1 (2008): 52–61. http://dx.doi.org/10.37936/ecti-eec.200971.171808.

Full text

Abstract:

Optimal minimax rate feedback controller design problems was proposed and partially solved by R.S. Bucy et al in 1990. The application of the problem have found in the oscillation suppressor design of large space structure with multiple oscillatory/resonance modes. By employing Grobner basis technique, the complete symbolic solution for the case when the cardinality of the plant oscillatory mode is three or fewer was later found by N.K. Bose and the author. In this paper, the case when the cardinality is four is considered based on the use of Grobner bases. In general, the higher order (four o

APA, Harvard, Vancouver, ISO, and other styles

32

Yan, Xin, Zhouping Xiao, and Zheng Ma. "A Quadratic Surface Minimax Probability Machine for Imbalanced Classification." Symmetry 15, no. 1 (2023): 230. http://dx.doi.org/10.3390/sym15010230.

Full text

Abstract:

In this paper, a kernel-free minimax probability machine model for imbalanced classification is proposed. In this model, a quadratic surface is adopted directly for separating the data points into two classes. By using two symmetry constraints to define the two worst-case classification accuracy rates, the model of maximizing both the F1 value of the minority class and the classification accuracy rate of all the data points is proposed. The proposed model corresponds to a fractional programming problem. Since the two worst-case classification accuracy rates are the symmetry, the proposed model

APA, Harvard, Vancouver, ISO, and other styles

33

ARAGONE, LAURA S., SILVIA C. DI MARCO, and ROBERTO L. V. GONZÁLEZ. "NUMERICAL ANALYSIS OF A MINIMAX OPTIMAL CONTROL PROBLEM WITH AN ADDITIVE FINAL COST." Mathematical Models and Methods in Applied Sciences 12, no. 02 (2002): 183–203. http://dx.doi.org/10.1142/s021820250200160x.

Full text

Abstract:

In this paper we deal with the numerical analysis of an optimal control problem of minimax type with finite horizon and final cost. To get numerical approximations we devise here a fully discrete scheme which enables us to compute an approximated solution. We prove that the fully discrete solution converges to the solution of the continuous problem and we also give the order of the convergence rate. Finally we present some numerical results.

APA, Harvard, Vancouver, ISO, and other styles

34

Gupta, N., S. Sivananthan, and B. K. Sriperumbudur. "Convergence analysis of kernel conjugate gradient for functional linear regression." Journal of Applied and Numerical Analysis 1, no. 1 (2023): 33–47. http://dx.doi.org/10.30970/ana.2023.1.33.

Full text

Abstract:

In this paper, we discuss the convergence analysis of the conjugate gradient-based algorithm for the functional linear model in the reproducing kernel Hilbert space framework, utilizing early stopping results in regularization against over-fitting. We establish the convergence rates depending on the regularity condition of the slope function and the decay rate of the eigenvalues of the operator composition of covariance and kernel operator. Our convergence rates match the minimax rate available from the literature.

APA, Harvard, Vancouver, ISO, and other styles

35

Ma, Don Yitong. "Optimization of Alpha-Beta pruning based on heuristic algorithm." Applied and Computational Engineering 6, no. 1 (2023): 1151–55. http://dx.doi.org/10.54254/2755-2721/6/20230498.

Full text

Abstract:

Games have become an important place for testing Artificial Intelligence (AI). Minimax and Alpha-Beta Pruning are two common and basic algorithms implemented in game AIs. However, there are still limitations of the searching time and searching depth. This paper strives to improve the game AI with a Heuristic Algorithm to optimize both the searching time and depth. The experiment consists of three AIs built with Minimax, Alpha-Beta Pruning, and Heuristic Algorithm to evident the improvement. These AIs are built to play a traditional Chinese zero-sum game, Gobang, which can be seen as an enhance

APA, Harvard, Vancouver, ISO, and other styles

36

Qi, Xinyu, Jinru Wang, and Jiating Shao. "Minimax perturbation bounds of the low-rank matrix under Ky Fan norm." AIMS Mathematics 7, no. 5 (2022): 7595–605. http://dx.doi.org/10.3934/math.2022426.

Full text

Abstract:

<abstract><p>This paper considers the minimax perturbation bounds of the low-rank matrix under Ky Fan norm. We first explore the upper bounds via the best rank-$ r $ approximation $ \hat{A}_r $ of the observation matrix $ \hat{A} $. Next, the lower bounds are established by constructing special matrix groups to show the upper bounds are tight on the low-rank matrix estimation error. In addition, we derive the rate-optimal perturbation bounds for the left and right singular subspaces under Ky Fan norm $ \sin\Theta $ distance. Finally, some simulations have been carried out to suppor

APA, Harvard, Vancouver, ISO, and other styles

37

Zhao, Puning, and Lifeng Lai. "Efficient Classification with Adaptive KNN." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 12 (2021): 11007–14. http://dx.doi.org/10.1609/aaai.v35i12.17314.

Full text

Abstract:

In this paper, we propose an adaptive kNN method for classification, in which different k are selected for different test samples. Our selection rule is easy to implement since it is completely adaptive and does not require any knowledge of the underlying distribution. The convergence rate of the risk of this classifier to the Bayes risk is shown to be minimax optimal for various settings. Moreover, under some special assumptions, the convergence rate is especially fast and does not decay with the increase of dimensionality.

APA, Harvard, Vancouver, ISO, and other styles

38

Yang, Liu, Steve Hanneke, and Jaime Carbonell. "Bounds on the minimax rate for estimating a prior over a VC class from independent learning tasks." Theoretical Computer Science 716 (March 2018): 124–40. http://dx.doi.org/10.1016/j.tcs.2017.11.025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

CAPONNETTO, ANDREA, and YUAN YAO. "CROSS-VALIDATION BASED ADAPTATION FOR REGULARIZATION OPERATORS IN LEARNING THEORY." Analysis and Applications 08, no. 02 (2010): 161–83. http://dx.doi.org/10.1142/s0219530510001564.

Full text

Abstract:

We consider learning algorithms induced by regularization methods in the regression setting. We show that previously obtained error bounds for these algorithms, using a priori choices of the regularization parameter, can be attained using a suitable a posteriori choice based on cross-validation. In particular, these results prove adaptation of the rate of convergence of the estimators to the minimax rate induced by the "effective dimension" of the problem. We also show universal consistency for this broad class of methods which includes regularized least-squares, truncated SVD, Landweber itera

APA, Harvard, Vancouver, ISO, and other styles

40

Efromovich, Sam. "Missing, Modified, and Large-p-small-n Data in Nonparametric Curve Estimation." Calcutta Statistical Association Bulletin 69, no. 1 (2017): 1–34. http://dx.doi.org/10.1177/0008068317695906.

Full text

Abstract:

Nonparametric curve estimation, which makes no assumptions about shape of estimated functions, is one of the main pillars of the modern statistical science. It is used when no adequate parametric or semi-parametric model is available. Asymptotic results on adaptive estimation of nonparametric curves, under both traditional and shrinking minimaxes, are presented. The latter approach allows us to explain the phenomenon of superefficiency when a function can be estimated with a rate faster than the minimax one. Resent results on sequential nonparametric estimation, which yields an assigned risk w

APA, Harvard, Vancouver, ISO, and other styles

41

Brajević, Ivona. "A Shuffle-Based Artificial Bee Colony Algorithm for Solving Integer Programming and Minimax Problems." Mathematics 9, no. 11 (2021): 1211. http://dx.doi.org/10.3390/math9111211.

Full text

Abstract:

The artificial bee colony (ABC) algorithm is a prominent swarm intelligence technique due to its simple structure and effective performance. However, the ABC algorithm has a slow convergence rate when it is used to solve complex optimization problems since its solution search equation is more of an exploration than exploitation operator. This paper presents an improved ABC algorithm for solving integer programming and minimax problems. The proposed approach employs a modified ABC search operator, which exploits the useful information of the current best solution in the onlooker phase with the

APA, Harvard, Vancouver, ISO, and other styles

42

Zhao, Puning, Jiafei Wu, Zhe Liu, Chong Wang, Rongfei Fan, and Qingming Li. "Differential Private Stochastic Optimization with Heavy-tailed Data: Towards Optimal Rates." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 21 (2025): 22795–803. https://doi.org/10.1609/aaai.v39i21.34440.

Full text

Abstract:

We study convex optimization problems under differential privacy (DP). With heavy-tailed gradients, existing works achieve suboptimal rates. The main obstacle is that existing gradient estimators have suboptimal tail property, resulting in a superfluous factor of d in the union bound. In this paper, we explore algorithms achieving optimal rates of DP optimization with heavy-tailed gradients. Our first method is a simple clipping approach. Under bounded p-th order moments of gradients, with n samples, it achieves minimax optimal population risk with epsilon less than 1/d. We then propose an ite

APA, Harvard, Vancouver, ISO, and other styles

43

Ke, Zheng Tracy, and Jingming Wang. "Entry-Wise Eigenvector Analysis and Improved Rates for Topic Modeling on Short Documents." Mathematics 12, no. 11 (2024): 1682. http://dx.doi.org/10.3390/math12111682.

Full text

Abstract:

Topic modeling is a widely utilized tool in text analysis. We investigate the optimal rate for estimating a topic model. Specifically, we consider a scenario with n documents, a vocabulary of size p, and document lengths at the order N. When N≥c·p, referred to as the long-document case, the optimal rate is established in the literature at p/(Nn). However, when N=o(p), referred to as the short-document case, the optimal rate remains unknown. In this paper, we first provide new entry-wise large-deviation bounds for the empirical singular vectors of a topic model. We then apply these bounds to im

APA, Harvard, Vancouver, ISO, and other styles

44

Levine, Michael. "Minimax rate of convergence for an estimator of the functional component in a semiparametric multivariate partially linear model." Journal of Multivariate Analysis 140 (September 2015): 283–90. http://dx.doi.org/10.1016/j.jmva.2015.05.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Hsieh, Fushing, and Bruce W. Turnbull. "A note on the local asymptotically minimax rate for estimating a crossing point in a diagnostic marker problem." Statistics & Probability Letters 24, no. 2 (1995): 181–85. http://dx.doi.org/10.1016/0167-7152(94)00167-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Haris, Asad, Ali Shojaie, and Noah Simon. "Nonparametric regression with adaptive truncation via a convex hierarchical penalty." Biometrika 106, no. 1 (2018): 87–107. http://dx.doi.org/10.1093/biomet/asy056.

Full text

Abstract:

SUMMARY We consider the problem of nonparametric regression with a potentially large number of covariates. We propose a convex, penalized estimation framework that is particularly well suited to high-dimensional sparse additive models and combines the appealing features of finite basis representation and smoothing penalties. In the case of additive models, a finite basis representation provides a parsimonious representation for fitted functions but is not adaptive when component functions possess different levels of complexity. In contrast, a smoothing spline-type penalty on the component func

APA, Harvard, Vancouver, ISO, and other styles

47

Green, Alden, Sivaraman Balakrishnan, and Ryan J. Tibshirani. "Minimax optimal regression over Sobolev spaces via Laplacian Eigenmaps on neighbourhood graphs." Information and Inference: A Journal of the IMA 12, no. 3 (2023): 2423–502. http://dx.doi.org/10.1093/imaiai/iaad034.

Full text

Abstract:

Abstract In this paper, we study the statistical properties of Principal Components Regression with Laplacian Eigenmaps (PCR-LE), a method for non-parametric regression based on Laplacian Eigenmaps (LE). PCR-LE works by projecting a vector of observed responses ${\textbf Y} = (Y_1,\ldots ,Y_n)$ onto a subspace spanned by certain eigenvectors of a neighbourhood graph Laplacian. We show that PCR-LE achieves minimax rates of convergence for random design regression over Sobolev spaces. Under sufficient smoothness conditions on the design density $p$, PCR-LE achieves the optimal rates for both est

APA, Harvard, Vancouver, ISO, and other styles

48

Prędki, Artur. "Estymacja zbioru możliwości produkcyjnych w ramach formalnego modelu statystycznego." Przegląd Statystyczny. Statistical Review 2010, no. 4 (2010): 3–18. http://dx.doi.org/10.59139/ps.2010.04.1.

Full text

Abstract:

In the paper some general statistical model is presented and one of its particular version is exploited to formal estimate of the production set within the DEA and FDH methods. Properties of the FDH and DEA estimators are presented and their realizations for a finite sample are illustrated. Elements of the minimax approach are introduced and the rate of convergence is exploited to express the definition of asymptotic optimality of the estimators.

APA, Harvard, Vancouver, ISO, and other styles

49

Breunig, Christoph, and Xiaohong Chen. "Adaptive, Rate‐Optimal Hypothesis Testing in Nonparametric IV Models." Econometrica 92, no. 6 (2024): 2027–67. http://dx.doi.org/10.3982/ecta18602.

Full text

Abstract:

We propose a new adaptive hypothesis test for inequality (e.g., monotonicity, convexity) and equality (e.g., parametric, semiparametric) restrictions on a structural function in a nonparametric instrumental variables (NPIV) model. Our test statistic is based on a modified leave‐one‐out sample analog of a quadratic distance between the restricted and unrestricted sieve two‐stage least squares estimators. We provide computationally simple, data‐driven choices of sieve tuning parameters and Bonferroni adjusted chi‐squared critical values. Our test adapts to the unknown smoothness of alternative f

APA, Harvard, Vancouver, ISO, and other styles

50

Kieser, M., and C. U. Kunz. "Optimal Two-stage Designs for Single-arm Phase II Oncology Trials with Two Binary Endpoints." Methods of Information in Medicine 50, no. 04 (2011): 372–77. http://dx.doi.org/10.3414/me10-01-0037.

Full text

Abstract:

SummaryObjectives: In phase II clinical trials in oncology, the potential efficacy of a new treatment regimen is assessed in terms of anticancer activity. The standard approach consists of a single-arm two-stage design where a single binary endpoint is compared to a specified target value. However, a new drug would still be considered promising if it showed a lower tumor response rate than the target level but would lead, for example, to disease stabilization.Methods: We present an analytical solution for the calculation of the type I and type II error rate for a two-stage design where the hyp

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!