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

Trend · papers per month

371013 · Jun 201919922001200920172026
48 results for Red Teaming

Proposes RPG-RT for red-teaming T2I models without internal access.

problem Evaluating T2I models' security through red-teaming is challenging due to their closed-source nature and unknown defense mechanisms.
method Integrates LLM and rule-based preference modeling to dynamically adapt to unknown defense mechanisms.
result Demonstrates superior and practical approach for red-teaming T2I models.

We use SMC with twist functions to improve probabilistic inference in LLMs.

problem Improving probabilistic inference in large language models.
method We use Sequential Monte Carlo with learned twist functions to estimate expected future values and focus inference on promising sequences.
result Twisted SMC improves the accuracy of language model inference and evaluation.

We develop a real-time anomaly detection algorithm for directed activity on large, sparse networks. We model the propensity for future activity using a dynamic logistic model with interaction terms for sender- and receiver-specific latent factors in addition to sender- and receiver-specific popularity scores; deviation…

2019-11-13abs ↗pdf ↗

This paper presents the recurrent estimation of distributions (RED) for modeling real-valued data in a semiparametric fashion. RED models make two novel uses of recurrent neural networks (RNNs) for density estimation of general real-valued data. First, RNNs are used to transform input covariates into a latent space to …

2017-05-30abs ↗pdf ↗

Generative ML learns optimal pursuit trajectories in pursuit-evasion games.

problem Optimizing Blue's pursuit trajectory to intercept Red in a game of pursuit-evasion.
method Applying generative machine learning to learn optimal action policies for Blue.
result Generative ML models can learn relevant representations for pursuit-evasion dynamics.

Diffusion LLMs can efficiently generate harmful prompts for adversarial testing.

problem Generating harmful prompts for adversarial testing is resource-intensive and costly.
method Transformed adversarial prompt optimization into an efficient inference task using pretrained Diffusion LLMs.
result Only a few conditional samples are required to generate harmful prompts with high reward.

RED CoMETS improves multivariate time series classification accuracy.

problem Complexity of multivariate time series classification.
method Ensemble classifier RED CoMETS for symbolically represented multivariate time series.
result RED CoMETS achieves highest reported accuracy on 'HandMovementDirection' dataset.

Mathematical model describes how red blood cells return to equilibrium.

problem How red blood cells regain equilibrium after deformation.
method Gradient flow of the Canham-Helfrich functional, proving global existence and convergence for spheres and axisymmetric tori.
result Global existence and convergence of smooth solutions for spheres and axisymmetric tori under specific energy conditions.

SPT predicts age and mass of red giants from spectra.

problem Challenges in age and mass estimation of red giants using traditional methods.
method SPT framework with Multi-head Hadamard Self-Attention and Mahalanobis distance-based loss function.
result Remarkable age and mass estimations with low errors and uncertainties.

In this work we present STEVE - Soccer TEam VEctors, a principled approach for learning real valued vectors for soccer teams where similar teams are close to each other in the resulting vector space. STEVE only relies on freely available information about the matches teams played in the past. These vectors can serve as…

2019-07-30abs ↗pdf ↗

This study uses deep learning to infer stellar parameters from short TESS and K2 observations.

problem Inferring precise stellar parameters from short-duration TESS and K2 observations.
method Developed a machine learning algorithm to infer asteroseismic parameters from one-month-long TESS observations of red giants.
result The algorithm can accurately infer ΔνΔν and νmaxν_{\mathrm{max}} for approximately 50% of TESS samples and ΔΠ1ΔΠ_{1} for about 200 young red-giants from K2.

New method classifies reticulocytes from red blood cells without labels.

problem Classifying reticulocytes from mature red blood cells without fluorescent labels.
method Unsupervised machine learning on morpho-rheological markers.
result Promising results in classifying reticulocytes from mature red blood cells.

Attackers can significantly reduce team rewards in cooperative multi-agent reinforcement learning.

problem Robustness of cooperative multi-agent reinforcement learning to adversaries.
method Novel attack method involving training a policy network and using targeted adversarial examples.
result Reduces team reward from 20 to 9.4 by attacking a single agent, reducing winning rate from 98.9% to 0%.

Paper studies competitive networks where teams aim to minimize their own objectives, adapting to each other's strategies.

problem Competitive networks where teams have conflicting objectives.
method Proposes diffusion learning algorithms for two classes of network games: zero-sum and non-zero-sum.
result Stability performance of proposed algorithms analyzed and demonstrated through experiments.

