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,695 papers · 148 categories

Trend · papers per month

9.0%18.0%27.0%36.0% · Feb 202619922001200920172026
48 results for set aggregation

Recently, it has been shown that many functions on sets can be represented by sum decompositions. These decompositons easily lend themselves to neural approximations, extending the applicability of neural nets to set-valued inputs---Deep Set learning. This work investigates a core component of Deep Set architecture: ag…

2019-03-18abs ↗pdf ↗

SACP aggregates nonconformity scores from multiple predictors to create more efficient uncertainty sets.

problem Combining predictive uncertainties from multiple models for efficient and reliable uncertainty quantification.
method SACP (Symmetric Aggregated Conformal Prediction) aggregates nonconformity scores using a flexible symmetric aggregation function.
result SACP consistently improves efficiency and often outperforms state-of-the-art model aggregation baselines.

Fishnets improve set and graph learning with scalable, robust aggregation.

problem Learning informative embeddings for sets and graphs with scalable and robust aggregation.
method Proposes Fishnets, a new aggregation strategy for set-based learning.
result Fishnets achieve state-of-the-art performance on graph datasets with fewer parameters and faster training.

The paper examines risk aggregation under mixtures of marginals, finding that more homogeneous distributions lead to larger uncertainty.

problem Investigating the impact of mixing on risk aggregation uncertainty.
method Analyzes ordering relations and inequalities for aggregation sets under distribution and quantile mixtures.
result More homogeneous marginals result in larger aggregation sets, indicating greater model uncertainty.

We improve prediction set coverage by assigning weights to individual sets.

problem Aggregating multiple prediction sets weakens overall coverage guarantee.
method Propose a framework for weighted aggregation of prediction sets.
result Achieve tighter coverage bounds that interpolate between 12α1-2\alpha and 1α1-\alpha guarantees.

Aggregation challenges causal interpretation of IV estimators.

problem Aggregation of fine-grained components into an aggregate treatment variable.
method Characterization of conditions for identifying aggregate causal effects.
result Standard IV estimators cannot identify aggregate causal effects due to ambiguous dependencies.

Active learning method reduces labeling cost for regression models with aggregated data.

problem Reducing labeling cost for training regression models with aggregated data.
method Sequentially selects sets to be labeled using mutual information quantifying model parameter uncertainty.
result Achieves better predictive performance with fewer labeled sets.

SCHA-VAE generates novel data from limited examples using hierarchical context aggregation.

problem Generating data from a novel distribution with limited examples.
method Hierarchical context aggregation with attention-based point to set-level aggregation.
result Hierarchical approach better captures intrinsic variability in small data.

This work introduces COLA, a strategy to aggregate conformal prediction sets efficiently.

problem Efficiently combining multiple conformity scores to reduce prediction set size.
method Introduces COnfidence-Level Allocation (COLA) to optimally allocate confidence levels across sets.
result COLA achieves smaller prediction sets than state-of-the-art methods while maintaining valid coverage.

U-aggregation combines multiple models without labels for better risk prediction.

problem Challenges in selecting best model for new populations due to limited data and lack of true labels.
method U-aggregation, an unsupervised model aggregation method that integrates pre-trained models without observed labels.
result U-aggregation improves genetic risk prediction of complex traits using publicly available models.

Improved defense against data poisoning attacks by aggregating smaller subsets.

problem Mitigating the impact of poisoned data on model robustness.
method Finite Aggregation method that combines duplicates of smaller disjoint subsets for training.
result Consistent improvement in certified robustness bounds, up to 4.77% on GTSRB.

The paper compares aggregated data labels in curated and random bags for machine learning models.

problem Protecting user privacy in machine learning systems with aggregated data.
method Examined curated and random bags for training machine learning models and compared their performance.
result Gradient-based learning can be performed on aggregated data without performance degradation.

Improved local explainer aggregation for interpretable machine learning models.

problem Improving the interpretability of black box machine learning models.
method Non-convex optimization and integer optimization framework for local explainer aggregation.
result Our method outperforms existing methods in terms of coverage and fidelity, particularly in multi-class settings.

This paper addresses the problem of rank aggregation, which aims to find a consensus ranking among multiple ranking inputs. Traditional rank aggregation methods are deterministic, and can be categorized into explicit and implicit methods depending on whether rank information is explicitly or implicitly utilized. Surpri…

2013-09-26abs ↗pdf ↗

This paper solves aggregation of Pareto optimal models by using Bayesian priors and weighted averaging.

problem How to rationally aggregate Pareto optimal models while preserving Pareto efficiency.
method Four logical steps: 1) Bayesian models, 2) Prior as preference ranking, 3) Consistent aggregation, 4) Weighted average of priors.
result All rational/consistent aggregation rules follow a generalized hierarchical Bayesian model.

Estimates variance function using aggregation methods in regression models.

problem Estimating variance function in regression models.
method Two-step procedure involving model selection or convex aggregation, using two independent samples.
result Consistency of the proposed method in L2 error for MS and C aggregations.

BOA improves financial forecasting by combining expert models.

problem Challenges in choosing between multiple machine learning models for financial forecasting.
method Online aggregation of expert models using Bernstein Online Aggregation (BOA) procedure.
result BOA leads to better portfolio performance, higher Sharpe Ratio, and lower shortfall.

