We improve random forest consistency and performance with DMRF, a new variant.
problem Improving the consistency and performance of random forest models.
method Developed DMRF, a data-driven multinomial random forest, by modifying proof methods and improving data utilization.
result DMRF achieves strong consistency with probability 1, surpassing previous models in classification tasks.
New algorithm achieves strong consistency in binary non-uniform hypergraph classification.
problem Node classification on binary non-uniform hypergraphs with varying edge probabilities.
method Proposes a refinement algorithm using power iteration on weighted adjacency matrices.
result Proves optimality of the refinement algorithm, achieving strong consistency and IT lower bound.
We consider families of strongly consistent multivariate conditional risk measures. We show that under strong consistency these families admit a decomposition into a conditional aggregation function and a univariate conditional risk measure as introduced Hoffmann et al. (2016). Further, in analogy to the univariate cas…
New algorithms improve community detection in network data with strong consistency.
problem Challenges in effectively adapting spectral clustering techniques and achieving strong consistency in label recovery.
method Proposed Thresholded Cosine Spectral Clustering (TCSC) and one-step Refined TCSC algorithms, with strong consistency proofs.
result One-step Refined TCSC achieves strong consistency in community detection under PABM, correctly recovering all labels with high probability.
Spectral clustering achieves strong consistency in the stochastic block model under certain conditions.
problem Achieving strong consistency in spectral clustering for the stochastic block model.
method Entrywise analysis of the Fielder eigenvector of graph Laplacians.
result Spectral clustering achieves exact recovery of hidden communities under matching information-theoretic limits.
New method simplifies checking consistency of differentiable loss functions.
problem Verifying consistency of differentiable loss functions is difficult.
method Developed a new approach called strong indirect elicitation (strong IE) to simplify checking consistency.
result Strong IE is equivalent to calibration for strongly convex, differentiable surrogates.
The paper explores risk measures and arbitrage in financial markets.
problem Quantifying and managing risk in financial markets.
method Introduces new risk measure axioms and characterizes arbitrage conditions.
result Derives the consistent price interval for financial contracts.
This paper tackles deferral learning with multiple experts, providing strong theoretical guarantees.
problem Optimizing input assignment to experts balancing accuracy and computational cost.
method Introducing new surrogate loss functions and efficient algorithms with strong theoretical learning guarantees.
result Realizable H-consistency, H-consistency bounds, and Bayes-consistency for deferral learning. The main goal of this paper is to investigate under which conditions cash-subadditive convex dynamic risk measures are time-consistent. Proceeding as in Detlefsen and Scandolo \cite{detlef-scandolo} and inspired by their result, we give a dual representation of dynamic cash-subadditive convex risk measures (that can al…
In this paper we formulate in general terms an approach to prove strong consistency of the Empirical Risk Minimisation inductive principle applied to the prototype or distance based clustering. This approach was motivated by the Divisive Information-Theoretic Feature Clustering model in probabilistic space with Kullbac…
The paper defines a new equivalence relation for knot projections and finds an infinite number of distinct classes.
problem Classifying knot projections based on weak homotopy equivalence.
method Defining weak (1, 2, 3) homotopy and using it to find an invariant.
result There are an infinite number of weak (1, 2, 3) homotopy equivalence classes of knot projections.
The standard linear and logistic regression models assume that the response variables are independent, but share the same linear relationship to their corresponding vectors of covariates. The assumption that the response variables are independent is, however, too strong. In many applications, these responses are collec…
New theory for clustering in geometric and adaptive settings.
problem Clustering in non-Euclidean spaces and adaptive parameters.
method Asymptotic theory for k-means and related methods. result Strong consistency and asymptotic limit theorems for various clustering procedures.
In the traditional framework of spectral learning of stochastic time series models, model parameters are estimated based on trajectories of fully recorded observations. However, real-world time series data often contain missing values, and worse, the distributions of missingness events over time are often not independe…
A moment constraint that limits the number of dividends in the optimal dividend problem is suggested. This leads to a new type of time-inconsistent stochastic impulse control problem. First, the optimal solution in the precommitment sense is derived. Second, the problem is formulated as an intrapersonal sequential dyna…
Reduces bounded loss learning to binary classification.
problem Universal consistency of non-i.i.d. processes with bounded loss.
method Constructive reduction to binary classification.
result Any bounded loss output setting can be reduced to binary classification.
Kernel k-Means algorithm improves clustering of non-linear data.
problem Non-convexity of kernel k-Means objective function leads to local minima.
method Generalizes MM approach to solve non-convex problem in kernel and multi-kernel settings.
result Establishes strong consistency guarantees for Kernel Power k-Means.
We establish the first nonasymptotic error bounds for Kaplan-Meier-based nearest neighbor and kernel survival probability estimators where feature vectors reside in metric spaces. Our bounds imply rates of strong consistency for these nonparametric estimators and, up to a log factor, match an existing lower bound for c…
This paper studies statistical estimation in optional regression models.
problem Estimating parameters in regression models with optional semimartingale processes.
method Structural least squares (LS) estimates and their sequential versions.
result Strong consistency of LS-estimates and fixed accuracy of sequential LS-estimates.
Variable screening is a fast dimension reduction technique for assisting high dimensional feature selection. As a preselection method, it selects a moderate size subset of candidate variables for further refining via feature selection to produce the final model. The performance of variable screening depends on both com…
A strong KT (SKT) manifold consists of a Hermitian structure whose torsion three-form is closed. We classify the invariant SKT structures on four-dimensional solvable Lie groups. The classification includes solutions on groups that do not admit compact four-dimensional quotients. It also shows that there are solvable g…
New method detects text changes under dependencies, outperforming baselines.
problem Detecting structural changes in m-dependent text data. method Kernel change-point detection under m-dependence. result Consistent and weakly consistent detection of change points in m-dependent text. New algorithm estimates causal effects for non-Gaussian data.
problem Estimating causal effects in non-Gaussian distributions.
method Generalized k-Triangle Faithfulness Assumption and Edge Estimation Algorithm.
result Uniformly consistent estimates of causal effects.
This thesis tackles learning with multi-class abstention and multi-expert deferral, improving model reliability and efficiency.
problem Improving model reliability and efficiency in large language models (LLMs) by leveraging multiple experts.
method Developed new surrogate losses and consistency guarantees for multi-class classification and regression with deferral.
result Strong consistency guarantees for surrogate losses in multi-class classification and regression with deferral.
Paper explores relationships between triple chords and a specific homotopy relation in knot theory.
problem Understanding the relationship between triple chords and a homotopy equivalence class in knot theory.
method Analyzes the number of triple chords and their connection to the strong (1, 2) homotopy equivalence class.
result Prime knot projections are trivialized by strong (1, 2) homotopy if they have no triple chords.
We consider a jump-type Cox--Ingersoll--Ross (CIR) process driven by a standard Wiener process and a subordinator, and we study asymptotic properties of the maximum likelihood estimator (MLE) for its growth rate. We distinguish three cases: subcritical, critical and supercritical. In the subcritical case we prove weak …
Study shows robust method for estimating density ratios even with heavy contamination.
problem Estimating density ratios in the presence of heavy contamination.
method Weighted density ratio estimation (DRE) with doubly strong robustness.
result Weighted DRE achieves sparse consistency under heavy contamination.
Unified surrogate loss framework for multi-label learning with strong consistency guarantees.
problem Improving consistency and accounting for label correlations in multi-label learning.
method Introducing multi-label logistic loss and extending it to comprehensive multi-label comp-sum losses, proving strong consistency guarantees for any multi-label loss.
result Unified surrogate loss framework benefiting from strong consistency guarantees for any multi-label loss.
Formalizes weak and strong verification for LLMs, controlling errors without assumptions.
problem Balancing cost and reliability in reasoning with LLMs.
method Formalizes weak-strong verification policies, introduces metrics, develops online algorithm.
result Optimal policies admit a two-threshold structure, and calibration and sharpness govern value of weak verifiers.
The paper provides consistency results for KDE on manifolds with irregular kernels.
problem Analyzing density estimation on manifolds with complex kernels.
method Strong uniform consistency with rates for KDE on Riemannian manifolds with Riemann integrable kernels.
result Strong uniform consistency with rates for KDE on manifolds.
Estimate collapsibility of causal effects in CPDAGs via strong d-convex hulls.
problem Estimate causal effects in CPDAGs.
method Use strong d-convex hulls to characterize minimal collapsible sets.
result Efficient algorithm for obtaining collapsible sets in DAGs and CPDAGs.
We study convergence properties of the full truncation Euler scheme for the Cox-Ingersoll-Ross process in the regime where the boundary point zero is inaccessible. Under some conditions on the model parameters (precisely, when the Feller ratio is greater than three), we establish the strong order 1/2 convergence in $L^…
New approach resolves ambiguity in PPCA model's maximum likelihood estimation.
problem Ambiguity in maximum likelihood estimation of PPCA model due to rotational symmetry.
method Using quotient topological spaces, the approach resolves ambiguity and shows consistency of the maximum likelihood solution.
result Maximum likelihood solution is consistent in an appropriate quotient Euclidean space.
We prove strong consistency and asymptotic normality of least squares estimators for the subcritical Heston model based on continuous time observations. We also present some numerical illustrations of our results.
TAMD prevents degeneracy in finite mixtures, offering strong guarantees but modest practical improvements.
problem Degeneracy in maximum likelihood estimation of finite mixtures.
method Transcendental regularization with analytic barrier functions.
result Strong theoretical guarantees (identifiability, consistency, robustness) but modest practical improvements.
Framework for quantifying uncertainty in dynamic processes.
problem Quantifying uncertainty in dynamic stochastic processes.
method Define dynamic uncertainty sets and dynamic robust risk measures.
result Dynamic robust risk measures are time-consistent under specific uncertainty sets.
Spectral clustering for geometric graphs achieves strong consistency in community recovery.
problem Community recovery in dense geometric graphs.
method Spectral clustering algorithm using eigenvectors of adjacency matrix.
result Strong consistency in community recovery proved.
Boosting weak learners to strong ones from aggregate labels is possible for LLP but not for MIL.
problem Boosting weak learners to strong ones from aggregate labels in learning from label proportions (LLP).
method Using a weak learner on large enough bags to obtain a strong learner for small bags in polynomial time.
result Boosting is possible for LLP but not for MIL.
Study proves stability and uniqueness for a specific type of flow.
problem Volume-preserving mean curvature flow stability and uniqueness.
method New gradient flow calibrations for volume preservation, stability estimate in distributional solutions.
result Strong solutions are calibrated and stable under certain conditions.
Enhances random forest consistency and introduces DMRF for improved performance.
problem Improving the consistency and efficiency of random forest algorithms.
method Strengthened proof methods and propose DMRF algorithm.
result DMRF achieves better theoretical and experimental performance than previous variants.
The paper proves strong uniqueness and rectifiability of generalized cylindrical singularities in Ricci flow.
problem Proving strong uniqueness and rectifiability of generalized cylindrical singularities in Ricci flow.
method Establishing a Lojasiewicz inequality for the pointed W-entropy in Ricci flow under the assumption of geometry near the base point being close to a generalized cylinder. result Proves strong uniqueness of generalized cylindrical tangent flows and shows that the subset of points with rectifiable Sqck(N) is horizontally parabolic. The nearest neighbor rule is proven consistent in a broad setting.
problem Proving consistency of the nearest neighbor rule in various settings.
method Proving online consistency for all measurable functions in doubling metric spaces under mild assumptions.
result The nearest neighbor rule is online consistent in all measurable functions in doubling metric spaces.
Theory captures feature learning effects in finite CNNs.
problem Feature learning in finite deep neural networks.
method Derive a self-consistent Gaussian Process theory.
result Good agreement with experiments and sharp transition between regimes.
We establish the consistency of an algorithm of Mondrian Forests, a randomized classification algorithm that can be implemented online. First, we amend the original Mondrian Forest algorithm, that considers a fixed lifetime parameter. Indeed, the fact that this parameter is fixed hinders the statistical consistency of …
For an affine two factor model, we study the asymptotic properties of the maximum likelihood and least squares estimators of some appearing parameters in the so-called subcritical (ergodic) case based on continuous time observations. We prove strong consistency and asymptotic normality of the estimators in question.
We focus on spectral clustering of unlabeled graphs and review some results on clustering methods which achieve weak or strong consistent identification in data generated by such models. We also present a new algorithm which appears to perform optimally both theoretically using asymptotic theory and empirically.
New algorithm learns mappings between metric spaces, achieving strong consistency.
problem Learning mappings between metric spaces with unbounded loss.
method Metric medoids and semi-stable compression.
result Strong Bayes-consistency for topologically separable spaces and bounded labels.
The aim of this paper is to analyze the relationship between inter-industry, intra-industry and inter-regional clustering and demand for labor by companies in Portugal. Is expected at the outset that there is more demand for work where the agglomeration is greater. It should be noted, as a summary conclusion, the resul…