In this paper, we introduce an insurance ruin model with adaptive premium rate, thereafter refered to as restructuring/refraction, in which classical ruin and bankruptcy are distinguished. In this model, the premium rate is increased as soon as the wealth process falls into the red zone and is brought back to its regul…

2013-06-19abs ↗pdf ↗

VERA-V uses variational inference to discover vulnerabilities in multimodal vision-language models.

problem Existing methods for jailbreaking vision-language models are brittle, limited, and focus on single attacks.
method VERA-V recasts jailbreak discovery as learning a joint posterior distribution over text-image prompts, using variational inference and three complementary strategies.
result VERA-V consistently outperforms state-of-the-art baselines, achieving up to 53.75% higher attack success rate.

RED-2400 is a public benchmark of trading events from a Solana exchange, labeled by algorithmic rejection.

problem Analyzing algorithmically-rejected trading events for insights into market dynamics.
method Public dataset of 6,660 algorithmically-rejected trading events, linked to post-rejection price and liquidity trajectories.
result First window of a planned series of datasets extending the time horizon and enabling regime-stratified analysis.

Technology offers new ways to measure the locations of the players and of the ball in sports. This translates to the trajectories the ball takes on the field as a result of the tactics the team applies. The challenge professionals in soccer are facing is to take the reverse path: given the trajectories of the ball is i…

2015-08-10abs ↗pdf ↗

An online labor platform faces an online learning problem in matching workers with jobs and using the performance on these jobs to create better future matches. This learning problem is complicated by the rise of complex tasks on these platforms, such as web development and product design, that require a team of worker…

2018-09-18abs ↗pdf ↗

CGAs estimate team performance from data, simplifying SV computation.

problem Predicting and rewarding team performance using game theory.
method Cooperative game abstractions (CGAs) for estimating characteristic functions from data.
result CGAs enable linear-time computation of Shapley Value for team contributions.

Scenario discovery is the process of finding areas of interest, known as scenarios, in data spaces resulting from simulations. For instance, one might search for conditions, i.e., inputs of the simulation model, where the system is unstable. Subgroup discovery methods are commonly used for scenario discovery. They find…

2019-10-03abs ↗pdf ↗

We introduce \textcolor{red}{general} new techniques for computing the geometric index of a link LL in the interior of a solid torus TT. These techniques simplify and unify previous ad hoc methods used to compute the geometric index in specific examples \textcolor{red}{ and allow the simple computation of geometric i…

2017-11-12abs ↗pdf ↗

The study uses unsupervised machine learning to identify top European football teams.

problem Selecting teams for the new European football Super League.
method Used Laplacian eigenmaps clustering on performance data.
result Successfully identified four clusters of teams based on performance metrics.

RED detects sleep EEG events using deep neural networks, outperforming previous methods.

problem Manual detection of sleep EEG events is time-consuming and variable.
method Deep Recurrent Neural Networks (RNNs) with convolutional and recurrent components.
result RED outperforms state-of-the-art methods in sleep spindle and K-complex detection.

Coordinated defensive escorts can aid a navigating payload by positioning themselves in order to maintain the safety of the payload from obstacles. In this paper, we present a novel, end-to-end solution for coordinating an escort team for protecting high-value payloads. Our solution employs deep reinforcement learning …

2019-10-09abs ↗pdf ↗

We introduce an efficient method for training the linear ranking support vector machine. The method combines cutting plane optimization with red-black tree based approach to subgradient calculations, and has O(m*s+m*log(m)) time complexity, where m is the number of training examples, and s the average number of non-zer…

2010-05-06abs ↗pdf ↗

New approach for open ad hoc teamwork using graph-based policy learning.

problem Designing autonomous agents to collaborate with changing teams without prior coordination.
method Graph-based policy learning to adapt to dynamic team compositions.
result Successfully models the effects of other agents, leading to robust adaptation and superior performance.

Gradient descent with error feedback performs better than vanilla when features are rare.

problem Improving communication complexity in distributed optimization with rare features.
method Gradient descent with greedy sparsification and error feedback for rare features.
result Communication complexity improves as features become more rare, potentially better than vanilla GD.

Although freelancing work has grown substantially in recent years, in part facilitated by a number of online labor marketplaces, (e.g., Guru, Freelancer, Amazon Mechanical Turk), traditional forms of "in-sourcing" work continue being the dominant form of employment. This means that, at least for the time being, freelan…

2020-02-16abs ↗pdf ↗

We study the relationship between social media output and National Football League (NFL) games, using a dataset containing messages from Twitter and NFL game statistics. Specifically, we consider tweets pertaining to specific teams and games in the NFL season and use them alongside statistical game data to build predic…

2013-10-25abs ↗pdf ↗