A framework for hypothesis testing on attributed graphs using sampling.
problem Statistical testing on graph data, especially large attributed graphs.
method Sampling-based framework with PHASE and PHASEopt for accurate and efficient hypothesis testing.
result PHASE and PHASEopt improve accuracy and efficiency of hypothesis testing in attributed graphs.
The paper uses RL to verify hypotheses, overcoming existing limitations.
problem Verifying hypotheses using reinforcement learning.
method Formulated hypothesis verification as an RL problem, exploiting hypothesis structure.
result RL agents can successfully verify hypotheses, even those not factorizable.
Selecting appropriate regularization coefficients is critical to performance with respect to regularized empirical risk minimization problems. Existing theoretical approaches attempt to determine the coefficients in order for regularized empirical objectives to be upper-bounds of true objectives, uniformly over a hypot…
New bounds improve generalization in learning scenarios.
problem Limitations of existing information-theoretic bounds in SCO problems.
method Sample-conditioned hypothesis stability and neighboring-hypothesis matrix.
result Sharper generalization guarantees in various learning scenarios.
The paper sets thresholds for testing correlation in hypergraphs, distinguishing between independent and correlated states.
problem Testing correlation between two hypergraphs under different models.
method Derives sharp information-theoretic thresholds for distinguishing between null and alternative hypotheses.
result The testing threshold decreases as the hypergraph's uniformity (m) increases, making correlation testing easier for higher uniformity.
Hypothesis testing is an important problem with applications in target localization, clinical trials etc. Many active hypothesis testing strategies operate in two phases: an exploration phase and a verification phase. In the exploration phase, selection of experiments is such that a moderate level of confidence on the …
Paper resolves open problems on sample complexity in binary hypothesis testing.
problem Open problems in distributed simple binary hypothesis testing under information constraints.
method One-shot lower bound on Bayes error, streamlined sample complexity formula, reverse data-processing inequality.
result Optimally tight sample complexity bounds for communication-constrained simple binary hypothesis testing.
Analyzes the complexity of linear hypothesis sets using Rademacher complexity.
problem Understanding the complexity of linear hypothesis sets for various norms.
method Tight analysis of empirical Rademacher complexity for linear hypothesis classes with bounded weights.
result Improved bounds on Rademacher complexity for linear hypothesis sets, matching or improving existing results.
The paper shows real market exists free lunches with vanishing risks.
problem The hypothesis of no free lunches with vanishing risk in real markets.
method Accurately hedged extreme-maturity zero-coupon bond.
result FLVRs naturally exist in the real market.
We find faster-converging sub-networks that significantly reduce adversarial training time.
problem Finding optimal sub-networks for adversarial training is costly and time-consuming.
method We identify a subset of sub-networks that converge faster during training.
result Sub-networks can reduce adversarial training time by up to 49%.
We prove that the existence of regular Lagrangians can be given by existence of Weinstein Lefschetz fibrations with an hypothesis.
Transforms any test into anytime-valid with sample savings.
problem Sequential data invalidates classical test guarantees.
method Predicts test outcomes to create anytime-valid stopping rules.
result Ensures Type-I error control and near-optimal power.
Unified Bayesian framework improves clinical trial hypothesis testing.
problem Lack of transparency and inability to quantify evidence in traditional P-values.
method Interval null hypothesis framework combined with Bayes factor-based tests.
result Bayesian interval hypothesis testing ensures frequentist error control and interpretability.
The paper refutes the manifold hypothesis for image data and proposes the union of manifolds hypothesis.
problem The manifold hypothesis fails to capture the structure of image data.
method Empirical verification of the union of manifolds hypothesis on image datasets.
result Image data lies on a disconnected set with varying intrinsic dimensions.
Finite resources limit false discovery rate control in structured hypothesis spaces.
problem Controlling false discovery rate in hypothesis testing with finite data and structured hypothesis spaces.
method Framework for exact FDR control and adaptive power maximization.
result Exact FDR control and adaptive power maximization.
Alternative hypothesis tests for class-conditional noise using local maximum likelihood.
problem Assessing label noise in supervised learning datasets.
method Proposes hypothesis tests based on local maximum likelihood estimation for nonparametric logistic regression.
result Shows improved applicability and flexibility of the proposed tests compared to parametric approaches.
NeurT-FDR controls FDR by incorporating feature hierarchy.
problem Controlling FDR in complex, large-scale hypothesis testing problems.
method NeurT-FDR uses a neural network to parametrize test-level covariates and a regression framework to adjust feature hierarchy.
result NeurT-FDR makes substantially more discoveries than competitive baselines.
SnapBoost uses random base hypothesis classes to improve gradient boosting performance.
problem Improving gradient boosting performance.
method Heterogeneous Newton Boosting Machine (HNBM) with variable base hypothesis classes.
result SnapBoost achieves better generalization loss than competing frameworks.
We consider a popular model of microeconomics with countably many assets: the Arbitrage Pricing Model. We study the problem of optimal investment under an expected utility criterion and look for conditions ensuring the existence of optimal strategies. Previous results required a certain restrictive hypothesis on the ta…
New framework compares credal sets for hypothesis testing with epistemic uncertainty.
problem Comparing distributions with partial ignorance and epistemic uncertainty.
method Credal two-sample testing framework for convex sets of probability measures.
result Direct integration of epistemic uncertainty in hypothesis testing.
New framework for robust hypothesis testing using Sinkhorn uncertainty sets.
problem Non-convex robust hypothesis testing problem.
method Exact mixed-integer exponential conic reformulation and convex approximation.
result Satisfactory testing performance and computational efficiency.
Paper relaxes assumptions for non-parametric estimation in pairwise learning.
problem Generalization performance of non-parametric estimation for pairwise learning.
method Significantly relaxes restrictive assumptions, constructs structured deep ReLU neural network, and designs targeted hypothesis space.
result Establishes a sharp oracle inequality for empirical minimizer with general hypothesis space for Lipschitz continuous pairwise losses.
NeurT-FDR controls FDR by incorporating auxiliary covariates in deep learning.
problem Controlling FDR in complex large-scale problems with indirect relations among covariates.
method NeurT-FDR uses a deep Black-Box framework that parametrizes test-level covariates as a neural network and adjusts auxiliary covariates through a regression framework.
result NeurT-FDR makes substantially more discoveries in real datasets compared to competitive baselines.
New method selects optimal bandwidth for price return density estimation, impacting efficient market hypothesis evaluation.
problem Estimating the complexity of price return distributions using kernel density estimation.
method Proposes a new complexity measure to select optimal bandwidth, avoiding overfitting and underfitting.
result Optimal bandwidth selection leads to clearer evaluation of the efficient market hypothesis.
Long-term relative arbitrage exists in markets where the excess growth rate of the market portfolio is bounded away from zero. Here it is shown that under a time-homogeneity hypothesis this condition will also imply the existence of relative arbitrage over arbitrarily short intervals.
Human input has enabled autonomous systems to improve their capabilities and achieve complex behaviors that are otherwise challenging to generate automatically. Recent work focuses on how robots can use such input - like demonstrations or corrections - to learn intended objectives. These techniques assume that the huma…
Differential privacy is a statistical concept that can be explained through hypothesis testing.
problem Formalizing differential privacy as a statistical concept.
method Using David Blackwell's informativeness theorem, the paper shows differential privacy can be understood through hypothesis testing.
result The definition of f-differential privacy provides a unified framework for analyzing privacy bounds. New method uses LLMs to generate detailed scientific hypotheses.
problem Generating detailed, actionable scientific hypotheses from coarse initial directions.
method Hierarchical search method that incrementally adds details to hypotheses.
result Hierarchical search method consistently outperforms strong baselines on expert-annotated hypotheses.
We consider the Hypothesis Transfer Learning (HTL) problem where one incorporates a hypothesis trained on the source domain into the learning procedure of the target domain. Existing theoretical analysis either only studies specific algorithms or only presents upper bounds on the generalization error but not on the exc…
Given a compact three-manifold together with a Riemannian metric, we prove the short-time existence of a solution to the renormalization group flow, truncated at the second order term, under a suitable hypothesis on the sectional curvature of the initial metric.
PAC-Bayesian theory applied to data-dependent hypothesis sets yields uniform generalization bounds.
problem Proving uniform generalization bounds for data-dependent hypothesis sets.
method Applying PAC-Bayesian framework on 'random sets' and considering data-dependent hypothesis sets.
result Data-dependent uniform generalization bounds are proven, providing tighter and unified results.
New algorithm selects best distribution privately in nearly-linear time.
problem Estimating the best distribution from samples under differential privacy constraints.
method Differentially private algorithm with nearly-linear time complexity and optimal approximation factor.
result Achieves optimal approximation factor of 3 with modest sample complexity increase.
Detects dense subhypergraphs in heterogeneous random hypergraphs.
problem Testing for the existence of a dense subhypergraph in heterogeneous random hypergraphs.
method Established detection boundaries and constructed asymptotically powerful and adaptive tests.
result Developed tests for distinguishing between null and alternative hypotheses.
One important assumption underlying common classification models is the stationarity of the data. However, in real-world streaming applications, the data concept indicated by the joint distribution of feature and label is not stationary but drifting over time. Concept drift detection aims to detect such drifts and adap…
Proposes a new approach to regression learning that addresses overfitting and underfitting.
problem Regression learning issues, including overfitting and underfitting.
method Introduces epsilon-Confidence Approximately Correct (epsilon CoAC) framework using Kullback Leibler divergence.
result Demonstrates improved learnability and accuracy compared to cross-validation.
Improved pruning method finds winning neural network subnetworks.
problem Finding a small subnetwork that performs as well as a full neural network.
method Data-dependent pruning criterion using gradient of training loss.
result Data-dependent pruning improves existing pruning algorithms.
The paper proves that most metrics satisfy a strong version of Arnold's conjecture for Laplace eigenvalues.
problem Understanding metrics that satisfy a strong version of Arnold's conjecture for Laplace eigenvalues.
method Using geometric characterizations and perturbation theory, the paper proves the conjecture for most metrics.
result The Strong Arnold Hypothesis is satisfied for all metrics except for a set of infinite codimension.
Enhanced metrics for multiclass classification improve on existing methods.
problem Lack of decisive poor classification results in existing multiclass metrics.
method Introduces three new metrics derived from multivariate Pearson correlation coefficients.
result New metrics decisively indicate poor classification results.
We study the problem of hypothesis testing between two discrete distributions, where we only have access to samples after the action of a known reversible Markov chain, playing the role of noise. We derive instance-dependent minimax rates for the sample complexity of this problem, and show how its dependence in time is…
New method improves feature importance assessment in random forests.
problem Improving feature importance measures for random forests.
method Hypothesis testing via self-normalized feature-residual correlation test (FACT).
result The method provides theoretically justified feature importance tests with controlled type I error and appealing power.
Paper proves Penrose inequality with a weaker late-time condition.
problem Penrose's inequality under the black hole final state conjecture.
method Developed a new late-time condition called quasi final state hypothesis and proved the inequality.
result Proved the spacetime Penrose inequality under the quasi final state hypothesis.
We study the strong predictable representation property in filtrations initially enlarged with a random variable L. We prove that the strong predictable representation property can always be transferred to the enlarged filtration as long as the classical density hypothesis of Jacod (1985) holds. This generalizes the ex…
Study improves hypothesis transfer learning for functional linear models.
problem Incompatible TL techniques for high-dimensional FLR methods due to infinite-dimensional nature of functional data.
method Proposes two algorithms for hypothesis transfer learning in RKHS framework, leveraging RKHS distance and aggregation techniques.
result Establishes asymptotic lower bounds and matching upper bounds for the proposed algorithms, demonstrating their effectiveness.
We present a study of generalization for data-dependent hypothesis sets. We give a general learning guarantee for data-dependent hypothesis sets based on a notion of transductive Rademacher complexity. Our main result is a generalization bound for data-dependent hypothesis sets expressed in terms of a notion of hypothe…
Online learning is the process of answering a sequence of questions based on the correct answers to the previous questions. It is studied in many research areas such as game theory, information theory and machine learning. There are two main components of online learning framework. First, the learning algorithm also kn…
We introduce a bootstrap procedure for high-frequency statistics of Brownian semistationary processes. More specifically, we focus on a hypothesis test on the roughness of sample paths of Brownian semistationary processes, which uses an estimator based on a ratio of realized power variations. Our new resampling method,…
SATL adapts to varying smoothness in hypothesis transfer learning.
problem Fixed kernel regularization fails in varying smoothness settings.
method Proposes SATL, a two-phase KRR algorithm with adaptive Gaussian kernels.
result SATL achieves minimax optimality with matching upper and lower bounds.
Study proposes new methods to convert betting odds into accurate probabilities for sports forecasting.
problem Convert betting odds to accurate outcome probabilities for sports forecasting and market efficiency analysis.
method Proposes two methods: Odds-Only-Equal-Profitability-Confidence (OO-EPC) and Favourite-Longshot-Bias-Adjusted Generalised Linear Model (FL-GLM).
result Proposed methods outperform existing methods in empirical tests and real-world applications.