This paper analyzes the trade-off between accuracy and communication in personalized federated learning.
problem The accuracy-communication trade-off in personalized federated learning.
method The paper provides a quantitative characterization of the personalization degree on the trade-off, establishing minimax optimality.
result The paper offers theoretical insights for choosing the personalization degree and validates the results on synthetic and real-world datasets.
The paper examines how share buybacks impact a company's earnings per share.
problem The trade-off between reducing share count and decreasing net earnings due to share buybacks.
method Review of accretive share repurchases, analysis of EPS increase as a function of price paid, and quantification of earnings growth difference.
result Share buybacks can enhance EPS, but the net effect on earnings growth is mixed.
Unified four trade-off curves for assessing generative model proximity.
problem Quantitative assessment of proximity between two probability distributions.
method Unified four existing curves: PR, Lorenz, ROC, and Rényi divergence frontiers.
result Explicit relationship between PR and Lorenz curves with domain adaptation bounds.
This paper explores the trade-off between spatial and adversarial robustness in neural networks.
problem Understanding the trade-off between spatial and adversarial robustness in neural networks.
method Quantitative analysis and empirical testing with curriculum learning.
result Spatial robustness and adversarial robustness are quantitatively related and can be improved simultaneously.
Framework mitigates overfitting in quantitative trading strategies.
problem Overfitting during strategy transition from backtest to live trading.
method Three-stage protocol: IS, WFA, OOS; majority pass, purge gaps, cliff veto, etc.
result Demonstrates how to detect overfitting through performance decay and drawdown behavior.
Simple classifiers can't be robust to adversarial perturbations, but more complex ones can.
problem The gap between standard accuracy and robustness to adversarial attacks.
method Theoretical examples and quantitative analysis of classification tasks.
result There is a trade-off between robustness and standard accuracy among simple classifiers.
Paper evaluates and mitigates privacy risks in deep learning models.
problem Quantifying and defending against privacy attacks in deep learning.
method Quantitative evaluation of trade-offs, reformulating attacks, and proposing a novel SPN.
result Model accuracy improved by 5-20% while maintaining data privacy.
New framework quantifies learning guarantees for inconsistent convex surrogates.
problem Analyzing consistency properties of machine learning methods with inconsistent convex surrogates.
method Extending the framework of Osokin et al. (2017) to inconsistent surrogates, introducing a new lower bound on the calibration function.
result Shows how learning with inconsistent surrogates can have guarantees on sample complexity and optimization difficulty.
Gradient Weighted Superpixels improve CNN interpretability without sacrificing speed.
problem Efficiency vs. interpretability trade-off in CNNs, especially for large input volumes.
method Gradient-based pixel scoring techniques applied to superpixels.
result Superpixels approximate LIME in a fraction of the time, improving interpretability.
Adversarial training improves gradient interpretability, reducing misinterpretations.
problem Improving gradient interpretability in adversarially trained deep networks.
method Identified and demonstrated that adversarial training restricts gradients closer to the image manifold, making them more interpretable.
result Adversarial training leads to more meaningful loss gradients, aligning better with human perception.
Proposes TCWAE to learn disentangled representations using the Wasserstein Autoencoder.
problem Balancing reconstruction fidelity and disentanglement in learning representations.
method TCWAE (Total Correlation Wasserstein Autoencoder) using different KL estimators.
result Competitive results on data sets with known generative factors, and improved reconstructions on unknown factors.
Study on reproducibility in optimization with bounds on limits.
problem Limits of reproducibility in noisy or error-prone optimization procedures.
method Defined a quantitative measure of reproducibility and analyzed convex optimization settings.
result Revealed a fundamental trade-off between computation and reproducibility.
MGLM models all possible language channel factorizations for improved multilingual generation.
problem Generating multilingual text with flexibility and quality.
method Generative joint distribution model over language channels, marginalizing all possible factorizations.
result MGLM outperforms traditional models in multilingual generation tasks.
Paper tackles bias-variance trade-off in missing data, proposing a dynamic framework.
problem Missing data in practical applications deteriorates model performance.
method Develops a fine-grained dynamic learning framework to jointly optimize bias and variance.
result Theoretical and empirical validation of joint bias-variance optimization.
GCNs improve regression tasks by aggregating neighbor signals.
problem GCNs' statistical properties in regression tasks are poorly understood.
method Examined two GCN convolutions and their impact on learning error.
result GCNs have a bias-variance trade-off that depends on neighborhood size and topology.
Measures strategy durability through minimum regime performance, revealing trade-offs between efficiency and resilience.
problem Systematic investing strategies are vulnerable to regime changes, affecting their effectiveness and performance.
method Introduces minimum regime performance (MRP) to quantify the durability of systematic strategies, capturing how performance deteriorates under changing market conditions.
result Higher long-term Sharpe ratios do not always correlate with higher MRP, highlighting a new dimension of portfolio fragility.
This work introduces uncertainty principles to mitigate Maximal Extractable Value in blockchain systems.
problem Maximal Extractable Value (MEV) in decentralized systems due to transaction submission privacy and monopolist power.
method Unified approaches via uncertainty principles, akin to harmonic analysis and physics, to quantify trade-offs between transaction flexibility and user economic payoff.
result Demonstrates a quantitative trade-off between transaction flexibility and user economic payoff, analogous to the Nyquist-Shannon sampling theorem.
Safe-FinRL uses DRL for high-frequency stock trading, reducing bias and variance.
problem Challenges in applying DRL to high-frequency stock trading, especially bias and variance issues.
method Safe-FinRL separates financial time series into near-stationary short environments and uses Trace-SAC with a general retrace operator.
result Safe-FinRL reduces bias and variance significantly in near-stationary financial environments.
A new approach to disentangled representations using structured latent priors.
problem Learning disentangled representations in unsupervised learning.
method Proposed a structured latent prior to encourage disentanglement and mitigate trade-offs.
result The structured latent prior significantly mitigates the trade-off between reconstruction loss and disentanglement.
New tools quantify deep generative models' performance.
problem Measuring the quality-diversity trade-off in deep generative models.
method Established non-asymptotic bounds on sample complexity and introduced frontier integrals.
result Smoothed estimators improve convergence rates of divergence frontiers.
The paper investigates how symmetry in models affects their performance and generalization.
problem Understanding how symmetry in models impacts their performance and generalization.
method Formal unified investigation of intuitions about symmetry in models and data.
result Quantitative bounds and comparisons between model and data equivariance lead to optimal model performance.
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.
Improved Markowitz method handles uncertainty in return forecasts.
problem Uncertainty in return statistics forecasts.
method Convex optimization with practical constraints.
result Handles uncertainty gracefully and efficiently.
Balancing graph summarization and change detection in streaming data.
problem Balancing compression rate in graph summarization and accuracy in change detection.
method Introducing a probabilistic hierarchical latent variable model and optimizing parameters based on the minimum description length principle to balance the trade-off.
result Guaranteed suppression of Type I error probability (false alarms) in change detection.
Quantum algorithm reduces qubit usage for Monte Carlo simulations.
problem High qubit requirements for Monte Carlo simulations on quantum computers.
method Use of pseudo-random number generator (PRNG) on a quantum circuit.
result Significant reduction in qubit usage without sacrificing quantum speed.
Joslim optimizes both width and weight configurations for slimmable neural networks, improving model efficiency.
problem Optimizing both width and weight configurations for slimmable neural networks to improve efficiency.
method Proposes a general framework for joint optimization of width configurations and weights, and introduces Joslim algorithm.
result Improves model efficiency by up to 1.7% in top-1 accuracy on the ImageNet dataset.
In this paper, we give a proof of the quantitative Morse theorem stated by {Y. Yomdin} in \cite{Y1}. The proof is based on the quantitative Sard theorem, the quantitative inverse function theorem and the quantitative Morse lemma.
New risk measures improve portfolio diversification and stability.
problem Concentration risk in traditional portfolio optimization methods.
method Equal-correlation portfolio strategy with mathematical optimization.
result Improved risk diversification and stable returns.
Adversarial training has been successfully applied to build robust models at a certain cost. While the robustness of a model increases, the standard classification accuracy declines. This phenomenon is suggested to be an inherent trade-off. We propose a model that employs feature prioritization by a nonlinear attention…
Qlib aims to integrate AI into quantitative investment.
problem Challenges in applying AI to quantitative investment.
method Design and develop Qlib to accommodate AI-driven workflow.
result Qlib realizes the potential of AI technologies in quantitative investment.
Study on deep multi-head self-attention dynamics, proving homogenized limits under specific scalings.
problem Understanding the behavior of deep multi-head self-attention models as depth increases.
method Random model of deep multi-head self-attention, viewing depth as time, and analyzing the residual stream as a particle system.
result Homogenized limit of the dynamics, leading to deterministic or stochastic behavior depending on scaling, with implications for representation collapse.
This paper refines MMD for domain adaptation by balancing intra-class and inter-class distances.
problem Balancing intra-class and inter-class distances for better feature discriminability in domain adaptation.
method The paper theoretically proves two facts about MMD and proposes a novel discriminative MMD method to balance intra-class and inter-class distances.
result The proposed method improves feature discriminability and outperforms state-of-the-art methods.
Framework for balancing accuracy and robustness in machine learning.
problem Balancing accuracy and robustness in machine learning models.
method Developed a framework and introduced quantities to characterize the trade-off, including a simple trade-off curve and an influence function.
result Theoretical insight and experimental demonstration of the trade-off between accuracy and robustness.
The book explores essential stats and psychology for quantitative trading.
problem Developing a quantitative trading system.
method Logical progression through articles on statistics, quantitative trading, and psychology.
result Essential elements for quantitative trading systems.
Improves AI system's understanding of human inputs by creating better examples.
problem AI systems misinterpret human inputs, leading to inefficiencies.
method Developed a conditional convolutional autoencoder (CCAE) to generate better examples.
result Generated examples lead to lower error rates and require less effort to create.
Proves quantitative Alexandrov theorem for capillary surfaces.
problem Proving a quantitative version of the Alexandrov theorem for capillary hypersurfaces.
method Quantitative analysis of Montiel-Ros-type argument.
result Generalizes Julin-Niinikoski's result to capillary case.
Proves upper bound on filling radius for manifolds with positive scalar curvature.
problem Bounding the filling radius of manifolds with positive scalar curvature.
method Quantitative operator K-theory and index theory.
result Proves a quantitative upper bound on the filling radius.
The paper develops quantitative estimates for holomorphic sections over bounded domains.
problem Establishing precise inequalities for holomorphic sections over bounded domains.
method Develops Sobolev-type inequalities and applies them to holomorphic sections of Hermitian vector bundles.
result Quantitative Carleman-type estimates for holomorphic sections are derived, improving on previous non-quantitative results.
Study proves quantitative results for isoperimetric problem outside convex bodies in the plane.
problem Quantitative estimates for the relative isoperimetric problem outside convex bodies in the plane.
method Flow approach and Łojasiewicz estimates to prove quantitative stability for minimizers.
result Explicit constants and optimal exponents/rates for Łojasiewicz estimates and rates of convergence for gradient flow.
A new framework enables real-time task trade-off control.
problem Conflict between multiple related tasks in a fixed model capacity.
method Formulates MTL as a preference-conditioned multiobjective optimization problem; uses a hypernetwork-based neural network.
result A single model can handle different trade-off preferences among multiple tasks.
Generative Adversarial Networks (GANs) have been shown to produce realistically looking synthetic images with remarkable success, yet their performance seems less impressive when the training set is highly diverse. In order to provide a better fit to the target data distribution when the dataset includes many different…
The brain optimizes memory by forgetting what's predictable, improving generalization.
problem Memory consolidation struggles with representational drift, semanticisation, and offline replay.
method Proposes predictive forgetting as a mechanism to optimize generalization by reducing complexity.
result Predictive forgetting improves information-theoretic generalization bounds on stored representations.
AI enhances quantitative investment for better returns and risk control.
problem Achieving stable returns through AI in quantitative investment.
method Application of AI technology in quantitative investment strategies.
result AI improves investment performance and risk management.
Study shows adding unlabelled data improves semi-supervised image segmentation accuracy.
problem Improving semi-supervised image segmentation accuracy with limited labelled data.
method Investigated the impact of varying labelled and unlabelled data quantities in a semi-supervised segmentation algorithm.
result Significantly higher segmentation accuracy achieved with semi-supervised approach compared to supervised learning.
This paper presents quantitative shrinking target results for rotations and interval exchange transformations. To do this a quantitative version of a unique ergodicity criterion of Boshernitzan is established.
New trade-off found between accuracy and adversarial robustness in regression.
problem Finding a balance between accuracy and robustness in regression models.
method Deriving a fundamental trade-off between standard and adversarial risk in regression with polynomial ridge functions.
result A necessary condition for achieving adversarial robustness without significant accuracy loss.
Paper explores robust regression methods and their bias-variance trade-off.
problem Understanding the trade-off between robust estimation and optimization methods.
method Examines traditional outlier-resistant robust estimation and robust optimization.
result Both methods follow converse strategies due to a bias-variance trade-off.
Quantum neural networks can approximate noisy functions accurately.
problem Approximating noisy functions with quantum neural networks.
method Universal approximation theorem with error bounds for noisy quantum neural networks.
result Quantum neural networks can approximate noisy functions with precise error bounds.