A new algorithm selects web links to maximize revenue while ensuring user attractiveness.
problem Selecting web links to maximize revenue from multi-level feedbacks.
method Constrained Upper Confidence Bound (Con-UCB) algorithm for stochastic multi-armed bandit.
result Proves O ( T ln T ) O(\sqrt{T\ln T}) O ( T ln T ) bounds on regret and attractiveness constraint violation. Proposes a multi-level learning approach for 3D object recognition.
problem Improving 3D object recognition accuracy through multi-scale spatial features.
method End-to-end multi-level learning on a multi-level voxel grid.
result Comparable object recognition performance with lower memory usage.
New algorithm trains binary-activation, multi-level RNNs for noise-resilient, ADC-/DAC-free PIM inference.
problem Training noise-resilient, ADC-/DAC-free neural networks.
method Binary activations and multi-level weights for eNVM-based processing-in-memory circuits.
result Higher accuracy and noise resilience for recurrent networks compared to existing methods.
Enhances machine learning accuracy with multi-level training data.
problem Improving accuracy of machine learning algorithms for differential equations.
method Combining coarse and fine resolution training data.
result Significant gains in accuracy over single-level algorithms.
The paper tackles multi-level fairness in algorithmic systems, addressing bias at both individual and structural levels.
problem Algorithmic systems can unfairly impact marginalized groups, especially when considering only individual-level bias.
method Formalizes multi-level fairness using causal inference tools, addressing effects of sensitive attributes at multiple levels.
result Illustrates the importance of accounting for macro-level sensitive attributes in fairness assessments.
A neuro-inspired architecture learns without supervision using clustering and predictive coding.
problem Achieving continual learning without supervision.
method Neuro-inspired architecture based on online clustering and hierarchical predictive coding.
result The architecture achieves continual learning without supervision.
Study active learning for multi-level user preferences in recommendation systems.
problem Efficiently learning user preferences through active querying in recommendation systems.
method Proposes a theoretically optimal active learning strategy based on Fisher information matrix for collective matrix factorization.
result Demonstrates strong improvements over active learning methods in personalized, cold-start, and noisy data settings.
This paper proposes a method to improve few-shot learning by generating multi-level weight-centric features.
problem Improving few-shot learning performance by leveraging both representation power and weight generation capacity.
method A multi-level weight-centric feature learning approach with a weight-centric training strategy and multi-level feature incorporation.
result Significantly outperforms existing methods in low-shot classification benchmarks.
We introduce in this paper a new way of optimizing the natural extension of the quantization error using in k-means clustering to dissimilarity data. The proposed method is based on hierarchical clustering analysis combined with multi-level heuristic refinement. The method is computationally efficient and achieves bett…
This paper proposes a web-based visual graph analytics platform for interactive graph mining, visualization, and real-time exploration of networks. GraphVis is fast, intuitive, and flexible, combining interactive visualizations with analytic techniques to reveal important patterns and insights for sense making, reasoni…
Estimates parameters of high-dimensional Bernoulli autoregressive process with long-range dependence.
problem Estimating parameters of a multivariate Bernoulli process with auto-regressive feedback in high dimensions.
method Proposes and analyzes an ℓ 1 \ell_1 ℓ 1 -regularized maximum likelihood estimator (MLE) under the assumption of approximate sparsity. result Derives precise upper bounds on mean-squared estimation error.
New algorithms solve complex multi-level optimization problems with improved efficiency.
problem Smooth stochastic multi-level composition optimization problems.
method Two algorithms using moving-average and linearized stochastic estimates.
result Achieved sample complexities of O(1/ε^4) and O(1/ε^6).
PFPN improves salient object detection by progressively polishing multi-level features.
problem Improving salient object detection by refining multi-level features.
method Progressive Feature Polishing Network (PFPN) with Feature Polishing Modules (FPMs).
result PFPN achieves superior performance on five benchmark datasets without post-processing.
A distributed SGD method for heterogeneous networks with hubs and workers.
problem Learning in heterogeneous multi-level networks with worker heterogeneity and varying communication.
method Multi-Level Local SGD: distributed SGD with hub-and-spoke paradigm and hub averaging.
result The method converges with error dependent on worker heterogeneity, hub network topology, and iterations.
A new method for solving complex sequential decision-making problems by decomposing them into multiple levels.
problem Sequential decision-making with natural multi-level structure.
method Multi-level meta-reinforcement learning with skill-based curriculum.
result Efficiently reduces stochasticity and policy search space, leading to fewer iterations and computations.
Paper proposes a deep subspace clustering method using multi-level representations.
problem Deep subspace clustering of images.
method Convolutional autoencoders with multiple fully-connected layers for multi-level representations, loss minimization with iterative updates.
result The method outperforms state-of-the-art methods on real-world datasets.
This paper tackles tensor recovery from noisy and multi-level quantized measurements.
problem Tensors from multi-level quantized measurements.
method Nonconvex optimization problem with alternating proximal gradient descent.
result The recovery error diminishes to zero with increasing tensor dimensions.
New method for optimizing complex composite functions with reduced variance.
problem Optimizing multi-level composite functions with nested random and smooth mappings.
method Normalized proximal approximate gradient (NPAG) method with nested stochastic variance reduction.
result Total sample complexity of O ( ε − 3 ) O(ε^{-3}) O ( ε − 3 ) in expectation and O ( N + N ε − 2 ) O(N+\sqrt{N}ε^{-2}) O ( N + N ε − 2 ) in finite-sum cases. MAOP learns object dynamics from raw visual data.
problem Efficient learning of dynamics from raw visual data for multiple objects.
method Three-level learning architecture with spatial-temporal relational reasoning.
result Significantly outperforms previous methods in sample efficiency and generalization.
Optimal gradient quantization reduces communication costs in distributed deep learning.
problem High communication costs in distributed training of deep neural networks.
method Deduced optimal gradient quantization conditions for binary and multi-level quantization, developed novel schemes for dynamic quantization levels.
result Demonstrated superior performance of proposed quantization schemes on CIFAR and ImageNet datasets.
In this article we propose a novel approach to reduce the computational complexity of various approximation methods for pricing discrete time American options. Given a sequence of continuation values estimates corresponding to different levels of spatial approximation and time discretization, we propose a multi-level l…
Enhances social spam detection using multi-level dependency of relational sequences.
problem Social spam detection in multi-relation social networks.
method Developed the Multi-level Dependency Model (MDM) to exploit long-term and short-term dependencies in user relational sequences.
result MDM improves social spam detection accuracy on a real-world multi-relational social network.
Paper introduces a VAE-based framework for multi-level Granger-causal learning.
problem Capturing lead-lag relationships in related dynamical systems.
method Variational Autoencoder (VAE) framework for joint learning.
result Framework handles shared and individual system structures.
COLUMBUS discovers new features to improve domain generalization.
problem Improving machine learning models' ability to generalize to unseen domains.
method COLUMBUS uses targeted corruption of input and multi-level representations to discover new features.
result COLUMBUS achieves state-of-the-art performance on DG benchmarks.
Develops a method to ensure accurate quantile forecasts across multiple levels.
problem Ensuring accurate quantile forecasts at multiple levels, even under distribution shifts.
method Multi-level quantile tracker (MultiQT) wraps around any forecaster to produce calibrated forecasts.
result Guaranteed calibration of quantile forecasts at multiple levels, even against adversarial shifts.
In complex financial systems, the sector structure and volatility clustering are respectively important features of the spatial and temporal correlations. However, the microscopic generation mechanism of the sector structure is not yet understood. Especially, how to produce these two features in one model remains chall…
Improved 3D generative models for drug design reduce bias and enhance data efficiency.
problem Data sparsity and bias in 3D molecular design models.
method Multi-level contrastive learning protocol for bias control and data efficiency.
result Hierarchical generative models that are topologically unbiased and explainable.
JIMA uses multi-level preference data to recommend composite items.
problem Recommending composite items efficiently with multi-level preference information.
method Joint Interaction Modeling (JIMA) approach that integrates multi-level preference data and interactions.
result JIMA outperforms advanced baselines in offline and online settings.
Proposes a novel tensor-based approach for multi-level link prediction.
problem Inferring potential links from observed networks.
method Tensor-based joint network embedding capturing pairwise and hyperlinks.
result Improves hyperlink and pairwise link prediction accuracy.
Simulation study evaluates tree-based imputation methods for multi-level data.
problem Ignoring dependencies in hierarchical data can compromise imputation accuracy.
method Chained Random Forests and Extreme Gradient Boosting (mixgb) adapted for multi-level data.
result Adapted boosting methods outperform traditional MICE for Level-1 variables at higher missingness rates.
New algorithm solves complex optimization problems without needing projections.
problem Optimizing nested functions under convex constraints with noisy evaluations.
method Projection-free conditional gradient-type algorithm for smooth stochastic multi-level composition optimization.
result The algorithm achieves ε ε ε -stationary solutions with complexity bounds independent of ε ε ε and T T T . Dirichlet Process(DP) is a Bayesian non-parametric prior for infinite mixture modeling, where the number of mixture components grows with the number of data items. The Hierarchical Dirichlet Process (HDP), is an extension of DP for grouped data, often used for non-parametric topic modeling, where each group is a mixtur…
Paper tackles missing data in medical records using advanced optimization.
problem Missing data in medical records hinders machine learning applications.
method Applied multi-level stochastic optimization for imputation.
result The method significantly outperforms current approaches and reduces error up to 75%.
Proposes MGPLL for PL learning with non-random noise.
problem Partial label learning with non-random label noise.
method Bi-directional mapping framework, conditional noise label generation, multi-class predictor, adversarial learning.
result Demonstrates state-of-the-art performance in partial label learning.
GraphZoom improves graph embedding accuracy and scalability.
problem Node attribute noise and scalability issues in graph embedding models.
method GraphZoom combines graph fusion and multi-level coarsening to improve accuracy and scalability.
result GraphZoom significantly increases classification accuracy and speeds up the embedding process.
Proposes deep multimodal fusion for biometric identification.
problem Improving biometric identification accuracy with multiple modalities.
method Joint optimization of multiple modality-specific CNNs at different feature abstraction levels.
result Significant improvement in multimodal person identification performance.
Study shows how order flow at multiple price levels affects stock prices.
problem Understanding how order flow at different price levels influences stock prices.
method Fit a linear relationship between multi-level order-flow imbalance (MLOFI) and mid-price changes using high-quality data.
result The inclusion of more price levels in MLOFI improves the fit with mid-price changes.
Efficiently builds large random forests on small hardware.
problem Building large random forests on large datasets with limited resources.
method Multi-level construction scheme with top trees for small subsets and leaf-level processing.
result Constructs ensembles of huge trees for hundreds of millions of training instances efficiently.
New method adapts to unknown mixing time in stochastic optimization.
problem Optimizing with Markovian data where mixing time is unknown.
method Combines MLMC gradient estimation with adaptive learning.
result Achieves optimal convergence rate for convex problems.
BoostNE learns multiple network embeddings from coarse to fine.
problem Complex node interactions cannot be fully captured by a single low-rank embedding matrix.
method BoostNE proposes a multi-level network embedding framework using gradient boosting.
result BoostNE outperforms existing network embedding methods on various datasets.
Study develops advanced models to forecast complex LOB data.
problem Forecasting high-frequency data in a limit order book (LOB).
method Advanced multidimensional sequence-to-sequence models with compound multivariate embedding.
result Method outperforms other multivariate forecasting methods, achieving lowest forecasting error.
A quantitative analysis of the basic components of the daily DJIA. The parameters of the underlying Lorentzian states are obtained by fitting the data. Statistical properties of the states are discussed. This is a practical development of the general method introduced in arXiv:1203.6021.
Driven by the multi-level structure of human intracranial electroencephalogram (iEEG) recordings of epileptic seizures, we introduce a new variant of a hierarchical Dirichlet Process---the multi-level clustering hierarchical Dirichlet Process (MLC-HDP)---that simultaneously clusters datasets on multiple levels. Our sei…
Improved MLMC method boosts risk estimation efficiency.
problem Estimating risk measures like Value-at-Risk in financial risk management.
method Novel MLMC parametrization and antithetic sampling.
result Significantly improved performance in practical settings.
Novel AMM model for pegged cryptoassets using nested OU processes.
problem Liquidity and risk management in markets for pegged cryptoassets.
method Multi-level nested Ornstein-Uhlenbeck (OU) processes for exchange rate dynamics, calibrated and filtered AMM model.
result Consistent efficient quotes and improved liquidity provision for pegged cryptoassets.
New algorithm FLUTE achieves uniform-PAC convergence in RL with linear approx.
problem RL with linear function approximation lacks uniform-PAC guarantees.
method FLUTE algorithm with minimax value function estimator and multi-level partition scheme.
result Uniform-PAC convergence to optimal policy with high probability.
A new histogram layer improves texture analysis performance.
problem Extracting features for texture analysis from local spatial regions.
method Directly computes local spatial distribution of features during backpropagation.
result Improves performance on three material/texture datasets.
Paper develops neural network for Mandarin polyphone disambiguation.
problem Homograph problem in Mandarin Chinese text-to-speech.
method Bidirectional RNN for context, prediction network for mapping embeddings to pronunciations.
result Achieves 94.69% accuracy on polyphonic character dataset.