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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for cocktail party problem

We propose an algorithm to separate simultaneously speaking persons from each other, the "cocktail party problem", using a single microphone. Our approach involves a deep recurrent neural networks regression to a vector space that is descriptive of independent speakers. Such a vector space can embed empirically determi…

2017-05-12abs ↗pdf ↗

Curvature formulas on regular graphs identified bone idle edges and graphs.

problem Understanding curvature in regular graphs and identifying bone idle edges.
method Explicit formulas for Lin-Lu-Yau and Ollivier-Ricci curvatures derived from graph parameters.
result Equality condition on regular graphs for Ollivier-Ricci curvature and characterization of bone idle edges.

Inspired by brain's modality fusion, this paper detects active speakers from audio and video.

problem Detecting active speakers in noisy environments.
method Inspired by brain's superior colliculus, combines audio and visual data through specialized neural networks and a novel fusion layer.
result Achieved results greatly surpassing initial expectations, confirming the effectiveness of the proposed method.

The study bounds the effective diameter of graphs with positive Ollivier curvature.

problem Bounding the effective diameter of graphs with positive Ollivier curvature.
method Introducing reflective graphs and proving discrete Bonnet Myers theorem.
result The effective diameter bound is attained only for specific graphs.

Deep clustering is a recently introduced deep learning architecture that uses discriminatively trained embeddings as the basis for clustering. It was recently applied to spectrogram segmentation, resulting in impressive results on speaker-independent multi-speaker separation. In this paper we extend the baseline system…

2016-07-07abs ↗pdf ↗

A prototypical blind signal separation problem is the so-called cocktail party problem, with n people talking simultaneously and n different microphones within a room. The goal is to recover each speech signal from the microphone inputs. Mathematically this can be modeled by assuming that we are given samples from an n…

2012-11-07abs ↗pdf ↗

Differentially-private FNAS protects privacy while collaboratively searching for neural architectures.

problem Collaborative neural architecture search with privacy concerns.
method Federated Neural Architecture Search (FNAS) with differential privacy (DP-FNAS).
result DP-FNAS can search for highly-performant neural architectures while protecting individual parties' privacy.

We introduce a two-agent problem which is inspired by price asymmetry arising from funding difference. When two parties have different funding rates, the two parties deduce different fair prices for derivative contracts even under the same pricing methodology and parameters. Thus, the two parties should enter the deriv…

2019-01-12abs ↗pdf ↗

Market incentivizes parties to share high-quality data for collaborative machine learning tasks.

problem Fair revenue distribution and data replication threats in collaborative machine learning markets.
method Introduces a novel payment division function robust to replication and customized output models.
result Validated assumptions and showed approximate satisfaction for commonly used models.

Multi-party machine learning leaks global dataset properties even with black-box access.

problem Leakage of global dataset properties in multi-party machine learning.
method Demonstrated leakage of sensitive attribute distributions in pooled data.
result A curious party can infer sensitive attribute distributions in other parties' data with high accuracy.

In [1] Zawadoski introduces a banking network model in which the asset and counter-party risks are treated separately and the banks hedge their assets risks by appropriate OTC contracts. In his model, each bank has only two counter-party neighbors, a bank fails due to the counter-party risk only if at least one of its …

2014-02-21abs ↗pdf ↗

SecureGBM securely trains GBM models across two parties without revealing data.

problem Securely training GBM models across parties with encrypted data.
method Extending LightGBM with semi-homomorphic encryption and stochastic approximation.
result SecureGBM achieves AUC within 3% of non-secure LightGBM, maintaining performance.

This paper examines how voter concentration affects election outcomes in district-based systems.

problem How does the spatial concentration of electors impact election results?
method The authors frame the spatial distribution of electors in a probabilistic setting and explore models to capture intra-district polarization. They use Likelihood-free Inference under the Approximate Bayesian Computation framework and supervised regression methods to estimate parameters.
result The models can capture statistical properties of real elections and show how voter distributions can change election results.

Federated Learning is introduced to protect privacy by distributing training data into multiple parties. Each party trains its own model and a meta-model is constructed from the sub models. In this way the details of the data are not disclosed in between each party. In this paper we investigate the model interpretation…

2019-05-11abs ↗pdf ↗

Voluntary insurance contracts constitute a puzzle because they increase the expectation value of one party's wealth, whereas both parties must sign for such contracts to exist. Classically, the puzzle is resolved by introducing non-linear utility functions, which encode asymmetric risk preferences; or by assuming the p…

2015-07-16abs ↗pdf ↗

