-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathresearch.html
More file actions
executable file
·139 lines (114 loc) · 7.68 KB
/
research.html
File metadata and controls
executable file
·139 lines (114 loc) · 7.68 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
<html>
<title>Research</title>
<head>
<meta name="viewport" content="width=device-width, initial-scale=1">
<style>
* {
box-sizing: border-box;
}
body {
margin: 10;
}
img {
max-width: 100%;
height: auto;
}
.footer{
bottom:0;
left: 0;
content: "";
display: table;
width: 100%;
clear: both;
}
.stripe {
float: left;
width: 100%;
padding: 10px;
}
/* Create two equal columns that floats next to each other */
.column {
float: left;
width: 30%;
padding: 10px;
}
/* Clear floats after the columns */
.row:after {
content: "";
display: table;
clear: both;
}
</style>
</head>
<body>
<font face="courier" size=4>
<br>
<hr>
<div class="row">
<div class="stripe" style="background-color:#ededed;">
<center><p><b><a href="index.html">About Me</a></b> | <b><a href="research.html">Research</a></b> | <b><a href="curriculum_vitae.pdf">CV</a></b></p></center>
</div>
</div>
<hr>
<center><u><h1>Research</h1></u></center>
<h4><b>Ongoing Work:</b></h4>
<p>
<ul>
<li>Graphical Economics with Resale<br><small>Team Members: <a href="index.html">Gabriel P. Andrade</a>, Prof. <a href="http://www.cs.colorado.edu/~raf/">Rafael Frongillo</a>, Elliot Gorokhovsky, and Sharadha Srinivasan</small><br><p><sup>We extend the Kakade, Kearns, and Ortiz (KKO) graph-theoretic generalization of the classic Arrow--Debreu (AD) exchange economy, by allowing agents to purchase goods on credit in order to resell them. Our model interpolates between AD and KKO through the credit parameter, with zero credit giving KKO and infinite (or sufficiently high) credit giving AD. Via a reduction to a special case of AD with production, we prove the existence of equilibria for general conditions and adapt existing convex programs for AD with production to our setting.</sup></p>
</li>
</ul>
</p>
<h4><b>Past Work:</b></h4>
<p>
<ul>
<li>Hierarchical Network Structure and Dynamics Motivated by Brains<br><small>Team Members: <a href="index.html">Gabriel P. Andrade</a></small><br><small>Advised By: Prof. Robert Kozma & Prof. Miklós Ruszinkó</small><br><p><sup>I conducted this work in the <a href="http://binds.cs.umass.edu/">BINDS</a> lab as part of the DARPA funded project entitled “Superior AI”. We aimed to encode associative memories into the dynamic regimes of hierarchical networks. The system we studied is most easily described as a percolation cellular automaton that has been repurposed with rules and connectivity structures gleaned from biological insights on the cerebral cortex. This simple neuron model is incredibly flexible and produces a diverse array of distinct dynamic behaviours throughout its phase space. More information on this work can be found on the project's research page <a href="https://binds.cs.umass.edu/graphNetworkMain.html">here</a>. In addition, technical details are described in <a href="sorry.html">this manuscript</a>. For information on project "Superior AI" in general, please consult the <a href="https://binds.cs.umass.edu/darpaSuperiorAi.html">project website</a>.</sup></p>
</li>
<li>Recurrent Systems for EMG-based Hand Gesture Recognition<br><small>Team Members: Connor Amorin, <a href="index.html">Gabriel P. Andrade</a>, Chris Brissette, Matthew Gagnon, Brandon Iles, Jimmy Smith, and Lance Wrobel</small><br><small>Advised By: Prof. Qian-Yong Chen</small><br><p><sup>This was the second project of the yearly projects required for my M.S. degree. We compared models for classifying electromyography (EMG) signals. Particular emphasis was placed on recurrent neural networks (RNNs) and Reservoire Computing. Slides about this work are found <a href="seminaryear2_slides.pdf">here</a>.</sup></p>
</li>
<li>Deep Neural Networks for Classifying Breast Masses From Mammograms<br><small>Team Members: <a href="index.html">Gabriel P. Andrade</a>, Dean Katsaros, Oliver Spiro</small><br><small>Advised By: Prof. Nathaniel Whitaker</small><br><p><sup>This was the first of the yearly projects that are part of my M.S. requirements. During this project, all 12 of the Applied Math M.S. students worked together to develop an autonomous end-to-end system for breast mass detection and diagnosis. Along with two team members, I was tasked with evaluating neural network architectures and classical machine learning techniques for the classification of mammograms. Due to relatively small amounts of data (as is often the case with medical data), we explored different methods for data augmentation and transfer learning. Details about the entire project can be found in <a href="seminaryear1_deptnewsletter.pdf">this article</a>. Slides about this work are found <a href="seminaryear1_slides.pdf">here</a>. The article I just linked, along with a bunch of interesting things (problems, articles, etc.), can be found in the UMass Math & Stats <a href="https://www.math.umass.edu/sites/www.math.umass.edu/files/newsletters/2017mathnewsletter.pdf">2016-2017 Department Newsletter</a>.</sup></p>
</li>
<li>A Matroid Generalization of Sperner's Lemma<br><small>Team Members: <a href="index.html">Gabriel P. Andrade</a>, Andrés Rodríguez Rey, Alberto Ruiz</small><br><small>Advised By: Prof. Francis Su & Prof. Mutiara Sondjaja</small><br><p><sup>I conducted this work as part of a summer REU at <a href="https://www.msri.org/web/cms">MSRI</a>. In a team of three, we spent the summer working to improve a bound given in a paper from 1980 by Prof. László Lovász. In that paper he generalized Sperner's lemma for matroids by showing that triangulations of a d-simplex, labeled with elements of a matroid M, must contain at least one "basis simplex". We found a small counterexample to Prof. Lovász's claim, made an addenda so that the statement holds, uncovered properties of matroids and the labeling which influence the bound, and more. All of our results from that summer are recorded in <a href="MSRIREUPaperZ.pdf">this manuscript</a>. A video of a talk we gave on this work can be found <a href="http://www.msri.org/msri_ups/765/schedules/20094">here</a>.</sup></p>
<p><sup>I would like to mention that this work was done at the <a href="http://www.msri.org/msri_ups/765">MSRI-UP 2015</a> REU. I encourage any undergraduate student with an interest in math to seek out more information about <a href="https://www.msri.org/web/msri/education/for-undergraduates/msri-up">MSRI-UP</a>. My summer there had a huge impact on my research interests, academic maturity, and career plans. In addition to being academically/professionally enriching, it was just an incredible way to spend a summer (arguably one of the best times I've had in my life).</sup></p>
</li>
</ul>
</p>
<script type="text/javascript">
var tmonth=new Array("January","February","March","April","May","June","July","August","September","October","November","December");
function GetClock() {
var d=new Date();
var nmonth=d.getMonth(),ndate=d.getDate(),nyear=d.getYear();
if(nyear<1000) {
nyear+=1900;
}
var d=new Date();
var nhour=d.getHours(),nmin=d.getMinutes(),ap;
if(nhour==0) {
ap=" AM";nhour=12;
}
else if(nhour<12) {
ap=" AM";
}
else if(nhour==12) {
ap=" PM";
}
else if(nhour>12) {
ap=" PM";
nhour -= 12;
}
if(nmin<=9) {
nmin="0" + nmin;
}
document.getElementById('clockbox').innerHTML=""+tmonth[nmonth]+" "+ndate+", "+nyear+" "+nhour+":"+nmin+ap+"";
}
window.onload=function() {
GetClock();
setInterval(GetClock, 1000);
}
</script>
<div class="footer">
<hr><center><div class="stripe" style="background-color:#ededed;">
<div id="clockbox"></div>
</div><hr></center>
</div>
</body>
</html>