New model detects gradual changes in processes more accurately.
problem Traditional change-point models fail to identify gradual changes effectively.
method Introduces a Bayesian change-dynamic model using hierarchical models for gradual change detection.
result The model identifies gradual changes faster and more accurately than traditional models.
Self-training improves gradual domain adaptation with unlabeled data.
problem Improving machine learning models' adaptability to gradually shifting data distributions.
method Proved upper bounds on self-training error, highlighted the importance of regularization and label sharpening, and demonstrated algorithmic insights.
result Self-training works well for gradual shifts, especially with small Wasserstein-infinity distance.
Scales gradual pattern discovery from imprecise data.
problem Managing large collections of gradual patterns from imprecise data.
method Introduces gradualness thresholds and considers attribute value distribution.
result Eliminates noise patterns, showing a smaller set of meaningful patterns.
Gradual ML improves ALSA with less manual labeling.
problem Lack of high-quality labeled data for ALSA.
method Gradual machine learning for automatic labeling of ALSA tasks.
result Performance surpasses unsupervised and supervised alternatives.
Gradually Truncated Log-normal distribution - Size distribution of firms Abstract Many natural and economical phenomena are described through power law or log- normal distributions. In these cases, probability decreases very slowly with step size compared to normal distribution. Thus it is essential to cut-off these di…
IUPM monitors machine learning models under gradual shifts using optimal transport and active labeling.
problem Gradual distribution shifts lead to unnoticed accuracy declines in machine learning models.
method Incremental Uncertainty-aware Performance Monitoring (IUPM) using optimal transport and active labeling.
result IUPM outperforms existing baselines in gradual shift scenarios and guides label acquisition more effectively.
A new method uses normalizing flows for gradual domain adaptation.
problem Difficulty in domain adaptation when source and target domains have a large gap.
method Proposes using normalizing flows to learn a transformation from target to Gaussian mixture distribution.
result Improves classification performance and mitigates the problem of gradual self-training failure.
American options in a multi-asset market model with proportional transaction costs are studied in the case when the holder of an option is able to exercise it gradually at a so-called mixed (randomised) stopping time. The introduction of gradual exercise leads to tighter bounds on the option price when compared to the …
Usually considered as a classification problem, entity resolution (ER) can be very challenging on real data due to the prevalence of dirty values. The state-of-the-art solutions for ER were built on a variety of learning models (most notably deep neural networks), which require lots of accurately labeled training data.…
Gradual domain adaptation improves model transfer between domains with intermediate training.
problem Challenges in unsupervised domain adaptation when distribution shifts are large.
method Gradual self-training using intermediate domains along the Wasserstein geodesic.
result GOAT framework generates intermediate domains for improved adaptation.
A cost-effective framework for gradual domain adaptation using multifidelity.
problem Degrading prediction performance due to large domain distance.
method Combines multifidelity and active domain adaptation.
result Improves prediction performance with reduced sample cost.
A game theory study examines gradual concessions in variable contribution games under uncertainty.
problem Gradualism in contribution games due to free rider effect.
method Stochastic game analysis of variable contribution games, extending Nerlove-Arrow model.
result Equilibrium characterized by regular control strategies leading to gradual concession.
Improved analysis of gradual domain adaptation with better generalization bounds.
problem Improving generalization in target domain through intermediate unlabeled domains.
method Analyzed gradual self-training under more general assumptions, proving a new generalization bound.
result Proved a significantly improved generalization bound of ε0 + O(TΔ + T/√n) + ˜O(1/√nT).
BRPC online Bayesian calibration handles gradual and abrupt system changes.
problem Aligning model outputs with field observations in evolving systems.
method Bayesian Recursive Projected Calibration (BRPC) for streaming data under simulator mismatch and nonstationarity.
result Improves calibration accuracy under gradual changes and robustness under abrupt regime shifts.
GROVER improves word representations by gradually adding random noises during training.
problem Improving word representations for better model performance.
method Gradually adding random noises to word embeddings during training.
result GROVER improves model performances on most text classification datasets.
Paper proposes a method to design molecules with specific properties.
problem Designing molecules with desired chemical and biological properties.
method Energy-based model in latent space, SGDS algorithm for gradual distribution shifting.
result Method achieves strong performances on various molecule design tasks.
This paper describes audEERING's submissions as well as additional evaluations for the One-Minute-Gradual (OMG) emotion recognition challenge. We provide the results for audio and video processing on subject (in)dependent evaluations. On the provided Development set, we achieved 0.343 Concordance Correlation Coefficien…
Paper detects gradual changes in cluster structure using MC fusion.
problem Detecting gradual changes in cluster structure over time.
method MC fusion for multiple mixture numbers, examining MC transition.
result Accurately captures cluster structure during transitional periods.
The paper tackles gradual domain adaptation with manifold-constrained DRO, showing error bounds across distributions.
problem Gradual domain adaptation challenge with manifold-constrained data distributions.
method Distributionally Robust Optimization (DRO) with an adaptive Wasserstein radius.
result Theoretical bounds on classification error across distributions, demonstrating error propagation dynamics.
Game (Israeli) options in a multi-asset market model with proportional transaction costs are studied in the case when the buyer is allowed to exercise the option and the seller has the right to cancel the option gradually at a mixed (or randomised) stopping time, rather than instantly at an ordinary stopping time. Allo…
New concept of mixture complexity helps detect gradual clustering changes.
problem Determining the number of clusters in mixture models with overlaps and weight biases.
method Introducing mixture complexity (MC) as a new measure of cluster size, defined from information theory.
result MC can detect gradual clustering changes, allowing earlier detection and finer distinction.
Recurrent Neural Networks (RNNs) achieve state-of-the-art results in many sequence-to-sequence modeling tasks. However, RNNs are difficult to train and tend to suffer from overfitting. Motivated by the Data Processing Inequality (DPI), we formulate the multi-layered network as a Markov chain, introducing a training met…
In informationally efficient financial markets, option prices and this implied volatility should immediately be adjusted to new information that arrives along with a jump in underlying's return, whereas gradual changes in implied volatility would indicate market inefficiency. Using minute-by-minute data on S&P 500 inde…
It is challenging for stochastic optimizations to handle large-scale sensitive data safely. Recently, Duchi et al. proposed private sampling strategy to solve privacy leakage in stochastic optimizations. However, this strategy leads to robustness degeneration, since this strategy is equal to the noise injection on each…
We study an optimal execution problem in the presence of market impact where the security price follows a geometric Ornstein-Uhlenbeck process, which implies the mean-reverting property, and show that the optimal strategy is a mixture of initial/terminal block liquidation and gradual intermediate liquidation. The mean-…
Deep neural network detects changepoints at multiple scales in multivariate time series.
problem Detecting gradual and abrupt changes in multivariate time series data.
method Proposed a pyramid recurrent neural network (PRN) for multi-scale changepoint detection.
result PRN outperforms state-of-the-art methods in detecting changepoints at multiple scales.
Algorithm learns to solve tasks by gradually expanding policy space.
problem Reinforcement learning difficulty progression.
method Decreasingly constrained policy space expansion.
result Superior learning rate in Tetris tasks.
Masking diffusion outperforms other discrete diffusion models by incorporating jump times into the model.
problem Improving the performance of discrete diffusion models.
method Conditioning on the jump schedule of discrete Markov processes.
result Schedule-conditioned discrete diffusion (SCUD) models outperform classical and masking diffusion models.
Clusters of withdrawals emerge in banks due to latent fragility.
problem Understanding clustered withdrawals in dynamic bank runs.
method Mean-field game framework to model dynamic bank runs with clustered withdrawals.
result Existence of equilibrium and characterization of earliest-run and latest-run equilibria.
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.
Optimizes gradual reduction of excess carbon emissions to net-zero.
problem Achieving net-zero carbon emissions through gradual reduction of excess emissions.
method Stochastic control approach to identify optimal emission strategy under constraints.
result Identifies the emission strategy that maximizes future profit from excess emissions.
Proposes a method for clearer counterfactual explanations of deep networks.
problem Unclear explanations from current counterfactual methods.
method Gradual construction of explanations through masking and composition steps.
result Produces human-friendly, interpretable explanations with fewer modifications.
In unsupervised learning, there is no apparent straightforward cost function that can capture the significant factors of variations and similarities. Since natural systems have smooth dynamics, an opportunity is lost if an unsupervised objective function remains static during the training process. The absence of concre…
Generative diffusion models gradually memorize training data, losing independent dimensions.
problem Understanding how generative diffusion models memorize training data, especially on low-dimensional manifolds.
method Measuring latent dimensionality via the learned score field, proposing a geometric memorization theory.
result Generative diffusion models experience a smooth collapse of their capacity to vary across independent directions as data become scarce, leading to near point-wise replication of salient features.
Multilayer bootstrap network builds a gradually narrowed multilayer nonlinear network from bottom up for unsupervised nonlinear dimensionality reduction. Each layer of the network is a nonparametric density estimator. It consists of a group of k-centroids clusterings. Each clustering randomly selects data points with r…
A new method guides neural networks to focus on specific features of input data.
problem Training neural networks to consider specific features of input data.
method Focus-and-Expand ( ax) method: Gradual manipulation of input features.
result Achieves state-of-the-art results in bias removal and image classification tasks.
Gradual pruning reduces inference cost by pruning least important channels during training.
problem Reduction of deep neural network inference cost.
method Gradual channel pruning using feature relevance scores during training.
result Achieved significant model compression with minimal accuracy loss.
This short paper describes our solution to the 2018 IEEE World Congress on Computational Intelligence One-Minute Gradual-Emotional Behavior Challenge, whose goal was to estimate continuous arousal and valence values from short videos. We designed four base regression models using visual and audio features, and then use…
Large batch training improves deep learning performance without needing warmup.
problem Slow convergence at early epochs in large batch training.
method Proposes CLARS algorithm and analyzes convergence rate.
result Proposed algorithm outperforms gradual warmup and state-of-the-art large-batch optimizers.
New algorithm for nonstationary multi-armed bandits with optimal performance.
problem Nonstationary multi-armed bandits with changing model parameters over time.
method Adaptive Resetting Bandit (ADR-bandit) algorithm using adaptive windowing techniques.
result ADR-bandit achieves nearly optimal performance in both abrupt and gradual changes.
A new deep learning model speeds up MRI by reconstructing from undersampled data.
problem Slow MRI due to undersampling in k-space.
method Unrolling primal-dual hybrid gradient algorithm into a deep network, gradually relaxing constraints.
result Superior MR reconstructions from highly undersampled data.
New algorithm for ML models in gradually adapting data settings.
problem Training models when data distribution reacts to the model over time.
method Stateful Performative Gradient Descent (Stateful PerfGD)
result Stateful PerfGD minimizes performative loss in gradually adapting data settings.
BS-NAS broadens and shrinks search space for optimal neural architectures.
problem Suboptimal channel numbers and model averaging effects in One-Shot NAS methods.
method Broadening with spring block for channel search, shrinking with underperforming operations removal, evolutionary algorithm for optimal architecture search.
result BS-NAS achieves state-of-the-art performance on ImageNet.
We introduce Mix&Match (M&M) - a training framework designed to facilitate rapid and effective learning in RL agents, especially those that would be too slow or too challenging to train otherwise. The key innovation is a procedure that allows us to automatically form a curriculum over agents. Through such a curriculum …
New method optimizes unknown functions adaptively.
problem Tuning hyperparameters in machine learning.
method Gradually and adaptively optimizing an unknown function using estimated gradients.
result Advantages for tuning high dimensional hyperparameters in machine learning.
Cost-efficient distributed learning via combinatorial bandits.
problem Trade-off between error and runtime in distributed SGD.
method Combinatorial multi-armed bandit model to learn fastest workers.
result Significantly lower errors with same computational efforts and less communication.
Paper proposes a method to train generative networks with minimized Wasserstein distance.
problem Training generative networks to match target distributions accurately.
method Gradual, semi-discrete approach via explicit Wasserstein minimization.
result The approach minimizes Wasserstein distance to both empirical and population target distributions.
In this work, we propose a subspace-based algorithm for DOA estimation which iteratively reduces the disturbance factors of the estimated data covariance matrix and incorporates prior knowledge which is gradually obtained on line. An analysis of the MSE of the reshaped data covariance matrix is carried out along with c…