Concentration inequalities are indispensable tools for studying the generalization capacity of learning models. Hoeffding's and McDiarmid's inequalities are commonly used, giving bounds independent of the data distribution. Although this makes them widely applicable, a drawback is that the bounds can be too loose in so…
On-device research index
arXiv research
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.
168,657 papers · 148 categories
Trend · papers per month
48 results for “distribution-dependent”
Equilibrium master equations for time-inconsistent problems with distribution dependent rewardsq-fin.MF
Unified approach to time-inconsistent problems with distribution-dependent rewards.
problem Time-inconsistent problems with distribution-dependent rewards in behavioral finance and economics.
method Equilibrium master equation on Wasserstein space, refined derivatives, Itô's formula.
result Unified approach to find equilibrium solutions for time-inconsistent problems.
Gibbs-ERM learning is a natural idealized model of learning with stochastic optimization algorithms (such as Stochastic Gradient Langevin Dynamics and ---to some extent--- Stochastic Gradient Descent), while it also arises in other contexts, including PAC-Bayesian theory, and sampling mechanisms. In this work we study …
New margin-based learning guarantees improve generalization bounds.
problem Improving generalization bounds for machine learning models.
method Relative deviation margin bounds using empirical margin loss and Rademacher complexity.
result Distribution-dependent generalization bounds for unbounded loss functions.
This manuscript provides optimization guarantees, generalization bounds, and statistical consistency results for AdaBoost variants which replace the exponential loss with the logistic and similar losses (specifically, twice differentiable convex losses which are Lipschitz and tend to zero on one side). The heart of the…
Study improves generalization bounds for linear regression across tasks.
problem Improving generalization in high-dimensional regression problems.
method Distribution-dependent bounds on generalization error for L1, L2, and elastic net regularization.
result Generalization bounds improve with data distribution niceness and do not degrade with feature dimension.
New trade-off found in bandit problems with unknown range.
problem Stochastic bandit problems with unknown range.
method Exhibit a strategy achieving new trade-off between distribution-dependent and distribution-free regret bounds.
result Achieves the rates for regret indicated by the new trade-off.
Manifold regularization is a commonly used technique in semi-supervised learning. It enforces the classification rule to be smooth with respect to the data-manifold. Here, we derive sample complexity bounds based on pseudo-dimension for models that add a convex data dependent regularization term to a supervised learnin…
The Probably Approximately Correct (PAC) Bayes framework (McAllester, 1999) can incorporate knowledge about the learning algorithm and (data) distribution through the use of distribution-dependent priors, yielding tighter generalization bounds on data-dependent posteriors. Using this flexibility, however, is difficult,…
Study of estimation errors in surrogate loss minimizers, providing stronger guarantees than existing methods.
problem Estimation errors in surrogate loss minimizers for various hypothesis sets.
method Detailed study of -consistency estimation error bounds, proving general theorems for distribution-dependent and independent settings.
result Explicit bounds for zero-one and adversarial losses, showing enhancements under distributional assumptions.
We consider -armed stochastic bandits and consider cumulative regret bounds up to time . We are interested in strategies achieving simultaneously a distribution-free regret bound of optimal order and a distribution-dependent regret that is asymptotically optimal, that is, matching the lower b…
There is accumulating evidence in the literature that stability of learning algorithms is a key characteristic that permits a learning algorithm to generalize. Despite various insightful results in this direction, there seems to be an overlooked dichotomy in the type of stability-based generalization bounds we have in …
Partial monitoring is a general model for sequential learning with limited feedback formalized as a game between two players. In this game, the learner chooses an action and at the same time the opponent chooses an outcome, then the learner suffers a loss and receives a feedback signal. The goal of the learner is to mi…
This paper introduces a new bound to explain generalization in over-parameterized models.
problem Understanding why some over-parameterized models generalize well while others do not.
method PAC-Chernoff bounds and smoothness measures based on large deviation theory.
result Interpolators with smoother structures generalize better, according to the new theoretical framework.
New framework improves learning across multiple distributions.
problem Modeling uncertainty in sensitive machine learning applications.
method Inspired by multi-armed bandits, provides distribution-dependent guarantees.
result Enhanced dependence on suboptimality gaps and sample size.
Proposes methods to include distributional information in MV-SDEs for better modeling of interacting particle systems.
problem Modeling the behavior of an infinite number of interacting particles with distributional information.
method Semi-parametric methods and estimators for MV-SDEs.
result Explicitly including distributional dependence improves performance in modeling temporal data with interaction.
A universal learner achieves best rates for all distributions.
problem Improving learning algorithm rates under various settings.
method Simple extension of Levin's universal search.
result Achieves best-possible rates for all distributions.
Study expands multiclass classification models with new rates and partial concept classes.
problem Multiclass classification with a bounded number of labels under various conditions.
method Extends traditional PAC model to distribution-dependent and data-dependent learning rates, characterizes optimal rates for universal and partial concept classes.
result Characterizes three types of learning rates (exponential, linear, arbitrarily slow) for fixed distributions and complexity measures for partial concept classes.
Unexpectedly, weighted Pareto variables are stochastically dominant.
problem Understanding stochastic dominance in Pareto distributions.
method Analyzing weighted averages of Pareto random variables with infinite mean.
result The weighted average of Pareto variables is stochastically dominant.
New algorithm reduces worst-case regret for heavy-tailed bandits.
problem Stochastic Multi-Armed Bandit problem with heavy-tailed rewards.
method Modified minimax policy MOSS with saturated empirical mean.
result Worst-case regret matching lower bound for heavy-tailed distributions.
We study the wealth distribution of the Bouchaud--Mézard (BM) model on complex networks. It has been known that this distribution depends on the topology of network by numerical simulations, however, no one have succeeded to explain it. Using "adiabatic" and "independent" assumptions along with the central-limit theore…
The paper analyzes meta-learning in a Gaussian setting, providing bounds and matching algorithms.
problem Understanding how task distributions influence transfer risk in meta-learning.
method Fixed design linear regression with Gaussian noise, Gaussian task distribution, weighted biased regularized regression method.
result A novel weighted version of biased regularized regression method matches distribution-dependent lower bounds on transfer risk up to a constant factor.
New dynamics for SGD in small learning rate regime.
problem Improving stochastic gradient descent in small learning rate regime.
method Introducing stochastic modified flows and distribution dependent stochastic modified flows.
result Captures fluctuating dynamics of SGD in small learning rate - infinite width scaling regime.
Nearest neighbor methods are a popular class of nonparametric estimators with several desirable properties, such as adaptivity to different distance scales in different regions of space. Prior work on convergence rates for nearest neighbor classification has not fully reflected these subtle properties. We analyze the b…
We study the stochastic block model with two communities where vertices contain side information in the form of a vertex label. These vertex labels may have arbitrary label distributions, depending on the community memberships. We analyze a linearized version of the popular belief propagation algorithm. We show that th…
We tackle the problem of acting in an unknown finite and discrete Markov Decision Process (MDP) for which the expected shortest path from any state to any other state is bounded by a finite number . An MDP consists of states and possible actions per state. Upon choosing an action at state , one re…
New model analyzes dynamic correlations in stock returns.
problem Analyzing time-varying correlations in high-dimensional data.
method Dynamic factor correlation model with novel parametrization.
result Model accurately captures heterogeneous heavy-tailed distributions and dependent shocks.
We undertake a systematic comparison between implied volatility, as represented by VIX (new methodology) and VXO (old methodology), and realized volatility. We compare visually and statistically distributions of realized and implied variance (volatility squared) and study the distribution of their ratio. We find that t…
Optimizes sampling in continuous domains by adjusting search distribution.
problem Improving sampling efficiency in continuous domains.
method Analyzes and refines the search distribution based on population size and dimension.
result Explicit values for reshaping the search distribution are provided.
The paper tackles domain generalization using functional regression.
problem Learning a model that generalizes well across different source distributions.
method Functional regression approach to learn a linear operator between marginal and conditional distributions.
result The proposed algorithm achieves finite sample error bounds for the idealized risk.
We propose a new active learning algorithm for parametric linear regression with random design. We provide finite sample convergence guarantees for general distributions in the misspecified model. This is the first active learner for this setting that provably can improve over passive learning. Unlike other learning se…
The paper reviews and improves concentration inequalities for statistical inference.
problem Analyzing statistical inference in various settings with high-dimensional data.
method Review and improvement of concentration inequalities for different types of random variables and statistical measures.
result Fresh new results and improved bounds with sharper constants.
Generalization Bounds for Noisy Iterative Algorithms Using Properties of Additive Noise Channelsstat.ML
The paper analyzes generalization of noisy iterative algorithms using communication theory.
problem Generalization of models trained by noisy iterative algorithms under different distributions.
method Connecting noisy iterative algorithms to additive noise channels in communication theory.
result Distribution-dependent generalization bounds for noisy iterative algorithms.
Improved UCB algorithm for diversity in bandits with lower bounds.
problem Improving diversity in bandit-based recommendations.
method Designing a UCB algorithm exploiting the specific structure of the problem.
result The UCB algorithm achieves bounded distribution-dependent regret under certain conditions.
Optimal Rates of Sketched-regularized Algorithms for Least-Squares Regression over Hilbert Spacesstat.ML
We investigate regularized algorithms combining with projection for least-squares regression problem over a Hilbert space, covering nonparametric regression over a reproducing kernel Hilbert space. We prove convergence results with respect to variants of norms, under a capacity assumption on the hypothesis space and a …
New combinatorial dimension VCL refines learning curve theory.
problem Explaining the behavior of learning curves for specific distributions.
method Introducing combinatorial dimension VCL to characterize strong minimax lower bounds.
result Learning rate can be decomposed into linear and exponential components.
Recent studies classify the topology of proteins by analysing the distribution of their projections using knotoids. The approximation of this distribution depends on the number of projection directions that are sampled. Here we investigate the relation between knotoids differing only by small perturbations of the direc…
Motivated by posted price auctions where buyers are grouped in an unknown number of latent types characterized by their private values for the good on sale, we investigate revenue maximization in stochastic dynamic pricing when the distribution of buyers' private values is supported on an unknown set of points in [0,1]…
We consider the problem of active coarse ranking, where the goal is to sort items according to their means into clusters of pre-specified sizes, by adaptively sampling from their reward distributions. This setting is useful in many social science applications involving human raters and the approximate rank of every ite…
We investigate the relation between economic growth and equality in a modified version of the agent-based asset exchange model (AEM). The modified model is a driven system that for a range of parameter space is effectively ergodic in the limit of an infinite system. We find that the belief that "a rising tide lifts all…
Efficient bandit exploration for various distributions without distribution-specific tuning.
problem Optimizing exploration in multi-armed bandit models for different distributions.
method Sub-sampling Duelling Algorithms (SDA) with Random Block sampling for efficient exploration.
result Achieves asymptotically optimal regret for Bernoulli, Gaussian, and Poisson distributions.
We consider the problem of estimating undirected triangle-free graphs of high dimensional distributions. Triangle-free graphs form a rich graph family which allows arbitrary loopy structures but 3-cliques. For inferential tractability, we propose a graphical Fermat's principle to regularize the distribution family. Suc…
A/B testing refers to the task of determining the best option among two alternatives that yield random outcomes. We provide distribution-dependent lower bounds for the performance of A/B testing that improve over the results currently available both in the fixed-confidence (or delta-PAC) and fixed-budget settings. When…
WGANs improve probability distribution approximation with depth and width trade-offs.
problem Approximating complex probability distributions accurately.
method Wasserstein GANs with GroupSort discriminators, quantified generalization bound.
result High-capacity discriminators are crucial for WGANs' performance.
The paper analyzes the performance of empirical risk minimization for -norm linear regression.
problem Empirical risk minimization on -norm linear regression.
method Analyzes performance under various conditions and moment assumptions.
result High probability excess risk bounds for empirical risk minimizer, matching asymptotic rates.
Paper develops a generative model using Wasserstein-2 loss.
problem Creating realistic data samples from limited data.
method Uses a distribution-dependent ODE with a gradient flow for W2 loss.
result The method converges to the true data distribution exponentially.
The personal income distribution (PID) above the Pareto threshold is studied and modeled. A microeconomic model is proposed to simulate the PID and its evolution below and above the Pareto income threshold. The model balances processes of income production and dissipation for any person above 15 years of age. The model…
This paper introduces a new potential function using Tsallis entropy for neural network optimization.
problem The challenge of obtaining exponential convergence in neural network optimization.
method Utilizes a linearized potential function based on Csiszár type of Tsallis entropy.
result Derives an exponential convergence result in neural network optimization.