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

1223 · Feb 201819922001200920172026
48 results for EGO

TREGO improves EGO for global optimization of high-dimensional problems.

problem Efficient Global Optimization struggles with high dimensions and lacks theoretical guarantees.
method TREGO alternates between EGO steps and local steps within a trust region.
result TREGO outperforms EGO and other methods in black-box optimization problems.

In this paper, we investigate the capability of the universal Kriging (UK) model for single-objective global optimization applied within an efficient global optimization (EGO) framework. We implemented this combined UK-EGO framework and studied four variants of the UK methods, that is, a UK with a first-order polynomia…

2018-03-23abs ↗pdf ↗

In an ego-network, an individual (ego) organizes its friends (alters) in different groups (social circles). This social network can be efficiently analyzed after learning representations of the ego and its alters in a low-dimensional, real vector space. These representations are then easily exploited via statistical mo…

2020-02-16abs ↗pdf ↗

Understanding how images of objects and scenes behave in response to specific ego-motions is a crucial aspect of proper visual development, yet existing visual learning methods are conspicuously disconnected from the physical source of their images. We propose to exploit proprioceptive motor signals to provide unsuperv…

2015-05-08abs ↗pdf ↗

The Efficient Global Optimization (EGO) algorithm uses a conditional Gaus-sian Process (GP) to approximate an objective function known at a finite number of observation points and sequentially adds new points which maximize the Expected Improvement criterion according to the GP. The important factor that controls the e…

2016-03-08abs ↗pdf ↗

This work improves GNN training efficiency by maximizing ego-graph information.

problem Training dedicated GNNs is costly for large-scale graphs.
method Proposes EGI (Ego-Graph Information maximization) to capture essential graph information and establish a theoretical framework for transfer learning.
result Demonstrates the effectiveness of EGI in improving GNN training efficiency and transferability.

Optimization of very expensive black-box functions requires utilization of maximum information gathered by the process of optimization. Model Guided Sampling Optimization (MGSO) forms a more robust alternative to Jones' Gaussian-process-based EGO algorithm. Instead of EGO's maximizing expected improvement, the MGSO use…

2015-08-31abs ↗pdf ↗

Heterophily affects GNN robustness; separating ego- and neighbor-embeddings improves defense.

problem The robustness of GNNs to adversarial attacks.
method Formalized relation between heterophily and GNN robustness; empirical analysis; design principles for improved robustness.
result Separating ego- and neighbor-embeddings increases GNN robustness.

Designing the architecture for an artificial neural network is a cumbersome task because of the numerous parameters to configure, including activation functions, layer types, and hyper-parameters. With the large number of parameters for most networks nowadays, it is intractable to find a good configuration for a given …

2018-10-10abs ↗pdf ↗

A Ph.D. thesis proposes an efficient approach for optimizing aircraft eco-design with high-dimensional mixed integer variables.

problem Optimizing aircraft eco-design with high-dimensional mixed integer variables.
method EGO optimization approach based on sequential enrichment of adaptive surrogate models, adapted for high-dimensional and mixed variable spaces.
result Effective parameterization tools significantly reduce the number of design variables, enabling optimization of complex aircraft concepts.

This paper develops a coreset method for GNNs that speeds up training on large graphs.

problem Training Graph Neural Networks (GNNs) on large-scale graphs is computationally expensive.
method The paper proposes a spectral greedy coreset (SGGC) method that selects ego-graphs based on spectral embeddings.
result SGGC significantly speeds up GNN training on large graphs and outperforms other coreset methods.

Artificial intelligence, or AI, enhancements are increasingly shaping our daily lives. Financial decision-making is no exception to this. We introduce the notion of AI Alter Egos, which are shadow robo-investors, and use a unique data set covering brokerage accounts for a large cross-section of investors over a sample …

2019-07-08abs ↗pdf ↗

This research tackles intervention-centric causal reasoning in learning agents by using meta-learning.

problem Learning agents lack the concept of interventions, making causal learning challenging.
method A meta-reinforcement learning algorithm is used to learn causal relationships from observational data.
result The approach enables agents to learn and manipulate the environment effectively.

PIP-Net predicts pedestrian crossing intentions with up to 4-second lead.

problem Accurate pedestrian intention prediction for autonomous vehicles in real-world scenarios.
method Recurrent and temporal attention-based model using kinematic and spatial features.
result PIP-Net predicts pedestrian crossing intentions up to 4 seconds in advance.

MIDAS learns to adaptively control other cars in urban driving scenarios.

problem Autonomous vehicles need to interact with other agents on the road.
method Reinforcement learning with attention mechanism to handle multiple agents.
result MIDAS policies are adaptive and robust to external changes.

Study shows peers' graduation improves residents' success in TCs.

