Coded Federated Learning speeds up model convergence by preemptively computing on parity data.
problem Federated learning's convergence is slow on heterogeneous platforms due to stragglers.
method Develops CFL scheme where clients generate parity data and share it once, allowing the server to compute redundantly.
result CFL allows global model to converge nearly four times faster than uncoded federated learning.
Study on scheduling jobs with unknown types, achieving sublinear excess cost.
problem Optimizing job scheduling with unknown job types and varying durations.
method Design of algorithms for non-preemptive and preemptive scenarios, proving lower bounds.
result Preemptive algorithms can significantly outperform non-preemptive ones when job types have distinct durations.
Improves node classification in graphs with active learning.
problem Difficult or expensive labeling in node classification tasks.
method Graph cognizant logistic regression and preemptive query generation.
result Significant improvement over state-of-the-art approaches.
PCL framework optimizes climate risk management across three clusters.
problem Comprehensive risk management in response to climate change impacts.
method Optimization of preemptive adaptation, contingent arrangements, and loss acceptance.
result Balanced portfolio of actions across three clusters optimized for long-term aggregate outlay.
Study online learning with delays and capacity constraints, achieving optimal regret bounds.
problem Online learning with delays and capacity constraints.
method Novel scheduling and preemptive techniques, matching upper and lower bounds.
result Achieves optimal regret bounds across all capacity levels.
We investigate a randomization procedure undertaken in real option games which can serve as a basic model of regulation in a duopoly model of preemptive investment. We recall the rigorous framework of [M. Grasselli, V. Leclère and M. Ludkovsky, Priority Option: the value of being a leader, International Journal of Theo…
The paper tackles fair representation learning by smoothing feature mappings.
problem Legal liability for discriminatory use of data by organizations.
method Mapping features to a fair representation space, certifying fairness through chi-squared mutual information.
result Smoothing representation distribution provides generalization guarantees of fairness and maintains accuracy for downstream tasks.
Study uses neural networks to predict credit risk in banks.
problem Credit risk management in commercial banks.
method Backpropagation neural network model.
result Neural network model improves credit risk prediction.
Dyna is an architecture for model-based reinforcement learning (RL), where simulated experience from a model is used to update policies or value functions. A key component of Dyna is search-control, the mechanism to generate the state and action from which the agent queries the model, which remains largely unexplored. …
Transformer model predicts train axle vibrations for safer maintenance.
problem Prevent mechanical failures in railway axles.
method Integrates Deep Autoregressive solution with spectral methods and observation models.
result Transformer model (ShaftFormer) improves predictive maintenance for railway axles.
With the rapid growth in fashion e-commerce and customer-friendly product return policies, the cost to handle returned products has become a significant challenge. E-tailers incur huge losses in terms of reverse logistics costs, liquidation cost due to damaged returns or fraudulent behavior. Accurate prediction of prod…
Factor analysis or sometimes referred to as variable analysis has been extensively used in classification problems for identifying specific factors that are significant to particular classes. This type of analysis has been widely used in application such as customer segmentation, medical research, network traffic, imag…
Predicting the remaining useful life of machinery, infrastructure, or other equipment can facilitate preemptive maintenance decisions, whereby a failure is prevented through timely repair or replacement. This allows for a better decision support by considering the anticipated time-to-failure and thus promises to reduce…
Paper proposes model to assess financial risk of grid-ignited wildfires.
problem Financial risk and solvency threats from grid-ignited wildfires.
method Integrated model to evaluate damage costs and risk levels.
result Identifies high-risk areas for preemptive actions.
Measures consistency of tabular LLM predictions under fine-tuning multiplicity.
problem Conflicting predictions from fine-tuned tabular LLMs.
method Local stability measure in embedding space.
result Probabilistic guarantees on prediction consistency under multiplicity.
Emergenet predicts animal influenza strain emergence, outperforming current methods.
problem Limited ability to quantitatively assess animal influenza strain emergence.
method Infer digital twin of sequence evolution using 220,151 HA sequences.
result Emergenet predictions outperform WHO seasonal vaccine recommendations and CDC IRAT scores.
Quantum computing speeds up multi-period asset allocation.
problem High computational complexity in classic computing for multi-period asset allocation.
method Applied quantum computing to simulate multi-asset portfolio using historic data.
result Quantum computing offers significant advantages over classical computing in finance.
The paper analyzes the pricing of a new compute futures asset.
problem Uncertainty in AI adoption and pricing of compute capital.
method An asset-pricing framework for compute futures, including synthetic futures pricing.
result Preliminary evidence suggests a positive compute risk premium.
Quantum computing offers energy savings over classical computing.
problem Energy efficiency in computing services.
method Cournot competition model constrained by energy usage.
result Quantum computing firms can outperform classical counterparts in energy efficiency.
The paper introduces reservoir computing models for complex systems.
problem Modeling complex engineering systems using nonlinear autoregression.
method Introduces reservoir computing with output feedback as stationary and ergodic infinite-order nonlinear autoregressive models.
result Demonstrates versatility of classical and quantum reservoir computers in modeling synthetic and real data.
Defines computable learning for binary classification over metric spaces.
problem Defines computable PAC learning for binary classification over computable metric spaces.
method Provides sufficient conditions for ERM learners to be computable and bounds the strong Weihrauch degree of an ERM learner.
result Gives a hypothesis class that does not admit any proper computable PAC learner with computable sample function.
Automatic computation speeds up crosscap number calculation for alternating knots.
problem Computing crosscap numbers for alternating knots efficiently.
method Introduced an automatic computation with complexity O(E3). result Crosscap numbers of alternating knots can be computed in O(E3) time. TKFT models computation via smooth vector fields, simulating functions in a single dynamical step.
problem Modeling computation in a single step.
method Established Topological Kleene Field Theory (TKFT) as a new model of computation.
result Any computable function can be simulated in a single go of a dynamical system.
Most neural networks utilize the same amount of compute for every example independent of the inherent complexity of the input. Further, methods that adapt the amount of computation to the example focus on finding a fixed inference-time computational graph per example, ignoring any external computational budgets or vary…
Stochastic reservoir computing is shown to be a universal approximator.
problem Theoretical justification for using stochastic reservoirs in machine learning.
method Investigated stochastic reservoir computing using probabilities of reservoir states as readout.
result Stochastic reservoir computers are universal approximating classes.
Machine learning impacts computational math, offering new functions approximations.
problem Machine learning's black box nature hinders further progress in computational math.
method Analyzes machine learning's impact on computational math and vice versa.
result Integrating computational math with machine learning can enhance both fields.
Coded computation techniques provide robustness against straggling servers in distributed computing, with the following limitations: First, they increase decoding complexity. Second, they ignore computations carried out by straggling servers; and they are typically designed to recover the full gradient, and thus, canno…
Method for computing Khovanov homology of tangles.
problem Limited explicit computational studies of Khovanov homology for tangles.
method Arc reduction approach to compute Khovanov homology.
result Derived and computed Poincaré polynomials for simple and complex tangles.
With the rapid growth of the data volume and the fast increasing of the computational model complexity in the scenario of cloud computing, it becomes an important topic that how to handle users' requests by scheduling computational jobs and assigning the resources in data center. In order to have a better perception of…
This paper simplifies computing higher-order U-statistics efficiently.
problem The inefficiency of computing higher-order U-statistics in practice. method Decomposition, connection to Einstein summation, and treewidth-based complexity estimate.
result A new, more efficient algorithm to compute U-statistics. Survey on computational models in dynamical systems, including new universality concepts.
problem Understanding the relationship between computational models and dynamical systems.
method Review of recent works on Turing universality, Topological Kleene Field Theories, and dynamical bordisms.
result Introduction of new perspectives on computability through dynamical systems.
Computations for prime knots up to 11 crossings.
problem Computing HOMFLY homology for prime knots.
method Direct computations for all prime knots up to 11 crossings.
result HOMFLY homology determined for all prime knots up to 11 crossings.
Survey on quantum computing and neural networks.
problem Understanding and comparing quantum computing and neural networks.
method Introduction to quantum computing concepts, explanation of quantum computing paradigms, and analysis of quantum neural networks.
result Current state-of-the-art in quantum neural networks.
New methods improve Reservoir Computing for chaotic time series prediction.
problem Chaotic time series prediction in Reservoir Computing.
method Established Recurrent Kernel limit, introduced Structured Reservoir Computing.
result Structured Reservoir Computing is faster and more memory-efficient.
Quantum computing promises faster bioinformatics, but challenges remain.
problem Efficient bioinformatics processing and drug discovery.
method Quantum algorithms for optimization, simulation, and machine learning.
result Quantum computing can significantly speed up bioinformatics tasks.
We present two paradigms relating algebraic, topological and quantum computational statistics for the topological model for quantum computation. In particular we suggest correspondences between the computational power of topological quantum computers, computational complexity of link invariants and images of braid grou…
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a universal computational procedure for probabilistic inference. We investigate the com…
Quantum computing promises new financial modeling.
problem Traditional financial modeling limitations.
method Overview of quantum computing applications in finance.
result Quantum computing can enhance financial modeling.
We look into computational aspects of two classical knot invariants. We look for ways of simplifying the computation of the coloring invariant and of the Alexander module. We support our ideas with explicit computations on pretzel knots.
Study error bounds in evaluating distributional computational graphs.
problem Error analysis in evaluating graphs with inputs as probability distributions.
method Establish non-asymptotic error bounds using Wasserstein-1 distance.
result Non-asymptotic error bounds for discretization errors in distributional computational graphs.
Quantum computing techniques improve graph analysis and community detection.
problem Analyzing large graphs efficiently and accurately.
method Used quantum annealing and quantum gate computers for community detection and regularity checking.
result Demonstrated the effectiveness of quantum computing in solving complex graph problems.
New method speeds up knot computations in 3D.
problem Computational complexity in knot theory.
method 3D representation of knots for faster computation.
result Savings in computational complexity for knot invariants.
PALMS reconstructs large-scale networks efficiently with parallel computing.
problem Reconstructing large-scale latent networks from observed dynamics is computationally challenging.
method PALMS (Parallel Adaptive Lasso with Multi-directional Signals) framework for distributed network reconstruction.
result PALMS substantially reduces computational complexity and storage requirements.
This paper explores the interactions between knot theory and quantum computing. On one side, knot theory has been used to create models of quantum computing, and on the other, it is a source of computational problems. Knot theory is often used to introduce topological idea to people without a formal mathematical backgr…
Adaptive compute allocation improves model performance by prioritizing harder queries.
problem Inefficiency in allocating test-time compute uniformly across all queries.
method Formulated as a bandit learning problem, proposed adaptive algorithms that estimate query difficulty and allocate compute accordingly.
result Achieved up to 15.29% relative performance improvement on various benchmarks.
Quantum computing offers financial industry new optimization and risk management tools.
problem Traditional computing limits financial industry's problem-solving capabilities.
method Structured review of quantum computing platforms, algorithms, and use cases.
result Quantum computing can enhance financial industry applications like optimization and risk management.
Optimizes K inner simulations for least-square Monte Carlo to reduce computational cost.
problem Computing conditional expectation E[f (Y)|X] with limited samples.
method Determines optimal number of Y samples (K) for given computational budget.
result Computational gain is maximized when sampling Y given X is inexpensive.
QBC uses quantum computers to speed up Bayesian computation.
problem Exponential speed-up in Bayesian computation.
method Quantum von Neumann measurement for simulating ML algorithms.
result Quantum versions of regression, Gaussian processes, and SGD.