CrossWalk enhances fairness in graph algorithms by biasing random walks.
problem Fairness in machine learning systems applied to graphs.
method Bias random walks to cross group boundaries by upweighting edges.
result Enhances fairness in various graph algorithms with minimal performance loss.
Enhances projection pursuit tree classifier with visual diagnostics for better multi-class classification.
problem Rigidity of original algorithm limits performance in complex high-dimensional classification problems.
method Allowing more splits and flexible class groupings in projection pursuit computation, and developing visual diagnostics.
result Demonstrates enhanced classifier performs as intended through interactive visual diagnostics.
This paper tackles unsupervised speech enhancement using RVAE and proposes efficient sampling methods.
problem Unsupervised speech enhancement with high computational complexity.
method Recurrent variational autoencoder (RVAE) combined with Langevin dynamics and Metropolis-Hasting sampling.
result Sampling-based algorithms outperform VEM and achieve robust generalization.
In this paper we demonstrate spoken speech enhancement using electroencephalography (EEG) signals using a generative adversarial network (GAN) based model, gated recurrent unit (GRU) regression based model, temporal convolutional network (TCN) regression model and finally using a mixed TCN GRU regression model. We comp…
Efficient algorithm reduces communication costs in sparse regression.
problem Sparse linear regression with massive data.
method CESDAR algorithm, communication-efficient surrogate likelihood.
result Achieves same statistical accuracy as global estimator with reduced communication.
Quantum algorithms can enhance machine learning in different aspects. Here, we study quantum-enhanced least-square support vector machine (LS-SVM). Firstly, a novel quantum algorithm that uses continuous variable to assist matrix inversion is introduced to simplify the algorithm for quantum LS-SVM, while retaining expo…
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.
In this paper, prediction for linear systems with missing information is investigated. New methods are introduced to improve the Mean Squared Error (MSE) on the test set in comparison to state-of-the-art methods, through appropriate tuning of Bias-Variance trade-off. First, the use of proposed Soft Weighted Prediction …
Enhanced DQN model boosts trading performance with advanced techniques.
problem Improving automated trading performance in financial markets.
method Incorporation of Prioritized Experience Replay, Regularized Q-Learning, Noisy Networks, Dueling, Double DQN, and CNN architectures.
result Significantly improved returns and Sharpe Ratio compared to the original DQN model.
Enhances quantum computing for symmetrical systems, proving a new class of problems.
problem Proving the efficiency of a new quantum computing model for symmetrical systems.
method Introducing equivariant convolutional quantum algorithms tailored for SU(d) symmetries.
result Demonstrates a problem that can be solved efficiently on a new quantum model, suggesting it's not classically simulatable.
Recently, there has been a trend to combine independent component analysis and canonical polyadic decomposition (ICA-CPD) for an enhanced robustness for the computation of CPD, and ICA-CPD could be further converted into CPD of a 5th-order partially symmetric tensor, by calculating the eigenmatrices of the 4th-order cu…
Adversarial examples are intentionally perturbed images that mislead classifiers. These images can, however, be easily detected using denoising algorithms, when high-frequency spatial perturbations are used, or can be noticed by humans, when perturbations are large. In this paper, we propose EdgeFool, an adversarial im…
This work shows how to efficiently simulate parts of quantum landscapes using classical computers.
problem Identifying where quantum computers are advantageous and offloading computations.
method Developed a quantum-enhanced classical algorithm to simulate sub-regions of quantum landscapes.
result It is possible to generate a classical surrogate of a sub-region of a quantum landscape.
Enhanced hedging for S&P 500 options using volatility surface data.
problem Optimizing hedging strategies for S&P 500 options with transaction costs.
method Deep policy gradient reinforcement learning with volatility surface feedback.
result Outperforms conventional hedging methods in simulations and backtesting.
This paper focuses on single-channel semi-supervised speech enhancement. We learn a speaker-independent deep generative speech model using the framework of variational autoencoders. The noise model remains unsupervised because we do not assume prior knowledge of the noisy recording environment. In this context, our con…
Quantum machine learning models can approximate any continuous function.
problem Theoretical understanding of quantum feature maps in machine learning.
method Proving universal approximation property of quantum machine learning models in quantum-enhanced feature spaces.
result Quantum machine learning models are universal approximators of continuous functions.
Computers are increasingly used to make decisions that have significant impact in people's lives. Often, these predictions can affect different population subgroups disproportionately. As a result, the issue of fairness has received much recent interest, and a number of fairness-enhanced classifiers and predictors have…
Fuzzy c-means based clustering algorithms are frequently used for Takagi-Sugeno-Kang (TSK) fuzzy classifier antecedent parameter estimation. One rule is initialized from each cluster. However, most of these clustering algorithms are unsupervised, which waste valuable label information in the training data. This paper p…
Enhanced privacy, utility, and efficiency through MUST subsampling.
problem Balancing privacy, utility, and computational efficiency in data analysis.
method MUltistage Sampling Technique (MUST) for privacy amplification in differential privacy.
result MUST offers stronger privacy guarantees (ϵ) than one-stage subsampling methods while maintaining similar utility and computational efficiency. 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.
New algorithm improves stability of optimization algorithms by adapting step-size.
problem Optimization algorithms' effectiveness is sensitive to step-size hyperparameters.
method Adapts NGN step-size method with momentum to enhance stability.
result Achieves convergence rate of O(1/√K) without restrictive assumptions.
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…
Enhances ZSL models with biologically inspired feature enhancement.
problem Limited training data leads to poor feature extraction from pre-trained models.
method Dual-channel learning framework using auxiliary data sets.
result Improves ZSL model's generalization ability and achieves state-of-the-art results.
We propose a privacy-enhanced matrix factorization recommender that exploits the fact that users can often be grouped together by interest. This allows a form of "hiding in the crowd" privacy. We introduce a novel matrix factorization approach suited to making recommendations in a shared group (or nym) setting and the …
SEDA improves RLDA for high-dimensional data.
problem Inconsistent performance of RLDA in high-dimensional scenarios.
method Developed a non-asymptotic approximation of misclassification rate, derived new theoretical results on eigenvectors, and proposed SEDA algorithm.
result SEDA achieves higher classification accuracy and dimensionality reduction compared to existing LDA methods.
Enhanced decision-making through Dreamer's anticipatory trajectories and Online Decision Transformer.
problem Efficiently integrating world models with decision transformers.
method Combining Dreamer's trajectory forecasting with Online Decision Transformer's adaptive learning.
result Notable improvements in sample efficiency and reward maximization.
Enhanced DFO using adaptive batch-based FD estimates.
problem Derivative-free optimization with imprecise gradient estimates.
method Adaptive batch-based finite difference estimation and dynamic sampling strategy.
result Algorithm achieves convergence rate similar to KW and SPSA methods.
Improving speech system performance in noisy environments remains a challenging task, and speech enhancement (SE) is one of the effective techniques to solve the problem. Motivated by the promising results of generative adversarial networks (GANs) in a variety of image processing tasks, we explore the potential of cond…
Improved YOLOv5 model detects mask-wearing with enhanced accuracy.
problem Detecting mask-wearing in high traffic public places.
method Improved YOLOv5l with Multi-Head Attentional Self-Convolution, Swin Transformer Block, I-CBAM module, and enhanced feature fusion.
result 1.1% improvement in mAP(0.5) and 1.3% improvement in mAP(0.5:0.95) compared to YOLOv5l.
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.
DAC enhances exploration in reinforcement learning with entropy regularization.
problem Improving exploration efficiency in reinforcement learning.
method Sample-aware entropy regularization using replay buffer action distributions.
result DAC significantly outperforms existing algorithms in reinforcement learning tasks.
A new algorithm enhances minority class representation in imbalanced datasets.
problem Improving classification performance on imbalanced datasets.
method PO-QG algorithm using Proxima-Orion neighbors and q-Gaussian weighting.
result The PO-QG algorithm improves overall classification performance.
Expands sparse disparity cues from LiDAR to improve stereo matching performance.
problem Improving stereo estimation performance with limited dense data.
method Proposes a sparsity expansion technique to enhance local features from sparse disparity cues.
result Significantly boosts stereo algorithms with sparse cues, outperforming previous methods.
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.
As surrogate functions of L0-norm, many nonconvex penalty functions have been proposed to enhance the sparse vector recovery. It is easy to extend these nonconvex penalty functions on singular values of a matrix to enhance low-rank matrix recovery. However, different from convex optimization, solving the nonconvex l…
Quantum machine learning boosts financial forecasting accuracy.
problem Churn prediction and credit risk assessment in finance.
method Used quantum and classical Determinantal Point Processes for churn prediction, and quantum neural networks for credit risk assessment.
result Significant improvement in precision for churn prediction (6% increase). Quantum models match classical performance with fewer parameters.
Paper proposes GEG to enhance fairness in binary and multi-class classification.
problem Fairness in multi-class classification tasks is under-explored.
method Formulates multi-objective problem between effectiveness and fairness constraints, proposes GEG algorithm.
result GEG improves fairness up to 92% and decreases accuracy up to 14%.
Enhances RL for jump processes using MSBVE algorithm.
problem Challenges in continuous-time RL with jumps and noise.
method Introduces MSBVE algorithm to minimize quadratic variation error.
result MSBVE algorithm outperforms MSTDE in jump processes.
TinyLSTMs reduces speech enhancement model size and latency for hearing aids.
problem Large RNNs limit practical deployment in hearing aid hardware.
method Model compression techniques (pruning, integer quantization, state update skipping) for RNN speech enhancement.
result Reduction in model size and operations by 11.9imes and 2.9imes, respectively, without perceptual degradation. Enhanced ROOT-SGD optimizes stochastic optimization with diminishing stepsizes.
problem Improving statistical efficiency in stochastic optimization.
method Integrates a diminishing stepsize strategy into ROOT-SGD.
result Achieves optimal convergence rates with improved stability and precision.
Variational autoencoders are powerful algorithms for identifying dominant latent structure in a single dataset. In many applications, however, we are interested in modeling latent structure and variation that are enriched in a target dataset compared to some background---e.g. enriched in patients compared to the genera…
We propose a method for downlink coordinated multipoint (DL CoMP) in heterogeneous fifth generation New Radio (NR) networks. The primary contribution of our paper is an algorithm to enhance the trigger of DL CoMP using online machine learning. We use support vector machine (SVM) classifiers to enhance the user downlink…
Random shuffle method boosts HF dataset size 10-21 times.
problem Narrow dataset cardinality in HF clinical studies.
method Random shuffle method to enhance dataset size.
result Enhanced HF dataset size 10-21 times.
Enhanced Lion optimizer CLion improves generalization with lower error.
problem Lion optimizer's generalization analysis is lacking.
method Algorithmic stability analysis and cautious sign function use.
result CLion has a lower generalization error of O(N1). In the past decade, the field of quantum machine learning has drawn significant attention due to the prospect of bringing genuine computational advantages to now widespread algorithmic methods. However, not all domains of machine learning have benefited equally from quantum enhancements. Notably, deep learning and rein…
Enhanced word embedding creates new consumer-friendly health terms.
problem Laymen's health terms are often jargon and hard to understand.
method Developed an enhanced GloVe word embedding technique to generate new consumer-friendly terms.
result New CHV terms generated from consumer-generated text.
The lack of interpretability often makes black-box models difficult to be applied to many practical domains. For this reason, the current work, from the black-box model input port, proposes to incorporate data-based prior information into the black-box soft-margin SVM model to enhance its interpretability. The concept …
Paper detects and estimates breaks in high-dimensional functional time series.
problem Detecting and estimating structural breaks in heterogeneous mean functions of high-dimensional functional time series.
method Proposes a new test statistic combining functional CUSUM and power enhancement components, with a clustering algorithm for group structure estimation.
result The proposed techniques have satisfactory performance in finite samples, detecting and estimating breaks effectively.