D2NN selectively executes neurons to optimize accuracy and efficiency.
problem Balancing accuracy and computational efficiency in deep neural networks.
method D2NN uses controller modules to selectively execute a subset of neurons based on input, trained with a combination of backpropagation and reinforcement learning.
result D2NNs can effectively optimize accuracy-efficiency trade-offs across various image classification tasks.
Deep learning improves OFDFT for molecular systems.
problem Limited accuracy of OFDFT for non-periodic molecular systems.
method M-OFDFT using deep learning to approximate kinetic energy density.
result Achieves comparable accuracy to Kohn-Sham DFT on large molecules.
FMCIT accelerates CI tests for causal discovery, maintaining power and efficiency.
problem High computational complexity in CI tests limits practical applicability of causal discovery methods.
method Flow Matching-based Conditional Independence Test (FMCIT) that leverages flow matching for fast CI tests.
result FMCIT effectively controls type-I error and maintains high testing power under the alternative hypothesis.
This paper introduces blind adversarial pruning to balance accuracy, efficiency, and robustness in neural networks.
problem Balancing accuracy, efficiency, and robustness in neural networks with limited resources.
method Adversarial pruning with a cutoff-scale strategy to dynamically adjust the strength of adversarial examples.
result Blind adversarial pruning improves the overall AER of pruned models compared to adversarial pruning.
Proposes a multi-fidelity machine learning strategy integrating low-fidelity deterministic and high-fidelity Bayesian models.
problem Addressing the accuracy-efficiency trade-off in machine learning with scarce high-fidelity data.
method Integrates a non-probabilistic regression model for low-fidelity with a Bayesian model for high-fidelity, trained in a staggered scheme.
result Achieves comparable performance in mean and uncertainty estimation with reduced training time and effective mitigation of overfitting.
Paper proposes quantizing RNNs to save space and power.
problem Over-parameterization in RNNs leads to inefficiency.
method Increases bit-width reduction for accuracy preservation.
result RNNs can maintain accuracy with reduced precision.
This paper improves spectral clustering for large datasets using the Nystrom method.
problem Spectral clustering's scalability issues with large datasets.
method A principled spectral clustering algorithm exploiting Nystrom approximation's spectral properties.
result Improved spectral clustering efficiency and accuracy compared to existing methods.
A new tree method for tensor data improves regression accuracy.
problem Efficiently modeling tensor data for regression problems.
method Scalar-output regression tree models for scalar-on-tensor problems, and tensor-on-tensor problems using additive tree ensemble approaches.
result The tensor-input tree (TT) method outperforms tensor-input GP models in efficiency and accuracy.
New simulation method simplifies Heston model with Poisson conditioning for better accuracy and efficiency.
problem Computational expense in exact simulation schemes for Heston model.
method Proposes a new exact simulation scheme without modified Bessel function evaluations, leveraging conditional integrated variance simplification.
result Good performance in terms of accuracy, efficiency, and reliability compared to existing methods.
Unified plug-in approach for estimating symmetric properties of distributions efficiently.
problem Estimating symmetric properties of distributions with high accuracy and efficiency.
method Profile-maximum-likelihood (PML) based estimator.
result Achieves theoretical limit for universal symmetric property estimation.
DeepESNs outperform ESN and GRUs in multivariate time-series prediction.
problem Comparing DeepESNs and gated RNNs for multivariate time-series prediction.
method Experimental comparison of DeepESNs and gated RNNs (Gated Recurrent Units, Long Short-Term Memory) on 4 polyphonic music tasks.
result DeepESNs outperform ESN and GRUs in terms of prediction accuracy and efficiency.
Hungarian text processing improved with efficient, accurate NLP pipelines.
problem Improving text processing for Hungarian language.
method Implemented in spaCy framework, focusing on efficiency and accuracy.
result Near state-of-the-art performance in all text preprocessing steps.
New tensor network decompositions improve CNN performance.
problem Limited exploration of tensor network decompositions for CNNs.
method Characterized a new class of CNN modules and experimentally compared various decompositions.
result Some nonlinear decompositions outperform existing ones in terms of accuracy and efficiency.
BitPruning learns optimal bitlengths for neural networks to balance accuracy and efficiency.
problem Finding the minimum bitlength for neural network accuracy.
method A training method that penalizes large bitlengths and minimizes other quantifiable criteria.
result The method learns efficient representations while maintaining accuracy, reducing bitlengths by 3.76 bits on average per layer.
Solves partial assignment problems using random clique complexes.
problem Partial assignment problems, especially with severe occlusions and distortions.
method Formulate as matching random clique complexes, analyze k-skeletons, match adjacency matrices, consider geometric neighbourhoods.
result Outperforms diverse matching algorithms significantly.
MARGINATTACK improves zero-confidence adversarial attacks' accuracy and efficiency.
problem Improving zero-confidence adversarial attacks' accuracy and efficiency.
method Proposes MARGINATTACK, a zero-confidence attack framework that computes margin with improved accuracy and efficiency.
result MARGINATTACK computes a smaller margin than state-of-the-art zero-confidence attacks and matches state-of-the-art fix-perturbation attacks.
A novel method quantizes Batch Normalization for QNNs, maintaining accuracy and efficiency.
problem Quantization challenges in Batch Normalization for QNNs.
method Converts BN to fixed-point operation with shared scale, suitable for hardware.
result Maintains same outputs through rigorous analysis and experiments.
New NHCAs improve multi-category classification efficiency.
problem Efficient multi-category classification for real-world problems.
method Twin SVM (TWSVM), Generalized eigenvalue proximal SVM (GEPSVM), Regularized GEPSVM (RegGEPSVM), and Improved GEPSVM (IGEPSVM) with OAA, BT, and TDS approaches.
result TDS-TWSVM outperforms other methods in classification accuracy.
Study generates synthetic fNIRS data and applies machine learning for improved neuroimaging.
problem Scarcity of high-quality fNIRS neuroimaging datasets.
method Synthetic data generation using Monte Carlo simulations and machine learning.
result Improved accuracy and efficiency of fNIRS tomography.
Mathematical framework for language models processes text and predicts next tokens.
problem Understanding and optimizing the performance of large language models.
method Describes encoding, prediction models, learning from data, and deployment of LLMs.
result Demonstrates remarkable empirical successes and provides a platform for further research.
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.
Convolutional neural networks outperform other architectures in streaming time series classification.
problem Efficient deep learning models for real-time data streams.
method Asynchronous dual-pipeline deep learning framework for real-time predictions.
result Convolutional architectures achieve higher accuracy and efficiency in streaming time series classification.
Proposes a method to estimate acceptance regions for many classes, including new ones.
problem Lack of methods to handle new classes in set-valued classification.
method Generalized Prediction Set (GPS) approach to estimate acceptance regions.
result Achieves a good balance between accuracy, efficiency, and anomaly detection.
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.
Automates debiasing for large language model evaluations through Fisher random walk.
problem Rigorous and scalable evaluation of large language models.
method Semiparametric efficient estimator using Fisher random walk for weighted residual balancing.
result Efficient estimation of contextual preference scores for large language models.
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.
This paper studies trade-offs in private prediction methods.
problem Leakage of training data information in machine learning predictions.
method Private training and private prediction methods with trade-offs.
result Private training methods outperform private prediction methods in various settings.
Efficiently approximates fairness-accuracy trade-offs for diverse datasets.
problem Inherent trade-off between fairness and accuracy in machine learning models.
method You-Only-Train-Once (YOTO) framework for computationally efficient approximation.
result Robust methodology for auditing model fairness with statistical guarantees.
Bayesian optimization method for privacy-utility trade-off.
problem Quantifying privacy-utility trade-off for complex machine learning tasks.
method Bayesian optimization methodology for empirical utility measurement.
result Efficiently characterizes privacy-utility trade-off for differentially private algorithms.
New insights into convergence and accuracy trade-offs in federated and meta-learning.
problem Understanding the trade-offs between convergence and accuracy in federated and meta-learning.
method Generalized local update methods, proving equivalence to first-order optimization on a surrogate loss.
result Novel convergence rates and insights into the importance of algorithmic choices in communication-limited settings.
New research shows no trade-off between fairness and accuracy in machine learning.
problem The trade-off between fairness and accuracy in machine learning is a widely accepted belief.
method Using mismatched hypothesis testing and Chernoff information, the study demonstrates that optimal fairness and accuracy can be achieved simultaneously.
result There is no inherent trade-off between fairness and accuracy in ideal distributions, but it exists when measured with respect to biased datasets.
We empirically investigate the best trade-off between sparse and uniformly-weighted multiple kernel learning (MKL) using the elastic-net regularization on real and simulated datasets. We find that the best trade-off parameter depends not only on the sparsity of the true kernel-weight spectrum but also on the linear dep…
Proposes FACT, a diagnostic for understanding group fairness trade-offs.
problem Group fairness notions often conflict with each other, requiring a cost in model performance.
method Characterizes trade-offs via the fairness-confusion tensor and optimizes accuracy and fairness objectives.
result Demonstrates the use of FACT on synthetic and real datasets to understand accuracy-fairness trade-offs.
Pareto MTL finds optimal solutions for multiple tasks with different trade-offs.
problem Finding a single optimal solution for multiple conflicting tasks.
method Formulate multi-task learning as multiobjective optimization, decompose into subproblems, solve in parallel.
result Generates well-representative Pareto optimal solutions for different trade-offs.
Study shows exponential error reduction in multiclass classification without bias-variance trade-off.
problem Multiclass classification with margin conditions.
method Analysis of classification error under hard-margin conditions.
result Exponential decrease in classification error without bias-variance trade-off.
Paper unifies off-policy learning algorithms and introduces C-trace for better trade-offs.
problem Improving efficiency and scalability in off-policy learning.
method Unified view of off-policy algorithms, considering update variance, fixed-point bias, and contraction rate trade-offs.
result C-trace algorithm demonstrates better trade-offs and state-of-the-art performance.
Vecchia approximations provide the best accuracy-runtime trade-off for Gaussian process approximations.
problem High computational cost of Gaussian processes for large data sets.
method Systematic comparison of different Gaussian process approximations.
result Vecchia approximations consistently provide the best accuracy-runtime trade-off.
The paper explores the trade-off between bias and variance in high-dimensional models.
problem Understanding the unavoidable trade-off between bias and variance in high-dimensional statistical models.
method Proposes a general strategy to obtain lower bounds on the variance of estimators with a specified bias, and applies it to various statistical models.
result Shows the extent to which the bias-variance trade-off is unavoidable and quantifies the performance loss for methods that do not balance it.
Enhances financial analysis with multi-agent collaboration.
problem Limited use of AI-agent collaboration in financial research.
method Proposes a multi-agent system for financial investment research.
result Multi-agent system outperforms single-agent models.
Neural network improves VA valuation efficiency.
problem Efficiently valuing large portfolios of complex VA products.
method Neural network approach for spatial interpolation.
result Neural network provides accurate, efficient, and granular valuation.
Bias and flexibility trade off in learning algorithms.
problem Understanding the trade-off between bias and expressivity in learning algorithms.
method Measuring expressivity using entropy on algorithm outcome distributions, and deriving bounds on bias and expressivity.
result There is a necessary trade-off between bias and expressivity in learning algorithms.
New PAC-Bayesian bound with convexity in posterior and trade-off parameter.
problem Constructing a hypothesis space with convex bounds for empirical performance and complexity.
method Proposed a new PAC-Bayesian bound and alternating minimization procedure.
result The bound can be minimized to find optimal trade-off between empirical performance and complexity.
Fine-tuning LLMs improves capability but harms safety, study finds.
problem Balancing capability and safety in LLM fine-tuning.
method Theoretical framework and numerical experiments for two safety-aware fine-tuning strategies.
result Characterization of fundamental limits of safety-capability trade-off in LLM fine-tuning.
Proposes a heuristic to dynamically control exploration vs exploitation in Bayesian optimization.
problem The trade-off between exploration and exploitation in Bayesian optimization methods.
method Contextual Improvement heuristic to dynamically control the trade-off.
result Improves the speed and robustness of discovering optimal solutions.
Flexible deep learning models for dynamic accuracy and speed trade-offs.
problem Dynamic accuracy and speed trade-offs in real-world applications.
method Training deep neural networks with a new method allowing flexible numerical precision during inference.
result Achieved comparable accuracy to dedicated models trained at the same precision with dynamic precision settings.
Study on bias-variance trade-off in hierarchical models with higher-order interactions.
problem Understanding the bias-variance trade-off in hierarchical probabilistic models with higher-order interactions.
method Proposed an efficient inference algorithm using Gibbs sampling and annealed importance sampling for log-linear higher-order Boltzmann machine.
result Higher-order interactions produce less variance for smaller sample size and comparable error with hidden layers.
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.