New activation networks improve model efficiency and performance.
problem Creating hardware-efficient deep learning models.
method Restructurable Activation Networks (RANs) with RAN-explicit and RAN-implicit methods.
result RANs achieve state-of-the-art results with improved hardware efficiency.
Meta-DRL improves resource allocation in O-RAN networks.
problem Dynamic resource allocation in O-RAN networks.
method Meta Deep Reinforcement Learning (Meta-DRL) inspired by MAML.
result 19.8% improvement in network management performance.
QBSD optimizes KPI forecasting for RAN networks with fast runtime and accuracy.
problem Efficiently forecasting KPIs for RAN networks with dynamic operating ranges.
method Quartile-Based Seasonality Decomposition (QBSD) for live single-step forecasting.
result QBSD outperforms other methods in runtime efficiency and forecast accuracy.
Introduces new spaces for configurations of points with specific monodromies.
problem Configurations of points with specific monodromies in complex plane subspaces.
method Introduces Hurwitz-Ran spaces for configurations of points in X∖Y and Y with monodromies in Q and G. result Proves homeomorphism between Hurwitz-Ran spaces and simplicial Hurwitz spaces.
RAN model recognizes multiple activities from unlabeled sensor data.
problem Handling weakly labeled multi-activity data from wearable sensors.
method Recurrent Attention Networks (RAN) for sequential multi-activity recognition and localization.
result RAN model can infer multiple activities and determine activity locations from unlabeled data.
Proposes a new model for RANS simulations with uncertainty.
problem Uncertainty in Reynolds-averaged Navier-Stokes simulations.
method Data-driven closure model with aleatoric uncertainty, Bayesian formulation, sparse indirect data.
result Accurate probabilistic predictions, even in regions of model error.
Simulation of high-speed train aerodynamics using RANS and machine learning.
problem Aerodynamic analysis of high-speed trains under turbulent flow conditions.
method RANS equations with turbulence model, machine learning (GEP, GPR, RF) for predictions.
result Random Forest (RF) provides the most accurate predictions for aerodynamic coefficients.
In this paper, the distributed edge caching problem in fog radio access networks (F-RANs) is investigated. By considering the unknown spatio-temporal content popularity and user preference, a user request model based on hidden Markov process is proposed to characterize the fluctuant spatio-temporal traffic demands in F…
The cloud radio access network (C-RAN) is a promising paradigm to meet the stringent requirements of the fifth generation (5G) wireless systems. Meanwhile, wireless traffic prediction is a key enabler for C-RANs to improve both the spectrum efficiency and energy efficiency through load-aware network managements. This p…
Data-driven methods for improving turbulence modeling in Reynolds-Averaged Navier-Stokes (RANS) simulations have gained significant interest in the computational fluid dynamics community. Modern machine learning algorithms have opened up a new area of black-box turbulence models allowing for the tuning of RANS simulati…
Paper proposes RAN for better anomaly detection in time series data.
problem Anomaly detection algorithms often fail to accurately detect anomalies due to incomplete reconstruction of anomaly data.
method RAN uses adversarial learning and latent vector-constrained Autoencoder to ensure consistent reconstruction of anomaly data.
result RAN outperforms other algorithms in detecting meaningful anomalies with higher AUC-ROC scores.
Bayesian optimization outperformed random search in machine learning hyperparameter tuning challenge.
problem Optimizing hyperparameters of machine learning models using derivative-free methods.
method Bayesian optimization vs. random search on real datasets.
result Bayesian optimization significantly outperformed random search in held-out objective functions.
This paper introduces a Decision Tree Learner as an early warning system for classification of the non-life insurance companies according to their financial solid as strong, moderate, weak, or insolvency. In this study, we ran several experiments to show that the proposed model can achieve a good result using standard …
The remarkable success of machine learning, especially deep learning, has produced a variety of cloud-based services for mobile users. Such services require an end user to send data to the service provider, which presents a serious challenge to end-user privacy. To address this concern, prior works either add noise to …
Optimal estimator for discrete distributions from faulty batches.
problem Estimating discrete distributions from batches, some of which may be unreliable.
method First polynomial-time estimator achieving optimal accuracy in number of batches.
result Optimal estimation accuracy in polynomial time.
Markov networks are widely used in many Machine Learning applications including natural language processing, computer vision, and bioinformatics . Learning Markov networks have many complications ranging from intractable computations involved to the possibility of learning a model with a huge number of parameters. In t…
Constructs hyperbolic surfaces with small eigenvalues.
problem Finding hyperbolic surfaces with eigenvalues below a given threshold.
method Geometric proof using techniques from B.Randol's 1974 paper.
result Constructs closed hyperbolic covering surfaces with eigenvalues less than any small positive number ε.
To improve the quality of computation experience for mobile devices, mobile-edge computing (MEC) is a promising paradigm by providing computing capabilities in close proximity within a sliced radio access network (RAN), which supports both traditional communication and MEC services. Nevertheless, the design of computat…
GABI learns geometry from diverse systems to improve Bayesian inference.
problem Bayesian inversion of physical systems with varying geometries.
method Geometric Autoencoders for Bayesian Inversion (GABI) learns geometry-aware priors from large datasets.
result GABI yields comparable predictive accuracy to deterministic methods and well-calibrated uncertainty quantification.
New algorithm learns decision trees faster than before.
problem Properly learning decision trees in polynomial time.
method Membership query algorithm with nO(loglogn) time complexity. result Achieved faster learning time for decision trees.
Extends Kollár's result to fibered Calabi-Yau varieties with cohomological assumption.
problem Deformations of fibered Calabi-Yau varieties under cohomological constraints.
method Hodge theoretic techniques and T1-lifting criterion of Kawamata-Ran. result Small deformations of fibered Calabi-Yau varieties remain fibered.
Paper uses CNN to predict stock price movement as an image classification problem.
problem Predicting stock price movement using machine learning.
method CNN-based model for classifying stock price movement based on the first hour of trading.
result The algorithm effectively separated between stock price movement classes and outperformed other strategies.
New method targets vaccines for new variants using Thompson sampling.
problem Deciding how to prioritize vaccines for new variants with delayed feedback.
method Partial likelihood Thompson sampling, updating beliefs with partial likelihood.
result Method effectively prioritizes vaccines based on real-world data.
We provide tight finite-time convergence bounds for gradient descent and stochastic gradient descent on quadratic functions, when the gradients are delayed and reflect iterates from τ rounds ago. First, we show that without stochastic noise, delays strongly affect the attainable optimization error: In fact, the error…
We investigate time-dependent data analysis from the perspective of recurrent kernel machines, from which models with hidden units and gated memory cells arise naturally. By considering dynamic gating of the memory cell, a model closely related to the long short-term memory (LSTM) recurrent neural network is derived. E…
The Classification Literature Automated Search Service, an annual bibliography based on citation of one or more of a set of around 80 book or journal publications, ran from 1972 to 2012. We analyze here the years 1994 to 2011. The Classification Society's Service, as it was termed, has been produced by the Classificati…
Study compares deep learning stock trading strategies in adverse market conditions.
problem Comparing deep learning models for stock trading performance in extreme market downturns.
method Reconstructed three deep learning models and compared their strategies through trading simulations.
result Deep learning models, especially LSTM, can mitigate losses in severe market downturns.
Motivated by an abstract notion of low-level edge detector filters, we propose a simple method of unsupervised feature construction based on pairwise statistics of features. In the first step, we construct neighborhoods of features by regrouping features that correlate. Then we use these subsets as filters to produce n…
Formula conjectured for rational cuspidal curves in projective plane.
problem Counting rational cuspidal curves in projective plane.
method Extending Kontsevich's recursion formula and using geometric input about tangency of curves at nodal points.
result Conjectural formula agrees with earlier computations and extends to rational quartics with E6 singularity.
With this study we investigate the accuracy of deep learning models for the inference of Reynolds-Averaged Navier-Stokes solutions. We focus on a modernized U-net architecture, and evaluate a large number of trained neural networks with respect to their accuracy for the calculation of pressure and velocity distribution…
The ability to perform effective off-policy learning would revolutionize the process of building better interactive systems, such as search engines and recommendation systems for e-commerce, computational advertising and news. Recent approaches for off-policy evaluation and learning in these settings appear promising. …
Paper uses deep reinforcement learning for network slicing and traffic prediction.
problem Managing dynamic network slices while maintaining QoS in a 5G environment.
method Integrates LSTM for traffic prediction and DDRL for distributed decision-making.
result Significant improvements in network performance, reducing QoS violations.
New framework promotes reproducible, domain-agnostic reinforcement learning algorithms.
problem Domain-specific, compute-resource-maximizing, and non-reproducible participant solutions in reinforcement learning competitions.
method Submission retraining, domain randomization, desemantization through domain obfuscation, and compute/environment-sample budget limitation.
result Participant submissions are reproducible, non-specific to the competition environment, and sample/resource efficient.
ION-C solves overlapping network integration problems efficiently.
problem Integrating overlapping networks with different datasets.
method Formulated as an ASP problem and solved with clingo.
result Significantly improved efficiency in runtime and solution graphs.
LDP speeds up causal discovery by partitioning, improving VAS recall and runtime.
problem Hard causal discovery in nonparametric settings with exponential complexity.
method Local Discovery by Partitioning (LDP) for causal inference around exposure-outcome pairs.
result LDP yields less biased and more precise estimates than baseline methods.
Supervised learning algorithms are nowadays successfully scaling up to datasets that are very large in volume, leveraging the potential of in-memory cluster-computing Big Data frameworks. Still, massive datasets with a number of large-domain categorical features are a difficult challenge for any classifier. Most off-th…
Authors provide a fair comparison of GNNs for graph classification.
problem Lack of reproducibility and rigorousness in experimental procedures for GNNs.
method Controlled and uniform framework with over 47,000 experiments.
result GNNs do not fully exploit structural information on some datasets.
While social networks can provide an ideal platform for up-to-date information from individuals across the world, it has also proved to be a place where rumours fester and accidental or deliberate misinformation often emerges. In this article, we aim to support the task of making sense from social media data, and speci…
Geometric pruning rules improve change point detection in multiple time series.
problem Detecting multiple changes in multiple independent time series.
method Dynamic programming algorithms with inequality-based and geometric pruning rules.
result Geometric pruning rules offer close-to-linear time complexity for multiple independent time series.
Access to high-quality education at scale is limited by the difficulty of providing student feedback on open-ended assignments in structured domains like computer programming, graphics, and short response questions. This problem has proven to be exceptionally difficult: for humans, it requires large amounts of manual w…
Paper predicts turbulent flows using physics-informed deep learning.
problem Predicting turbulent flows from fluid simulations.
method Hybrid approach combining RANS and LES with trainable spectral filters and U-net.
result Significant reduction in prediction error for 60 frames ahead.
New bandit algorithm detects and adapts to seasonal changes in rewards.
problem Adapting to abrupt changes in user preferences during events.
method Detects and adapts to seasonal changes in reward function.
result Outperforms state-of-the-art algorithms for non-stationary environments.
Improved surrogate model for field-valued QoIs using LF and HF simulations.
problem Accurate and efficient modeling of field-valued quantities under uncertain inputs.
method Bifidelity Karhunen-Loève expansion with active learning.
result Consistent improvements in predictive accuracy and sample efficiency.
New algorithm estimates robust Gaussian covariance in nearly matrix multiplication time.
problem Estimating robust covariance from corrupted Gaussian samples.
method Developed a novel algorithm achieving near-optimal error in Mahalanobis norm with runtime nearly matrix multiplication time.
result Achieved the same statistical guarantees as previous work but with no dependence on ε in runtime.
MultiImport infers node importance from multiple KG signals.
problem Inferring node importance in a knowledge graph from multiple input signals.
method End-to-end latent variable model using attentive graph neural networks.
result MultiImport consistently outperforms existing methods, achieving up to 23.7% higher NDCG@100.
Adversarial Regression uses GANs for non-linear regression with uncertainty estimation.
problem Performing high-dimensional non-linear regression with uncertainty estimation.
method Conditional Generative Adversarial Network (CGAN) approach.
result CGANs provide an approximate predictive distribution for new observations.
Machine learning models outperform traditional actuarial methods in predicting health insurance costs.
problem Improving accuracy in health insurance pricing to identify concession opportunities.
method Developed and evaluated two machine learning models at the patient and employer-group levels.
result Machine learning models outperformed traditional actuarial models by 20% in predicting costs.
Study benchmarks contextual bandit algorithms for precision oncology using in vitro data.
problem Designing effective protocols for individual treatment assignment in precision oncology.
method Proposed a benchmark dataset of in vitro drug responses to evaluate contextual bandit algorithms.
result Bayesian bandit algorithms performed better than a rule-based baseline in minimizing regret.