CAOS aggregates multiple one-shot predictors for efficient uncertainty quantification.

problem Lack of principled uncertainty quantification in one-shot prediction.
method CAOS, a conformal framework that aggregates multiple one-shot predictors and uses a leave-one-out calibration scheme.
result CAOS produces smaller prediction sets with reliable coverage compared to split conformal baselines.

Probabilistic graphical models are graphical representations of probability distributions. Graphical models have applications in many fields including biology, social sciences, linguistic, neuroscience. In this paper, we propose directed acyclic graphs (DAGs) learning via bootstrap aggregating. The proposed procedure i…

2014-06-09abs ↗pdf ↗

Early-stopped aggregation improves computational efficiency in adaptive statistical inference.

problem Computational inefficiency in model selection and aggregation for adaptive inference.
method Early-stopped aggregation (ESA) framework: compute only a few simpler models using early-stopping criteria.
result ESA achieves optimal adaptive contraction rates in variational Bayes and frequentist settings.

We develop a secure aggregation protocol for federated learning that reduces communication and computation costs.

problem Expensive communication and privacy concerns in federated learning.
method Adapting compression-based federated techniques to additive secret sharing.
result Our protocol achieves high accuracy with low communication costs and is more efficient than prior work.

A conformal procedure improves CoT reasoning by aggregating reasoning paths and calibrating abstention rules.

problem Aggregation uncertainty in chain-of-thought reasoning makes correct answers less reliable.
method Introduces a conformal procedure for CoT reasoning that uses weighted score aggregation and abstention rules.
result Achieves higher selective accuracy with abstention, reducing confident-error rate.

Researchers improve deep ensemble forecast aggregation methods.

problem Aggregating forecast distributions from deep ensembles for better predictive performance.
method Comprehensive analysis of twelve benchmark data sets, comparing probability- and quantile-based aggregation methods for three neural network-based approaches.
result A general quantile aggregation framework for deep ensembles improves predictive performance in various settings.

Calibrated models can lead to miscalibrated aggregations in strategic interactions.

problem Miscalibration in aggregated predictions from multiple calibrated models.
method Analysis of strategic interactions between calibrated predictors, proving conditions for miscalibration and comparing VCG and Brier-score aggregation methods.
result VCG aggregation method outperforms Brier-score in strategic settings, providing robustness and comparable accuracy.

Federated learning is the centralized training of statistical models from decentralized data on mobile devices while preserving the privacy of each device. We present a robust aggregation approach to make federated learning robust to settings when a fraction of the devices may be sending corrupted updates to the server…

2019-12-31abs ↗pdf ↗

Study online learning in MDPs with aggregate bandit feedback, achieving low regret in both stochastic and adversarial settings.

problem Online learning in finite-horizon episodic MDPs with aggregate bandit feedback.
method Best-of-both-worlds (BOBW) algorithms using FTRL over occupancy measures, self-bounding techniques, and new loss estimators.
result First BOBW algorithms for episodic tabular MDPs with aggregate bandit feedback achieving O(logT)O(\log T) regret in stochastic and O(T){O}(\sqrt{T}) regret in adversarial settings.

The financial crisis showed the importance of measuring, allocating and regulating systemic risk. Recently, the systemic risk measures that can be decomposed into an aggregation function and a scalar measure of risk, received a lot of attention. In this framework, capital allocations are added after aggregation and can…

2016-07-12abs ↗pdf ↗

Optimal transport aggregation combines distributed MoE models efficiently.

problem Combining local MoE models trained on distributed datasets.
method Optimal transport for minimizing divergence between local and global estimators, with MM algorithm for optimization.
result Aggregated estimator achieves performance comparable to centralized training but with reduced computation time.

In classification, the de facto method for aggregating individual losses is the average loss. When the actual metric of interest is 0-1 loss, it is common to minimize the average surrogate loss for some well-behaved (e.g. convex) surrogate. Recently, several other aggregate losses such as the maximal loss and average t…

2018-11-01abs ↗pdf ↗

Unified approach for federated learning using MM optimization.

problem Scaling stochastic optimization to federated learning.
method Unified Majorize-Minimize (MM) framework for stochastic optimization, extended to federated learning.
result Unified algorithm \QSMM\ for federated learning that aggregates surrogate majorizing functions.

Aggregation distorts causal discovery results but recovery is possible with partial linearity or prior.

problem Understanding how temporal aggregation affects causal discovery in aggregated data.
method Functional consistency and conditional independence consistency methods.
result Causal discovery results may be distorted by aggregation, but recovery is possible with certain conditions.

Aggregation defenses improve deep learning models' robustness against data poisoning attacks.

problem Data poisoning attacks manipulate deep learning models with malicious training samples.
method Deep Partition Aggregation, efficiency improvements, data-to-complexity ratio, poisoning overfitting phenomenon.
result Aggregation defenses boost poisoning robustness through the poisoning overfitting phenomenon.

Proposes a method for evaluating multiple dimensions of organizational effectiveness using DEA.

problem Evaluating multiple dimensions of organizational effectiveness in large data sets.
method Introduces two regularized DEA models (SBM and GP-SBM) to estimate both dimension-specific and aggregate efficiency scores.
result Demonstrates improved efficiency and validity compared to conventional methods.