Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

237473710946 · Jun 202019922001200920172026
48 results for multi-level networks

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.

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.

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 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.

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.

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.

3D object recognition accuracy can be improved by learning the multi-scale spatial features from 3D spatial geometric representations of objects such as point clouds, 3D models, surfaces, and RGB-D data. Current deep learning approaches learn such features either using structured data representations (voxel grids and o…

2018-05-30abs ↗pdf ↗

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.

Feature matters for salient object detection. Existing methods mainly focus on designing a sophisticated structure to incorporate multi-level features and filter out cluttered features. We present Progressive Feature Polishing Network (PFPN), a simple yet effective framework to progressively polish the multi-level feat…

2019-11-14abs ↗pdf ↗

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…

2012-04-29abs ↗pdf ↗

A new graph neural network framework captures long-range interactions efficiently.

problem Efficiently modeling long-range interactions in graph neural networks for PDEs.
method Proposes a multi-level graph neural network framework using multipole methods.
result Captures interaction at all ranges with only linear complexity, learning discretization-invariant solution operators.

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).

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.

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.

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.

Proposes MLCNN for better multivariate time series forecasting.

problem Challenges in forecasting multivariate time series, especially the limitation of predicting only one future moment.
method MLCNN, a multi-task deep learning framework inspired by Construal Level Theory, fuses future visions of near and distant future predictions.
result Significant improvements in forecasting accuracy (4.59% RMSE reduction, 6.87% MAE reduction) on real-world datasets.

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…

2015-02-02abs ↗pdf ↗

Proposes MGMN for end-to-end graph similarity learning.

problem Lack of cross-level interactions in graph similarity learning.
method Multi-level graph matching network (MGMN) combining node-graph matching and siamese graph neural networks.
result MGMN outperforms state-of-the-art models on graph-graph classification and regression tasks.

Improved neural model for social recommendation by integrating social and interest networks.

problem Data sparsity and lack of higher-order relationships in social recommendation.
method DiffNet++ models neural influence diffusion and interest diffusion in a unified framework using a multi-level attention network.
result Extensive experiments on real-world datasets show the effectiveness of DiffNet++.

Improved accuracy in dynamic response variation analysis using multi-fidelity data fusion.

problem Inefficient characterization of dynamic response variation due to limited high-fidelity data.
method Composite Neural Network fusion approach for multi-level, heterogeneous datasets.
result Improved accuracy in frequency response variation characterization.

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…

2013-03-06abs ↗pdf ↗

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.

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.

Text documents are structured on multiple levels of detail: individual words are related by syntax, but larger units of text are related by discourse structure. Existing language models generally fail to account for discourse structure, but it is crucial if we are to have language models that reward coherence and gener…

2015-11-12abs ↗pdf ↗

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 TT.

We study the multi-level order-flow imbalance (MLOFI), which is a vector quantity that measures the net flow of buy and sell orders at different price levels in a limit order book (LOB). Using a recent, high-quality data set for 6 liquid stocks on Nasdaq, we fit a simple, linear relationship between MLOFI and the conte…

2019-07-14abs ↗pdf ↗

In this work we propose a new deep learning tool called deep dictionary learning. Multi-level dictionaries are learnt in a greedy fashion, one layer at a time. This requires solving a simple (shallow) dictionary learning problem, the solution to this is well known. We apply the proposed technique on some benchmark deep…

2016-01-31abs ↗pdf ↗

For better classification generative models are used to initialize the model and model features before training a classifier. Typically it is needed to solve separate unsupervised and supervised learning problems. Generative restricted Boltzmann machines and deep belief networks are widely used for unsupervised learnin…

2018-04-25abs ↗pdf ↗

Deep residual networks (ResNets) and their variants are widely used in many computer vision applications and natural language processing tasks. However, the theoretical principles for designing and training ResNets are still not fully understood. Recently, several points of view have emerged to try to interpret ResNet …

2017-10-27abs ↗pdf ↗