problem Identifying peer influence in therapeutic communities adjusting for latent homophily.
method Used data on affirmations and exit dates to form peer networks, modeled latent homophily, and proposed bias correction methods.
result Positive effect of peers' graduation on residents' graduation, varying by gender, race, and role model definition.

MA-COPP predicts multi-agent system outcomes using data from a different policy, with probabilistic guarantees.

problem Predicting outcomes in multi-agent systems using data from a different policy.
method Conformal prediction framework applied to multi-agent systems, avoiding exhaustive search.
result Achieves probabilistic guarantees for multi-agent system predictions.

Validates conformal prediction for network data under non-uniform sampling.

problem Validity of conformal prediction for network data under non-representative sampling.
method Interprets sampling mechanisms as selection rules, studies validity conditional on selection events, uses permutation invariance and joint exchangeability.
result Finite-sample validity of conformal prediction for certain selection events and asymptotic validity for random walk sampling.

Adaptive framework generates challenging adversarial scenarios for autonomous vehicles.

problem Lack of efficient and adaptable evaluation methods for autonomous vehicles.
method Adaptive evaluation framework using ensemble models and nonparametric Bayesian clustering.
result Adversarial scenarios significantly degrade tested autonomous vehicles' performance.

Proposes a non-autoregressive Transformer for time series forecasting.

problem Autoregressive errors and spatial-temporal dependencies in time series forecasting.
method Introduces a Non-Autoregressive Transformer with a learned temporal influence map.
result Demonstrates state-of-the-art performance on time series forecasting datasets.

Model predicts multi-agent trajectories using a differentiable simulator.

problem Predicting future positions of multiple interacting agents.
method Conditional recurrent variational neural networks (CVRNNs) with a kinematic bicycle model.
result Achieves state-of-the-art results on INTERACTION dataset.

Infants are experts at playing, with an amazing ability to generate novel structured behaviors in unstructured environments that lack clear extrinsic reward signals. We seek to mathematically formalize these abilities using a neural network that implements curiosity-driven intrinsic motivation. Using a simple but ecolo…

2018-02-21abs ↗pdf ↗

Graph neural networks struggle with heterophily, but new designs improve their performance.

problem Graph neural networks struggle with heterophily (networks where connected nodes may have different class labels and dissimilar features).
method Ego- and neighbor-embedding separation, higher-order neighborhoods, and combination of intermediate representations.
result The identified designs increase the accuracy of GNNs by up to 40% and 27% over models without them on synthetic and real networks with heterophily, respectively.

New approach uses dynamic programming to efficiently discover failures in autonomous vehicle simulations.

problem Efficiently discovering rare failure events in autonomous vehicle simulations.
method Approximate dynamic programming and scene decomposition to estimate failure distribution.
result Increased number of failures discovered compared to baseline approaches.

A new method for efficient structural node embeddings using Von Neumann entropy.

problem Efficiently identifying structurally equivalent nodes in complex networks.
method VNEstruct: a simple approach generating low-dimensional structural node embeddings using Von Neumann entropy.
result VNEstruct achieves robustness on structural role identification and state-of-the-art performance on graph classification tasks.

Accurately predicting the possible behaviors of traffic participants is an essential capability for future autonomous vehicles. The majority of current researches fix the number of driving intentions by considering only a specific scenario. However, distinct driving environments usually contain various possible driving…

2018-04-10abs ↗pdf ↗

This research tackles information design in multi-agent reinforcement learning.

problem Designing information to influence other adaptive agents in a non-stationary environment.
method Formulated Markov signaling game, introduced signaling gradient and extended obedience constraints.
result Developed efficient algorithm for mixed-motive tasks in multi-agent reinforcement learning.

In online discussion communities, users can interact and share information and opinions on a wide variety of topics. However, some users may create multiple identities, or sockpuppets, and engage in undesired behavior by deceiving others or manipulating discussions. In this work, we study sockpuppetry across nine discu…

2017-03-21abs ↗pdf ↗

We consider the problem of engineering robust direct perception neural networks with output being regression. Such networks take high dimensional input image data, and they produce affordances such as the curvature of the upcoming road segment or the distance to the front vehicle. Our proposal starts by allowing a neur…

2019-09-30abs ↗pdf ↗

The operational space of an autonomous vehicle (AV) can be diverse and vary significantly. This may lead to a scenario that was not postulated in the design phase. Due to this, formulating a rule based decision maker for selecting maneuvers may not be ideal. Similarly, it may not be effective to design an a-priori cost…

2019-03-29abs ↗pdf ↗

This paper improves transportation efficiency by teaching automated vehicles to cooperate.

problem Improving efficiency and safety of transportation systems with automated vehicles.
method Multi-agent graph reinforcement learning with attention mechanism.
result Automated vehicles can achieve better performance when learning to cooperate with each other.