We introduce a class of financial contracts involving several parties by extending the notion of a two-person game option (see Kifer (2000)) to a contract in which an arbitrary number of parties is involved and each of them is allowed to make a wide array of decisions at any time, not restricted to simply `exercising t…

2014-05-12abs ↗pdf ↗

Unified approach to federated learning improves robustness and personalization.

problem Real-world federated learning challenges like non-IID data and outliers.
method Fed+ methods that unify federated learning algorithms for better robustness and personalization.
result Convergence guarantees for Fed+ on convex and non-convex loss functions under various aggregation methods.

A scalable protocol for federated averaging with privacy and correctness guarantees.

problem Privacy and correctness in federated learning from multiple parties.
method Scalable protocol using correlated and independent Gaussian noise, analyzed for differential privacy and graph topology.
result Nearly matches trusted curator model's utility with minimal communication.

Private method measures nonlinear correlations between data hosted across two entities.

problem Measuring nonlinear correlations between sensitive data hosted across multiple parties while preserving privacy.
method Differentially private estimator of distance correlation.
result First private estimator of nonlinear correlations in a multi-party setup.

The paper proposes a model reward scheme for collaborative ML based on Shapley value and information gain.

problem Designing fair incentives for collaborative machine learning.
method The paper proposes a reward scheme based on Shapley value and information gain, with properties like fairness and stability.
result The proposed reward scheme satisfies fairness and trade-offs between desirable properties via an adjustable parameter.

Study tackles RLHF with diverse human feedback, showing limitations and proposing a meta-learning approach.

problem Traditional RLHF fails to balance diverse human preferences.
method Integrates meta-learning and multiple social welfare functions to optimize diverse preferences.
result Establishes sample complexity bounds for optimizing diverse social welfare functions.

Back cover text: Megaprojects and Risk provides the first detailed examination of the phenomenon of megaprojects. It is a fascinating account of how the promoters of multibillion-dollar megaprojects systematically and self-servingly misinform parliaments, the public and the media in order to get projects approved and b…

2013-03-28abs ↗pdf ↗

In this work, we demonstrate universal multi-party poisoning attacks that adapt and apply to any multi-party learning process with arbitrary interaction pattern between the parties. More generally, we introduce and study (k,p)(k,p)-poisoning attacks in which an adversary controls k[m]k\in[m] of the parties, and for each cor…

2018-09-10abs ↗pdf ↗

The paper uses Black-Scholes model to analyze political support and coalition agreements.

problem Determining the minimum support level for a minor party in a pre-electoral coalition.
method Modeling political support as a stochastic process with a deterministic growth rate and applying Black-Scholes option pricing theory.
result The minimum support level for a minor party to gain a representative in a pre-electoral coalition.

In this paper, we have studied the pricing of a continuously collateralized CDS. We have made use of the "survival measure" to derive the pricing formula in a straightforward way. As a result, we have found that there exists irremovable trace of the counter party as well as the investor in the price of CDS through thei…

2011-04-11abs ↗pdf ↗

A framework for collaborative learning reduces communication rounds.

problem Collaborative learning with distributed features and privacy concerns.
method Federated Stochastic Block Coordinate Descent (FedBCD) algorithm.
result The algorithm achieves O(T)O(\sqrt{T}) communication rounds and O(1/T)O(1/\sqrt{T}) accuracy.

A new framework for federated learning tackles challenges with horizontally partitioned labels and stragglers.

problem Challenges with horizontally partitioned labels and stragglers in federated learning.
method Proposes a novel vertical federated learning framework named Cascade Vertical Federated Learning (CVFL) to fully utilize all horizontally partitioned labels and mitigate stragglers.
result Demonstrates comparable performance to centralized training and mitigates stragglers.

Privacy-preserving eye tracking framework using synthetic images.

problem Preserving sensitive personal information in eye tracking technology.
method Randomized encoding for privacy, Support Vector Regression model training on synthetic eye images.
result Framework achieves real-time gaze estimation with same accuracy as non-private version.

The current standalone deep learning framework tends to result in overfitting and low utility. This problem can be addressed by either a centralized framework that deploys a central server to train a global model on the joint data from all parties, or a distributed framework that leverages a parameter server to aggrega…

2019-06-04abs ↗pdf ↗

Secure neural network inference on untrusted platforms using holographic reduced representations.

problem Secure neural network inference on untrusted platforms.
method Connectionist Symbolic Pseudo Secrets using Holographic Reduced Representations (HRR).
result Empirical robustness to attack under various threat models.

Improved privacy-preserving summation protocol with fewer messages.

problem Achieving efficient differential privacy in multi-party summation.
method Combining secure shuffling with Laplace mechanism in the shuffle model.
result Protocol with O(1/ε)O(1/ε) error and O(log(n/δ))O(\log(n/δ)) messages per party.

Unlike other industries in which intellectual property is patentable, the financial industry relies on trade secrecy to protect its business processes and methods, which can obscure critical financial risk exposures from regulators and the public. We develop methods for sharing and aggregating such risk exposures that …

2011-11-19abs ↗pdf ↗

The paper proposes a fair and private decentralized deep learning framework.

problem Ensuring fairness and privacy in collaborative deep learning.
method A reputation system and differential privacy are used. FDPDDL framework is built with two stages: initialisation and update.
result FDPDDL achieves high fairness, comparable accuracy to centralised and distributed frameworks, and better accuracy than standalone.