Develops a more powerful selective inference method for stepwise feature selection.
problem Loss of power in existing conditional SI methods due to over-conditioning.
method Uses homotopy continuation approach to overcome over-conditioning.
result Shows improved power and efficiency in selective inference for feature selection.
This paper analyzes and improves convergence in federated learning with biased client selection.
problem Analyzing convergence in federated learning with biased client selection.
method First convergence analysis of federated optimization for biased client selection strategies, proposing Power-of-Choice framework.
result Power-of-Choice strategies converge up to 3 times faster and give 10% higher test accuracy than random selection.
OptCS optimizes model selection after conformal inference, controlling FDR and power loss.
problem Challenges in model selection for conformal inference, especially when limited labeled data and many model choices are available.
method OptCS framework that allows valid statistical testing after flexible data-driven model optimization, using novel multiple testing procedures.
result Valid conformal p-values constructed despite substantial data reuse, maintaining FDR control.
Private variable selection method controls FDR with simulations showing reasonable power.
problem Performing variable selection with privacy constraints.
method Private knockoff filter using Gaussian and Laplace mechanisms.
result Achieves controlled false discovery rate (FDR) in variable selection.
Enhances selective inference for generalized lasso using parametric programming.
problem Low statistical power in selective inference for generalized lasso.
method Parametric programming to compute solution paths and identify model selection events.
result Improves selective inference power and practicality for various problems.
Refining one's hypotheses in the light of data is a common scientific practice; however, the dependency on the data introduces selection bias and can lead to specious statistical analysis. An approach for addressing this is via conditioning on the selection procedure to account for how we have used the data to generate…
Study short-term wind power and speed predictions using machine learning.
problem Accurate short-term wind power and speed predictions for energy systems.
method Combining numerical weather prediction models with local observations, using machine learning for variable selection and forecasting.
result Improved wind power and speed predictions for 4-hour ahead using machine learning.
Exact selective inference with randomization for Gaussian regression models.
problem Exact selective inference in Gaussian regression models.
method Introduces a pivot for exact selective inference with randomization, reducing the problem to a bivariate truncated Gaussian distribution.
result Our pivot leads to exact inference and produces narrower confidence intervals than related methods.
Beam search improves feature selection for better model performance.
problem Improving feature selection for better model performance.
method Proposed beam search as a generalization of forward selection for feature selection.
result Beam search can outperform forward selection, especially with correlated features.
A new method optimizes MMD test power by dynamically selecting kernels, overcoming traditional trade-offs.
problem Fixed kernels fail to distinguish certain distributions, leading to overfitting and variance collapse.
method Complexity-Penalized MMD (CP-MMD) criterion, derived from concentration inequality, optimizes kernel selection.
result CP-MMD maximizes true test power while ensuring unconditional Type-I validity, matching or exceeding state-of-the-art performance.
Non-availability of reliable and sustainable electric power is a major problem in the developing world. Renewable energy sources like solar are not very lucrative in the current stage due to various uncertainties like weather, storage, land use among others. There also exists various other issues like mis-commitment of…
Proposes a regularization approach to model German power derivative market, identifying significant risk spillovers.
problem Large portfolio of German power derivative contracts, identifying significant risk spillovers.
method Combines high-dimensional variable selection with dynamic network analysis.
result Identifies significant risk contributors and interdependencies between contracts, especially spot contracts.
This work optimizes DNN inference for energy-harvesting devices by compressing and selectively executing neural network exits.
problem Inference delays and energy inefficiency in energy-harvesting devices.
method Developed a power trace-aware and exit-guided network compression algorithm for multi-exit neural networks.
result Superior accuracy and reduced latency compared to state-of-the-art techniques.
New method improves reliability of selecting individuals based on predicted treatment effects.
problem Reliability of selecting individuals based on predicted conditional average treatment effects (CATE) is unreliable.
method Denoised Conformal Alignment, combining proxy errors, variance estimation, and Benjamini-Hochberg selection.
result Significantly improved power in selecting individuals while maintaining false discovery rate control.
New method finds significant high-order interactions efficiently.
problem Finding statistically significant high-order interactions in high-dimensional data.
method Extends selective inference to high-order interaction models with pruning strategy.
result Demonstrated efficient and powerful method for high-order interactions.
In our simplified description `wealth' is money (m). A kinetic theory of gas like model of money is investigated where two agents interact (trade) selectively and exchange some amount of money between them so that sum of their money is unchanged and thus total money of all the agents remains conserved. The probabilit…
SEISM tests neural network features for regulatory genomics.
problem Testing neural network features for regulatory genomics.
method Selective inference procedure for sequence motifs.
result Sampling under specific parameters characterizes composite null hypothesis.
Novel privatization framework for high-dimensional variable selection with differential privacy.
problem High-dimensional controlled variable selection with rigorous FDR control under differential privacy constraints.
method Gaussian Johnson-Lindenstrauss Transformation for privatizing the knockoff matrix.
result The proposed private variable selection procedure maintains statistical power even under strict privacy budgets.
In this paper, we propose a variable selection method for general nonparametric kernel-based estimation. The proposed method consists of two-stage estimation: (1) construct a consistent estimator of the target function, (2) approximate the estimator using a few variables by l1-type penalized estimation. We see that the…
A new method for kernel tests without data splitting increases power.
problem Lack of power in kernel-based tests due to data splitting.
method Selective inference framework to learn hyperparameters and test on full sample.
result Empirically larger test power without data splitting, regardless of split proportion.
Develops a power-calibrated framework for LLM watermarking, optimizing tradeoffs between detectability and distortion.
problem The trade-off between detectability and semantic distortion in logit-based watermarking.
method Power-calibrated statistical framework for watermark hyperparameters, establishing explicit relationships.
result Derives practical parameter selection procedures achieving optimal tradeoffs under constraints.
Hotelling's T2-test for the mean of a multivariate normal distribution is one of the triumphs of classical multivariate analysis. It is uniformly most powerful among invariant tests, and admissible, proper Bayes, and locally and asymptotically minimax among all tests. Nonetheless, investigators often prefer non-inva…
FPPI selectively uses predictions to improve inference efficiency.
problem Improving statistical inference with limited labeled data and heterogeneous prediction quality.
method Filtered Prediction-Powered Inference (FPPI) framework.
result FPPI achieves strictly improved asymptotic efficiency compared to existing methods.
The observation of power laws in the time to extrema of volatility, volume and intertrade times, from milliseconds to years, are shown to result straightforwardly from the selection of biased statistical subsets of realizations in otherwise featureless processes such as random walks. The bias stems from the selection o…
Statistical depth metrics help identify risky power grid scenarios.
problem Identifying extreme scenarios for risk mitigation in power grid planning.
method Functional depth metrics for sub-selecting outlying scenarios.
result The proposed approach effectively identifies risky scenarios for operational risk mitigation.
We study a portfolio selection problem in a continuous-time Itô-Markov additive market with prices of financial assets described by Markov additive processes which combine Lévy processes and regime switching models. Thus the model takes into account two sources of risk: the jump diffusion risk and the regime switching …
Enhances FDR control in variable selection using neural networks.
problem Balancing rigorous error control with statistical power in high-dimensional variable selection.
method Learning-augmented T-Rex Selector framework with a neural network trained on synthetic datasets.
result Achieves superior detection of true variables compared to existing approaches.
Null-Calibrated Conformal Selection via Target-Membership Scores
problem Identifying test candidates whose unknown responses fall in a target region while controlling the false discovery rate
method Membership-score-based conformal selection
result Finite-sample valid null p-values
Proposes a new method to improve selective inference for Lasso models.
problem Over-conditioning due to conditioning on feature signs in selective inference for Lasso.
method Parametric programming approach to avoid conditioning on signs and identify feature selection events.
result Improves power and practicality of selective inference for Lasso models.
GAIF enhances online multiple testing with feedback, improving statistical power.
problem Sequential online multiple testing with delayed feedback.
method GAIF framework using dynamic threshold adjustment and feedback-driven model selection.
result Improves statistical power through feedback-driven model selection.
Paper introduces a method to assess the statistical reliability of changepoints using selective inference and dynamic programming.
problem Assessing the statistical reliability of detected changepoints.
method Selective inference framework combined with dynamic programming for exact p-value computation.
result Proposes a method with high statistical power and decent computational efficiency.
Feature selection methods are widely used in order to solve the 'curse of dimensionality' problem. Many proposed feature selection frameworks, treat all data points equally; neglecting their different representation power and importance. In this paper, we propose an unsupervised hypergraph feature selection method via …
Improves Lasso's stability in correlated predictor settings.
problem Lasso's selection stability deteriorates with correlated predictors.
method Integrates a weighting scheme into the Lasso penalty function, using a correlation-adjusted ranking.
result Demonstrates improved selection stability on simulated and real-world datasets.
Powershap speeds up feature selection for machine learning models.
problem Feature selection in machine learning models is crucial but computationally expensive.
method Powershap combines statistical hypothesis testing and Shapley values for quick feature selection.
result Powershap outperforms other methods with similar predictive performance and significantly faster execution.
GRIP2 improves deep learning feature selection robustness in correlated and noisy data.
problem Identifying predictive features in correlated and noisy data.
method Integrates first-layer feature activity over a two-dimensional regularization surface to control sparsity and geometry, using efficient block-stochastic sampling.
result Demonstrates improved robustness and power in high correlation and low signal-to-noise ratio regimes.
Variable selection for high-dimensional linear models has received a lot of attention lately, mostly in the context of l1-regularization. Part of the attraction is the variable selection effect: parsimonious models are obtained, which are very suitable for interpretation. In terms of predictive power, however, these re…
Forward regression is a statistical model selection and estimation procedure which inductively selects covariates that add predictive power into a working statistical regression model. Once a model is selected, unknown regression parameters are estimated by least squares. This paper analyzes forward regression in high-…
Extends model-x framework to handle missing data.
problem Inability to control false selections in missing data settings.
method Posterior sampled imputation, univariate imputation, joint imputation and sampling knockoffs.
result Preserves theoretical guarantees of model-x framework in missing data setting.
Critical volatility triggers log-normal to power-law transitions in interconnected systems.
problem Understanding the transition from log-normal to power-law distributions in interconnected systems.
method Analyzing an infinite option-on-option chain model, deriving a critical volatility threshold.
result A critical volatility threshold of approximately 250.66% for unconditional cases, dropping to 125.3% with selective survival.
Greedy PIG adapts integrated gradients for better feature attribution.
problem Interpreting deep learning model predictions.
method Unified discrete optimization framework for feature attribution and selection.
result Greedy PIG improves feature attribution on various tasks.
Bayesian neural network improves feature selection and prediction.
problem Improving feature selection and prediction accuracy in neural networks.
method BNN-ARD with l2-norm feature importance measure.
result Improves variable selection and predictive performance on real-world data.
Paper proposes a privacy-preserving knockoff inference method.
problem Ensuring privacy in model-X knockoff inference.
method Differential privacy framework for knockoff inference.
result Guaranteed FDR control with privacy protection.
We consider flows with normal velocities equal to powers strictly larger than one of the Gauss curvature. Under such flows closed strictly convex surfaces converge to points. In his work on the square of the norm of the second fundamental form, Schnürer proposes criteria for selecting quantities that are suitable for p…
Proposes mCS for multivariate selection with FDR control.
problem Selecting high-quality candidates from multivariate datasets.
method Introduces regional monotonicity and multivariate nonconformity scores.
result Significantly improves selection power with FDR control.
In variable or graph selection problems, finding a right-sized model or controlling the number of false positives is notoriously difficult. Recently, a meta-algorithm called Stability Selection was proposed that can provide reliable finite-sample control of the number of false positives. Its benefits were demonstrated …
A new method for dynamic feature selection outperforms existing approaches.
problem Sequentially selecting features based on current information in machine learning.
method Greedy selection of features based on conditional mutual information, combined with a learning approach for optimization.
result The method outperforms existing feature selection methods in experiments.
This paper explores the following question: what kind of statistical guarantees can be given when doing variable selection in high-dimensional models? In particular, we look at the error rates and power of some multi-stage regression methods. In the first stage we fit a set of candidate models. In the second stage we s…
While statistics and machine learning offers numerous methods for ensuring generalization, these methods often fail in the presence of adaptivity---the common practice in which the choice of analysis depends on previous interactions with the same dataset. A recent line of work has introduced powerful, general purpose a…