A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
New intervals improve confidence in selected parameters.
We consider the bridge linear regression modeling, which can produce a sparse or non-sparse model. A crucial point in the model building process is the selection of adjusted parameters including a regularization parameter and a tuning parameter in bridge regression models. The choice of the adjusted parameters can be v…
Paper proposes adaptive parameter selection for KGD algorithms.
A new method selects algorithms and optimizes their hyper-parameters efficiently.
Penalized regression models are popularly used in high-dimensional data analysis to conduct variable selection and model fitting simultaneously. Whereas success has been widely reported in literature, their performances largely depend on the tuning parameters that balance the trade-off between model fitting and model s…
The study evaluates different parameter selection methods for Gaussian process interpolation.
Sparse reduced-rank regression selects variables and ranks via manifold optimization.
A new approach selects tuning parameters for embedding methods.
In sparse regression modeling via regularization such as the lasso, it is important to select appropriate values of tuning parameters including regularization parameters. The choice of tuning parameters can be viewed as a model selection and evaluation problem. Mallows' type criteria may be used as a tuning param…
Recently, many regularized procedures have been proposed for variable selection in linear regression, but their performance depends on the tuning parameter selection. Here a criterion for the tuning parameter selection is proposed, which combines the strength of both stability selection and cross-validation and therefo…
Purpose: Machine learning is broadly used for clinical data analysis. Before training a model, a machine learning algorithm must be selected. Also, the values of one or more model parameters termed hyper-parameters must be set. Selecting algorithms and hyper-parameter values requires advanced machine learning knowledge…
Improved online penalty selection for time series models.
We describe a simple, efficient, permutation based procedure for selecting the penalty parameter in the LASSO. The procedure, which is intended for applications where variable selection is the primary focus, can be applied in a variety of structural settings, including generalized linear models. We briefly discuss conn…
Model selection based on classical information criteria, such as BIC, is generally computationally demanding, but its properties are well studied. On the other hand, model selection based on parameter shrinkage by -type penalties is computationally efficient. In this paper we make an attempt to combine their st…
Selective planning with imperfect models reduces harmful effects of model inadequacy.
In this paper, we derive a Bayesian model order selection rule by using the exponentially embedded family method, termed Bayesian EEF. Unlike many other Bayesian model selection methods, the Bayesian EEF can use vague proper priors and improper noninformative priors to be objective in the elicitation of parameter prior…
We use the language of uninformative Bayesian prior choice to study the selection of appropriately simple effective models. We advocate for the prior which maximizes the mutual information between parameters and predictions, learning as much as possible from limited data. When many parameters are poorly constrained by …
ATSDLN adapts to time series data for anomaly detection.
In a Gaussian graphical model, the conditional independence between two variables are characterized by the corresponding zero entries in the inverse covariance matrix. Maximum likelihood method using the smoothly clipped absolute deviation (SCAD) penalty (Fan and Li, 2001) and the adaptive LASSO penalty (Zou, 2006) hav…
Despite recent advances in regularisation theory, the issue of parameter selection still remains a challenge for most applications. In a recent work the framework of statistical learning was used to approximate the optimal Tikhonov regularisation parameter from noisy data. In this work, we improve their results and ext…
We propose a framework to perform streaming covariance selection. Our approach employs regularization constraints where a time-varying sparsity parameter is iteratively estimated via stochastic gradient descent. This allows for the regularization parameter to be efficiently learnt in an online manner. The proposed fram…
Piecewise constant denoising can be solved either by deterministic optimization approaches, based on the Potts model, or by stochastic Bayesian procedures. The former lead to low computational time but require the selection of a regularization parameter, whose value significantly impacts the achieved solution, and whos…
We consider the two-group classification problem and propose a kernel classifier based on the optimal scoring framework. Unlike previous approaches, we provide theoretical guarantees on the expected risk consistency of the method. We also allow for feature selection by imposing structured sparsity using weighted kernel…
Adaptive tuning of portfolio selection parameters improves performance in volatile markets.
Paper introduces a new IV estimator using ridge regression for better performance.
This paper considers portfolio construction in a dynamic setting. We specify a loss function comprised of utility and complexity components with an unknown tradeoff parameter. We develop a novel regret-based criterion for selecting the tradeoff parameter to construct optimal sparse portfolios over time.
New method corrects selection bias in post-selective inference for Group LASSO.
This article reviews tuning parameter selection for high-dimensional regression.
New method selects variables for GP regression using sparse projection.
ADML combines debiased learning with data-driven model selection for efficient inference.
New CNN layer selects important channels to improve model capacity.
New method selects optimal subdata for efficient parameter estimation.
Proposes a framework for selecting machine learning algorithms in semiparametric models.
Unified Bayesian Optimization framework for model selection balancing effectiveness and training efficiency.
Tuning SVM and boosting models using optimization algorithms.
Sparse feature selection has been demonstrated to be effective in handling high-dimensional data. While promising, most of the existing works use convex methods, which may be suboptimal in terms of the accuracy of feature selection and parameter estimation. In this paper, we expand a nonconvex paradigm to sparse group …
New methods improve Laplace approximations for deep neural networks by selecting key parameters.
New algorithm reduces super-arm selection complexity exponentially.
We develop methods to estimate lag and parameters for multiple stable autoregressive processes.
Bayesian model selection optimizes data augmentation for improved machine learning robustness.
In the regression setting, given a set of hyper-parameters, a model-estimation procedure constructs a model from training data. The optimal hyper-parameters that minimize generalization error of the model are usually unknown. In practice they are often estimated using split-sample validation. Up to now, there is an ope…
New Bitcoin coin selection method improves cost savings.
Framework synthesizes programs for simulating complex models and estimating parameters.
Estimates MoE models with feature selection for high-dimensional data.
Flexible selective inference using flow-based transport maps.
Consistent selection of predictors in high-dimensional binary models with misspecified parameters.
This paper studies the effect of various hyper-parameters and their selection for the best performance of the deep learning model proposed in [1] for distributed attack detection in the Internet of Things (IoT). The findings show that there are three hyper-parameters that have more influence on the best performance ach…
Robust variable selection for high-dimensional data with missing and measurement errors.