Enhanced consistency bounds derived for classification under a new noise condition.
problem Enhanced consistency bounds for classification under a new noise condition.
method Model Margin Noise (MM noise) assumption, derived enhanced H-consistency bounds.
result Enhanced H-consistency bounds under MM noise condition, interpolates between linear and square-root regimes.
Enhanced bounds on rho-invariants for 3-manifolds.
problem Establishing bounds on Cheeger-Gromov rho-invariants for 3-manifolds.
method Constructing chain null-homotopies with linear complexity.
result Linearly bounded complexity of constructed null-homotopies.
Enhanced H H H -consistency bounds derived under relaxed conditions.
problem Quantifying the relationship between zero-one estimation error and surrogate loss estimation error.
method Relaxing the condition on the surrogate loss conditional regret and presenting a general framework for establishing enhanced H H H -consistency bounds. result Derivation of more favorable H H H -consistency bounds in various scenarios. Enhanced Bishop-Gromov theorem for homogeneous and inhomogeneous spaces.
problem Bounding the volume growth of geodesic balls in spaces.
method Introducing coefficient shuffling and using the Raychaudhuri equation, geodesic flow conservation, and the full spectrum of Ricci curvature.
result Upper bounds on the average rate of growth of geodesics for finite-volume inhomogeneous spaces.
Enhances knot counting using mosaic diagrams.
problem Counting and classifying surface-links and knots.
method Marked graph diagrams and mosaic numbers.
result Established bounds on mosaic numbers for surface-links.
Quantum-enhanced metrology aims to estimate an unknown parameter such that the precision scales better than the shot-noise bound. Single-shot adaptive quantum-enhanced metrology (AQEM) is a promising approach that uses feedback to tweak the quantum process according to previous measurement outcomes. Techniques and form…
Enhances RL with function approximation, improving regret bounds.
problem Improving exploration in reinforcement learning with function approximation.
method Prior-dependent Bayesian regret bound for PSRL with linear mixture MDPs, using value-targeted model learning and variance reduction.
result Established an upper bound of O ( d H 3 T log T ) {\mathcal{O}}(d\sqrt{H^3 T \log T}) O ( d H 3 T log T ) for PSRL. Enhances Ricci flow theorem with scalar curvature bound.
problem Improving no-local-collapsing theorem of Ricci flow.
method Derives improved theorem under scalar curvature bound condition.
result Refines Perelman's no-local-collapsing theorem.
EBUCB framework achieves optimal regret with bounded approximate inference error.
problem Theoretical gap between practical performance and theoretical justification of Bayesian bandit algorithms with approximate inference.
method Enhanced Bayesian Upper Confidence Bound (EBUCB) framework that accommodates bandit problems with approximate inference.
result EBUCB achieves optimal regret order O ( log T ) O(\log T) O ( log T ) under certain conditions on inference error. PD-PINNs accelerate PINN training by incorporating task-specific dictionaries.
problem Training PINNs is slow and lacks theoretical error bounds.
method Integrates task-dependent dictionaries into PINNs to enhance convergence.
result PD-PINNs achieve faster convergence and bounded prediction errors.
New algorithm enhances generative modeling for bounded domains.
problem Ad-hoc thresholding techniques for boundary enforcement in diffusion models.
method Reflected Schrödinger Bridge algorithm for entropy-regularized optimal transport.
result Generative modeling in diverse bounded domains with optimal transport properties.
Enhances BO in high dimensions with Newton methods.
problem Challenges in scaling BO to high-dimensional spaces.
method Construct multiple local quadratic models using gradients and Hessians from a global GP, and select new sample points by solving bound-constrained quadratic programs.
result Outperforms existing high-dimensional BO techniques on synthetic and real-world applications.
This work enhances collaborative inference privacy by minimizing conditional entropy and boosting robustness against model inversion attacks.
problem Privacy leakage in collaborative inference systems via model inversion attacks.
method Theoretical proof and derivation of a differentiable measure for bounding conditional entropy, followed by a CEM algorithm to maximize it.
result Theoretical proof and experimental validation show that CEM consistently boosts inversion robustness without compromising feature utility or efficiency.
Enhances the Bishop-Gromov theorem for curved spaces, especially at late times.
problem The Bishop-Gromov theorem's volume growth upperbound is often too loose, especially at late times.
method Identified and quantified the effect of shear, using higher curvature invariants to improve the upperbound.
result Tighter upper bounds on late-time growth rates of geodesic balls in homogeneous spaces with non-positive sectional curvature.
CRB tackles rising rewards in combinatorial online learning.
problem Rising rewards in combinatorial online learning.
method CRB framework and CRUCB algorithm.
result Empirical and theoretical validation of CRUCB's effectiveness.
Enhances predictive models against misspecification and outliers.
problem Suboptimal generalization under misspecification and outliers.
method Combines PAC m ^m m ensemble bounds with a generalized logarithm score function. result Produces predictive distributions resistant to both misspecification and outliers.
Develops a gradient-enhanced approach for online estimation in high-dimensional generalized linear models with streaming data.
problem Online estimation for high-dimensional generalized linear models with streaming data.
method Proposes a gradient-enhanced surrogate loss for non-distributed setting and extends to distributed streaming data.
result Derives non-asymptotic error bounds under high-dimensional scaling without batch-number constraint.
Two new algorithms improve online clustering of bandits by accelerating cluster identification without strong assumptions.
problem Challenges in accurately identifying unknown user clusters in online bandit settings.
method Proposes UniCLUB and PhaseUniCLUB algorithms with enhanced exploration mechanisms.
result Achieves comparable regret bounds to prior work with weaker assumptions.
Enhanced nearest neighbor improves accuracy in crowdsourced data.
problem Noise in crowdsourced labels degrades classification accuracy.
method Developed two algorithms to estimate worker quality and an enhanced nearest neighbor classifier.
result Proposed methods achieve the same regret as oracle version based on expert data.
TAROT enhances robustness and domain adaptability with domain-invariant features.
problem Developing models robust to adversarial attacks across diverse domains.
method Derives a new generalization bound and proposes TAROT algorithm.
result TAROT outperforms state-of-the-art methods in accuracy and robustness.
The paper explores sharp isoperimetric properties on non-compact spaces with Ricci bounds.
problem Sharp isoperimetric properties on non-compact spaces with Ricci bounds.
method Sharp isoperimetric comparison theorems and asymptotic isoperimetric properties.
result Almost regularity theorems and enhanced functional inequalities.
Enhances DP linear regression using public data moments.
problem Limited utility of traditional DP methods in linear regression.
method Transform private data using public second-moment matrix for a better OLSE.
result Improved accuracy and robustness of OLSE in DP linear regression.
This paper improves privacy bounds for DP algorithms using f f f -DP.
problem Difficulty in analyzing randomness in DP algorithms due to mixture distributions.
method Derives a closed-form expression for trade-off functions and analyzes f f f -DP. result Enhances privacy of DP-GD with random initialization and shuffling models.
The paper finds lower bounds for the first eigenvalue of p-Laplacian in specific manifolds.
problem Finding lower bounds for the first eigenvalue of p-Laplacian in Riemannian manifolds.
method Established and enhanced lower bounds for the eigenvalue under specific conditions.
result Provided an estimation for the first Dirichlet eigenvalue in asymptotically hyperbolic Einstein manifolds.
Enhances OTA FL algorithms by defining inverse feasibility for linear models.
problem Improving security and privacy in over-the-air federated learning.
method Defines inverse feasibility as an upper bound on condition number, analyzes existing model, proposes new model.
result Proposes a new OTA FL model with enhanced characteristics.
The study tightens risk bounds for mixtures of experts using local differential privacy.
problem Improving risk bounds for mixtures of experts.
method Imposing local differential privacy (LDP) on the gating mechanism of mixtures of experts.
result Theoretical bounds exhibit logarithmic dependence on the number of experts and tighter than existing bounds.
Enhances U-statistics for semi-supervised datasets using unlabeled data.
problem Efficiently utilizing unlabeled data in semi-supervised settings.
method Semi-supervised U-statistics enhanced by unlabeled data.
result Proposed method is asymptotically Normal and more efficient than classical U-statistics.
Enhances parallelism in decentralized learning for larger networks.
problem Scalability limitations in decentralized learning with increasing number of machines.
method Proposes Decentralized Anytime SGD, a novel algorithm that extends parallelism threshold.
result Establishes a theoretical upper bound on parallelism surpassing current state-of-the-art.
VADD enhances discrete diffusion models by capturing inter-dimensional correlations, improving sample quality.
problem Limited modeling of inter-dimensional dependencies in MDMs degrades performance with few denoising steps.
method Introduces an auxiliary recognition model for latent variable modeling, enabling stable training via variational lower bounds maximization and amortized inference.
result VADD consistently outperforms MDM baselines in sample quality with few denoising steps.
Enhanced Gaussian process models accelerate optimization and posterior approximation.
problem Improving the accuracy and speed of Gaussian process models for optimization and inference.
method Introduces a random exploration step to classical GP-UCB algorithms, facilitating faster convergence.
result New algorithms achieve nearly optimal convergence rates and provide bounds for Hellinger distance.
Enhanced stability improves privacy in machine learning.
problem Improving privacy in machine learning training while maintaining accuracy.
method Study of stability in private empirical risk minimization, focusing on strongly-convex loss functions and uniform stability.
result An algorithm with uniform stability of β implies a bound of O(√β) on the scale of noise required for differential privacy.
We propose an algorithm to enhance certified robustness of a deep model ensemble by optimally weighting each base model. Unlike previous works on using ensembles to empirically improve robustness, our algorithm is based on optimizing a guaranteed robustness certificate of neural networks. Our proposed ensemble framewor…
We derive the optimal differential privacy (DP) parameters of a mechanism that satisfies a given level of Rényi differential privacy (RDP). Our result is based on the joint range of two f f f -divergences that underlie the approximate and the Rényi variations of differential privacy. We apply our result to the moments acc…
Enhanced Euler characteristic improves knot homology detection.
problem Detecting knots in instanton homology.
method Decomposing sutured instanton homology with torsion.
result Enhanced Euler characteristic equals SFH Euler characteristic.
Enhances DNN robustness and accuracy with L 2 , ∞ L_{2,\infty} L 2 , ∞ normalization.
problem Improving the robustness and accuracy of deep neural networks.
method Introducing L 2 , ∞ L_{2,\infty} L 2 , ∞ normalization of weight matrices in DNNs with Relu activation. result Lower bound for robustness measure in terms of L 2 , ∞ L_{2,\infty} L 2 , ∞ norm and upper bound for Rademacher complexity. New bounds for KRR condition number reveal overfitting phenomena.
problem Characterizing overfitting in KRR with varying kernel spectral decay.
method Derived new bounds for kernel matrices, enhanced test error bounds, and identified feature independence role.
result Identified tempered and catastrophic overfitting phenomena.
Deep forests enhance expressiveness exponentially with depth, not width or tree size.
problem Understanding the role of depth, width, and tree size in deep forest performance.
method Provided upper and lower bounds on deep forest approximation complexity.
result Depth exponentially enhances deep forest expressiveness.
Improved generalization bounds for CNNs using Rademacher complexity.
problem Establishing non-vacuous generalization bounds for deep learning models.
method Rademacher complexity framework with novel contraction lemmas for high-dimensional mappings.
result Enhanced generalization bounds for a broader class of activation functions.
Paper introduces CRP-O framework for uncertainty quantification in deep operators.
problem Uncertainty quantification in energy-efficient deep learning algorithms, especially in SNNs.
method CRP-O framework using RP networks and SCP, with Gaussian Process Regression for super-resolution.
result Enhanced uncertainty bounds improve UQ estimates compared to existing methods.
New method estimates model performance bounds without ground truth labels.
problem Evaluation of weakly supervised models without direct access to ground truth labels.
method Formulates model evaluation as a partial identification problem and uses Fréchet bounds for performance estimation.
result Derives accurate and computationally efficient bounds for key metrics like accuracy, precision, recall, and F1-score.
S. Nelson, M. Orrison, V. Rivera {\cite{S}} modified Kauffman's construction of bracket. Their invariant Φ X β Φ^β_X Φ X β takes value in a finite ring Z 2 [ t ] / ( 1 + t + t 3 ) Z_2[t]/(1+t+t^3) Z 2 [ t ] / ( 1 + t + t 3 ) . In this paper, the author generalizes this invariant. The new invariant takes value in a polynomial ring. Furthermore, for a tricolorable link diagram, the au…
In this paper, the method UCB-RS, which resorts to recommendation system (RS) for enhancing the upper-confidence bound algorithm UCB, is presented. The proposed method is used for dealing with non-stationary and large-state spaces multi-armed bandit problems. The proposed method has been targeted to the problem of the …
Enhances hashing for fast retrieval with correlated bits.
problem Fast retrieval and small memory footprint for large-scale information retrieval.
method Employing Boltzmann machine distribution as variational posterior to model correlations among hash code bits.
result Significant performance gains achieved by effectively modeling correlations among hash code bits.
ScoreFusion fuses multiple diffusion models to enhance generative modeling of a target population.
problem Enhancing generative modeling of a target population with limited data.
method ScoreFusion uses KL barycenters of auxiliary populations and recasts the learning problem as score matching in denoising diffusion.
result ScoreFusion achieves a dimension-free sample complexity bound in total variation distance.
The paper bounds the mean absolute error in DNN vector-to-vector regression.
problem Bounding the mean absolute error in deep neural network based vector-to-vector regression.
method Error decomposition techniques in statistical learning theory and non-convex optimization theory were used to derive upper bounds for approximation, estimation, and optimization errors.
result Theoretical upper bounds for mean absolute error in DNN vector-to-vector regression were derived and validated experimentally.
Enhancement attacks can falsely improve machine learning model performance in biomedical research.
problem The trustworthiness of machine learning in biomedical research is threatened by enhancement attacks.
method Developed two techniques to enhance prediction performance with minimal changes to features.
result Falsely improved classifiers' accuracy from 50% to almost 100% while maintaining high feature similarities.
Adaptive spectral RL method enhances RL performance and interpretability.
problem Balancing interpretability and performance in reinforcement learning.
method Spectral based linear RL approach with adaptive regularization.
result Near-optimal bounds for parameter estimation and generalization error.
A toolkit for path-norms enhances neural network generalization bounds.
problem Establishing generalization bounds for modern neural networks.
method Introducing a comprehensive toolkit for path-norms in ReLU networks with various operations.
result Established generalization bounds for modern neural networks that are the most widely applicable and recover/beat the sharpest known bounds.